This section contains more frequently asked Data Structure and Algorithms Fundamentals Multiple Choice Questions Answers in the various University level and competitive examinations.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. Average case time complexity of binary search is ______________
- O(n)
- Ɵ(nlogn)
- O(logn)
- Ɵ(logn)
D. Ɵ(logn)
2. Merge sort invented by _____________
- CARHOARE
- HAMILTON
- JOHN VON NEUMANN
- STRASSEN
C. JOHN VON NEUMANN
3. Quick sort invented by _____________
- CARHOARE
- HAMILTON
- JOHN VON NEUMANN
- STRASSEN
A. CARHOARE
4. Worst case time complexity of Quick sort is ______________
- O(n^2log7)
- O(nlogn)
- O(n^2)
- O(logn)
C. O(n^2)
5. Best case time complexity of Quick sort is ______________
- O(n^2logn)
- O(nlogn)
- O(logn)
- O(logn2)
B. O(nlogn)
6. Average case time complexity of Quick sort is ______________
- Ɵ (nlogn)
- O(logn)
- O(nlogn)
- Ɵ(logn)
C. O(nlogn)
7. Which design strategy stops theexecution when it find the solution otherwise starts the problem from top
- Back tracking
- Divide and conquer
- Branch and Bound
- Dynamic programming
A. Back tracking
8. Graphical representation of algorithm is _____________________
- Pseudo-code
- Graph Coloring
- Flow Chart
- Dynamic programming
C. Flow Chart
9. In pseudo-code conventions input express as __________
- input
- Read
- Write
- Return
C. Write
10. In pseudo-code conventions output express as __________
- input
- Read
- Write
- Return
B. Read
