You do not have access to this content.
In order to access the 'Quiz Zone' and all of its contents, please purchase a 'Premium Course'.
Quiz Summary
0 of 10 questions completed
Questions:
Information
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You must first complete the following:
Results
Results
0 of 10 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Categories
- Problem Solving / Algorithms 0%
-
Well done! It’s over! Now review your answers and continue working on your knowledge of any areas where you made a mistake.
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- Current
- Review
- Answered
- Incorrect
-
Question 1 of 10
1. Question
Which description best describes an insertion sort algorithm?
CorrectIncorrect -
Question 2 of 10
2. Question
True or False: The 'Insertion Sort' algorithm makes use of the principles of 'Divide and Conquer'.
CorrectIncorrect -
Question 3 of 10
3. Question
Consider the data set [5, 6, 2, 4]. What will the order of the data set be the moment the insertion sort algorithm reaches the 4th item?
CorrectIncorrect -
Question 4 of 10
4. Question
True or False: An Insertion Sort is considered inefficient when compared to most other sorting algorithms.
CorrectIncorrect -
Question 5 of 10
5. Question
The following array is partially sorted. The double bars represent the sort marker. How many comparisons and swaps are needed to sort the next number. [1 3 4 8 9 || 5 2]
CorrectIncorrect -
Question 6 of 10
6. Question
What operation does the Insertion Sort use to move numbers from the unsorted section to the sorted section of the list?
CorrectIncorrect -
Question 7 of 10
7. Question
Consider the following lists of partially sorted numbers. The double bars represent the sort marker.
How many comparisons and swaps are needed to sort the next number. [1 3 4 5 8 9 || 2]CorrectIncorrect -
Question 8 of 10
8. Question
Consider an array of elements "array = [5,4,3,2,1]" , what are the steps of insertions done while doing an insertion sort on the array?
CorrectIncorrect -
Question 9 of 10
9. Question
What is the name of this sorting algorithm?
CorrectIncorrect -
Question 10 of 10
10. Question
What is the name of this sorting algorithm?
CorrectIncorrect
