This section contains more frequently asked Data Structure Basics Multiple Choice Questions Answers in the various University level and competitive examinations.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. The advantage of selecting maxmin algorithm using divide and conquer method compared to staightmaxmin algorithm is _____
- Less time complexity
- High accuracy
- Less space complexity
- High time complexity
A. Less time complexity
2. The number of comparisons of elements for best case is ____________ in the case of maxmin algorithm based on divide and conquer method
- 3n/2
- n/4
- n/2
- n-1
A. 3n/2
3. The number of comparisons of elements for average case is ____________ in the case of maxmin algorithm based on divide and conquer method
- 3n/2
- n/4
- n/2
- n-1
A. 3n/2
4. The number of comparisons of elements for worst case is ____________ in the case of maxmin algorithm based on divide and conquer method
- 3n/2
- n/4
- n/2
- n-1
A. 3n/2
5. The method which stops the execution ,if it find the solution. Otherwise it start from the top
- Branch and bound
- Dynamic programming
- Back tracking
- Divide and conquer
C. Back tracking
6. Which is not return optimal solution from the following methods
- Dynamic programming
- Backtracking
- Branch and bound
- Greedy method
B. Backtracking
7. In the case ofsub problems share sub problems ,which method is suitable
- greedy method
- branch and bound
- dynamic programming
- divide and conquer
C. dynamic programming
8. The method which return different solutions from a single point ,which is _________
- greedy method
- branch and bound
- dynamic programming
- divide and conquer
A. greedy method
9. Binpackingproblem is the application of ____________
- Knapsack
- Branch and bound
- Back tracking
- Dynamic programming
A. Knapsack
