Sorting techniques in C
Quiz Summary
0 of 20 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 20 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
- Not categorized 0%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- Current
- Review
- Answered
- Correct
- Incorrect
- Question 1 of 20
1. Question
1. Which of the following is not a stable sorting algorithm?
CorrectIncorrect - Question 2 of 20
2. Question
2. Which of the following is a stable sorting algorithm?
CorrectIncorrect - Question 3 of 20
3. Question
3. Which of the following is not an in-place sorting algorithm?
CorrectIncorrect - Question 4 of 20
4. Question
4. If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?
CorrectIncorrect - Question 5 of 20
5. Question
5. Which of the following algorithm pays the least attention to the ordering of the elements in the input list?
CorrectIncorrect - Question 6 of 20
6. Question
6. Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general?
CorrectIncorrect - Question 7 of 20
7. Question
7. Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input?
CorrectIncorrect - Question 8 of 20
8. Question
8. Which of the following algorithm design technique is used in the quick sort algorithm?
CorrectIncorrect - Question 9 of 20
9. Question
9. Merge sort uses
CorrectIncorrect - Question 10 of 20
10. Question
10. Match the following :
Sort elements
- divide and conquer algorithm
- simplest sorting algorithm
- efficient version of selection sort
- 1) Quick sort
- 2)Bubble sort
- 3) Heap sort
CorrectIncorrect - Question 11 of 20
11. Question
11. What is the advantage of bubble sort over other sorting techniques?
CorrectIncorrect - Question 12 of 20
12. Question
12. Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this:
2 5 1 7 9 12 11 10
Which statement is correct?CorrectIncorrect - Question 13 of 20
13. Question
13. Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general?
CorrectIncorrect - Question 14 of 20
14. Question
14. In the following scenarios, when will you use selection sort?
CorrectIncorrect - Question 15 of 20
15. Question
15. What is the advantage of selection sort over other sorting techniques
CorrectIncorrect - Question 16 of 20
16. Question
16. What is the disadvantage of selection sort?
CorrectIncorrect - Question 17 of 20
17. Question
17. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
CorrectIncorrect - Question 18 of 20
18. Question
18. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are
CorrectIncorrect - Question 19 of 20
19. Question
19. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
CorrectIncorrect - Question 20 of 20
20. Question
20. What is a randomized Quick Sort?
CorrectIncorrect