This section focuses on "Asymptotic Analysis" of Data Structures. These Multiple Choice Questions (MCQ) should be practiced to improve the Data Structure skills required for various interviews (campus interviews, walk-in interviews, company interviews), placements, entrance exams and other competitive examinations.

1. ________ of an algorithm refers to defining the mathematical boundation/framing of its run-time performance.

2. Using asymptotic analysis, we can very well conclude the __________ scenario of an algorithm.

3. Which case indicate the minimum time required for program execution?

4. __________ is the formal way to express the upper bound of an algorithm's running time.

5. Worst Case indicates maximum time required for program execution.

6. Which of the following is linear asymptotic notations?

7. Ο(log n) is?

8. Omega Notation is the formal way to express the lower bound of an algorithm's running time.

9. The Theta notation is the formal way to express ____________ of an algorithm's running time.

10. Asymptotic analysis is _______ bound.


 

Related Posts