Scribd
Upload
537 views2 pages

Design & Analysis of Algorithms Quiz

The document contains a 10 question quiz on algorithms and data structures topics like sorting techniques, analysis of algorithms, recursion, and different types of sorting algorithms. The quiz questions cover the characteristics, advantages, disadvantages, time complexities and applications of selection sort, quicksort, heap sort, shell sort, and recursion. Sample questions ask about the advantage of selection sort, average case complexity of selection sort, disadvantage of selection sort, base case in recursion, categorization of quicksort, worst case of quicksort, randomized quicksort, tree sort, sorting for large number of names, and efficient sorting for large records with short keys.

Uploaded by

Dr. Smita Agarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
537 views2 pages

Design & Analysis of Algorithms Quiz

The document contains a 10 question quiz on algorithms and data structures topics like sorting techniques, analysis of algorithms, recursion, and different types of sorting algorithms. The quiz questions cover the characteristics, advantages, disadvantages, time complexities and applications of selection sort, quicksort, heap sort, shell sort, and recursion. Sample questions ask about the advantage of selection sort, average case complexity of selection sort, disadvantage of selection sort, base case in recursion, categorization of quicksort, worst case of quicksort, randomized quicksort, tree sort, sorting for large number of names, and efficient sorting for large records with short keys.

Uploaded by

Dr. Smita Agarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Design & Analysis of Algorithms

Quiz
[Link] is the advantage of selection sort over any other sorting techniques.
[Link] requires no additional storage.
[Link] is scalable.
c. It works best for input which are already sorted.
d. It is faster than any other sorting technicque.

Q2. What is the average case complexity of selection sort.


a. O(nlogn) b. O(logn) c.O(n) d.O(n2)

Q3. What is the disadvantage of selection sort?


[Link] requires additional memory.
b. It is not scalable.
[Link] can be used for small keys.
[Link] of the mentioned.

[Link] recursion the condition for which the function will stop calling itself is
a. Best case b. worse case c. base case d. there is no such condition.

[Link] sort can be categorized in to which of the following


a. Brute Force.
b. Divide and Conguer.
c. Greedy algorithm
d. Dynamic algorithm.
Q6Worst case complexity of Quick-Sort
a. O(nlogn) b.(logn) c. O(n) d. O(n2)
Q7. What is randomized QuickSort?
[Link] left most element is chosen as pivot.
b. The rightmost elemnt is chosn as pivot.
c. Any element of the array is chosen as the pivot.
d. A random number is generated which is used as the pivot.
Q8.A tree sort is also known as
a. Quicksort. b. Shell sort c. Heap Sort. [Link] sort
Q9. ____ sorting is used when alphabetized large no of names.
a. Quicksort. b. Shell sort c. Heap Sort. [Link] sort
Q10. if the number of records to be sorted large and the key is short then ___ sorting is efficient.
a. Quicksort. b. Shell sort c. Heap Sort. [Link] sort

Marks Obtained: MM:10

Signature of Internal Examiner Signature of External Examiner

Quiz Answers
1. A
2. D
3. B
4. C
5. B
6. D
7. C
8. C
9. E
10. E

You might also like