This section contains more frequently asked Data Structure MCQs in the various competitive exams.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. Performance based criteria of algorithm , which has to do with its computing time is _______________
- Time Complexity
- Input
- Space Complexity
- Finiteness
A. Time Complexity
2. Performance based criteria of algorithm , which has to do with its storage requirements is _______________
- Time Complexity
- Input
- Space Complexity
- Finiteness
C. Space Complexity
3. O(1) means computing time is __________________
- Constant
- Quadratic
- Linear
- Cubic
A. Constant
4. O(n) means computing time is __________________
- Constant
- Quadratic
- Linear
- Cubic
C. Linear
5. O(n^2) means computing time is __________________
- Constant
- Quadratic
- Linear
- Cubic
B. Quadratic
6. O(n^3) means computing time is __________________
- Exponential
- Quadratic
- Linear
- Cubic
D. Cubic
7. O(2^n) means computing time is __________________
- Constant
- Quadratic
- Linear
- Exponential
D. Exponential
8. Application of quicksort _________
- Graphic card
- Data Processing
- Tape sorting
- Card Sorting
A. Graphic card
9. Application of mergesort _________
- Graphic card
- Networking
- Card Sorting
- Data Processing
D. Data Processing
10. The method will choosing when sub problems share sub problems
- Divideand conquer
- Greedy method
- Dynamic programming
- Back tracking
C. Dynamic programming
