This section contains more frequently asked Data Structure and Algorithms Fundamentals MCQs in the various University level and competitive examinations.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. From the following pick the one which does not belongs to the same paradigm to which others belongs to.
- Minimum & Maximum problem
- Knapsack problem
- Selection problem
- Merge sort
B. Knapsack problem
2. Primsalgorithm is based on _____________ method
- Divide and conquer method
- Dynamic programming
- Greedy method
- Branch and bound
C. Greedy method
3. The amount of memory needs to run to completion is known as_____________
- Space complexity
- Worst case
- Time complexity
- Best case
A. Space complexity
4. The amount of time needs to run to completion is known as____________
- Space complexity
- Worst case
- Time complexity
- Best case
C. Time complexity
5. __________ is the minimum number of steps that can executed for the given parameters
- Average case
- Worst case
- Time complexity
- Best case
D. Best case
6. __________ is the maximum number of steps that can executed for the given parameters
- Average case
- Worst case
- Time complexity
- Best case
B. Worst case
7. __________ is the average number of steps that can executed for the given parameters
- Average case
- Worst case
- Time complexity
- Best case
A. Average case
8. Testing of a program consists of 2 phases which are ______________________ and ____________
- Average case & Worst case
- Time complexity & Space complexity
- Validation and checking errors
- Debugging and profiling
D. Debugging and profiling
9. Worst case time complexity of binary search is ______________
- O(n)
- O(logn)
- Ɵ(nlogn)
- Ɵ(logn)
D. Ɵ(logn)
10. Best case time complexity of binary search is ______________
- O(n)
- Ɵ(nlogn)
- O(logn)
- Ɵ(logn)
D. Ɵ(logn)
