Sorting and Searching
Quizsummary
0 of 10 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
Information
Questions on Searching and Sorting.
You must specify a text. 

You must specify an email address. 
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 10 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
 Not categorized 0%
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 Answered
 Review

Question 1 of 10
1. Question
1 pointsWhich of the following sorting algorithm is of divideandconquer type?
Correct
Incorrect

Question 2 of 10
2. Question
1 pointsWhich of the following algorithm design technique is used in the quick sort algorithm?
Correct
Incorrect

Question 3 of 10
3. Question
1 pointsThe number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
Correct
Incorrect

Question 4 of 10
4. Question
1 pointsGiven two sorted lists of size m and n respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be?
Correct
Incorrect

Question 5 of 10
5. Question
1 pointsWhich paradigm does merge sort use ?
Correct
Incorrect

Question 6 of 10
6. Question
1 pointsWhich of the following is not the required condition for binary search algorithm?
Correct
Incorrect

Question 7 of 10
7. Question
1 pointsWhich of the following is not a limitation of binary search algorithm?
Correct
Incorrect

Question 8 of 10
8. Question
1 pointsMatch the following.
a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one Correct
Incorrect

Question 9 of 10
9. Question
1 pointsThe number of comparisons done by sequential search is
Correct
Incorrect

Question 10 of 10
10. Question
1 pointsWhich search starts at the beginning of the list and checks every element in the list?
Correct
Incorrect