Sorting
Quiz-summary
0 of 27 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
Information
- You will be given 180 seconds ( 3 minutes) for every question.
- Every question may contain multiple answers.Once you click the submit button you can not change your answer. You cannot go back to the same question once you click the submit button.
- Every question carries the marks equal to its difficulty level ( from 1 to 5).
- There is a negative marking of -1 for every wrong answer.
- Once a set of questions is complete, you can wait for another set of questions or you can try some other category.
- Your total marks will be displayed after every question.
- For any doubts/comments/suggestions on the question you can go to same question in untimed section.
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 have to finish following quiz, to start this quiz:
Results
0 of 27 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
- Sorting 0%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- Answered
- Review
-
Question 1 of 27
1. Question
5 pointsWhich statements are true for In Place Sorting
Correct
Incorrect
-
Question 2 of 27
2. Question
5 pointsThe complexity of comparison based sorting algorithm is
Correct
Incorrect
-
Question 3 of 27
3. Question
5 pointsWhich of the following statements are true for Counting Sort.
Correct
Incorrect
-
Question 4 of 27
4. Question
5 pointsWhich of the following statements are true for Radix Sort.
Correct
Incorrect
-
Question 5 of 27
5. Question
5 pointsWhich one of the following can be used for internal sorting of individual columns in radix sort
Correct
Incorrect
-
Question 6 of 27
6. Question
5 pointsBucket sort is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.
Correct
Incorrect
-
Question 7 of 27
7. Question
5 pointsAverage case and Worst case complexity of quick sort is
Correct
Incorrect
-
Question 8 of 27
8. Question
5 pointsQuick sort is considered a good sorting algorithm. Which are the factors to make it a good algorithm?
Correct
Incorrect
-
Question 9 of 27
9. Question
5 pointsWhich of the following statements are true about Quick Sort
Correct
Incorrect
-
Question 10 of 27
10. Question
5 pointsWhich of the following is true for min heap
Correct
Incorrect
-
Question 11 of 27
11. Question
5 pointsWhich of the following is true for heap sort
Correct
Incorrect
-
Question 12 of 27
12. Question
5 pointsMatch the following complexities with their algorithms
i) O(log n) a) Heap sort ii) O(n) b) Depth-first-search iii) O(nlog n) c) Binary search iv) O(n2) d) Selection of kth smallest element in a set of n elements Correct
Incorrect
-
Question 13 of 27
13. Question
5 pointsfor i = 1 to n-1 do
min = i
for j = i+1 to n do
If (a[j] < a[min])
then min = j
If (i < min) then swap(a[i],a[min])
The Given code is forCorrect
Incorrect
-
Question 14 of 27
14. Question
5 pointsWhich is the category of bubble sort algorithm.
Correct
Incorrect
-
Question 15 of 27
15. Question
5 pointsfor i = 1 to n-1 do
for j = 1 to n-i do
if (a[j+1] < a[j]) then swap a[j] and a[j+1]
The given code is forCorrect
Incorrect
-
Question 16 of 27
16. Question
5 pointsIf Priority queue concept is implemented using an ordered array then it is
Correct
Incorrect
-
Question 17 of 27
17. Question
5 pointsWhy Sorting is required
Correct
Incorrect
-
Question 18 of 27
18. Question
5 pointsHow much time it will take to find the largest item in a min-heap
Correct
Incorrect
-
Question 19 of 27
19. Question
5 pointsRadix sort works correctly even if insertion sort is used as its auxiliary sort instead of counting sort.
Correct
Incorrect
-
Question 20 of 27
20. Question
5 pointsIf the time complexity of a sorting algorithm is dependent upon the fact that how many numbers in the list are their relative sorted order then that type of sorting will be referred to as the Adaptive sorting.
Correct
Incorrect
-
Question 21 of 27
21. Question
5 pointsWhich statement is true about stable sorting
Correct
Incorrect
-
Question 22 of 27
22. Question
5 pointsWhich if the following statements are true about bubble sort
Correct
Incorrect
-
Question 23 of 27
23. Question
5 pointsWhich if the following statements are true about bubble sort
Correct
Incorrect
-
Question 24 of 27
24. Question
5 pointsWhich if the following statements are true about selection sort
Correct
Incorrect
-
Question 25 of 27
25. Question
5 pointsWhich if the following statements are true about insertion sort
Correct
Incorrect
-
Question 26 of 27
26. Question
5 pointsWhich of the following statements are true about shell sort
Correct
Incorrect
-
Question 27 of 27
27. Question
5 pointsWhich of the following statements are true about shell sort
Correct
Incorrect