1.
1 point
2.
1 point
3.
1 point
4.
1 point
5. Which of the following is not a stable sorting algorithm.
1 point
6. A sorting technique is called stable if It takes O(n) space.
1 point
7. How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4} ?
1 point
8. if the array is [3,5,8,4,1,9,-2]. what is the output of partially sorted list after three complete passes of bubble sort?
2 points
9. if the array is [15 5 4 18 12 19 14 10 8 20].what is the output of partially sorted list after three complete passes of selection sort?
1 point
10.if the array is [ 82 901 100 12 150 77 55 23]. what is the output of partially sorted list after two complete passes of radix sort?
1 point
11. The minimum number of comparisons required to find the minimum and the maximum of 50 numbers is
2 points
12.We have a list [("Ram",71),("Shayam",85),("ganesh",71),("Sita",85),("Rani",72), ("Radha",60)], where each pair consists of a student's name and his/her marks in a course. We sort these pairs in ascending order of marks. Which of the following corresponds to a stable sort of this input?
2 points
0 Comments