Asymptotic Analysis MCQ Questions & Answers

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.

A. Symptotic analysis
B. Asymptotic analysis
C. Posterior Analysis
D. Priori Analysis

View Answer


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

A. best case
B. average case
C. worst case
D. best case, average case, and worst case

View Answer


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

A. best case
B. average case
C. worst case
D. None of the above

View Answer


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

A. Omega Notation
B. Theta Notation
C. Big Oh Notation
D. All of the above

View Answer


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

A. Yes
B. No
C. Can be yes or no
D. Can not say

View Answer


6. Which of the following is linear asymptotic notations?

A. Ο(1)
B. Ο(log n)
C. Ο(n)
D. Ο(n log n)

View Answer


7. Ο(log n) is?

A. constant asymptotic notations
B. logarithmic asymptotic notations
C. polynomial asymptotic notations
D. quadratic asymptotic notations

View Answer


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

A. TRUE
B. FALSE
C. Can be true or false
D. Can not say

View Answer


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

A. upper bound
B. lower bound
C. lower bound and upper bound
D. None of the above

View Answer


10. Asymptotic analysis is _______ bound.

A. output
B. input
C. outer
D. inner

View Answer





Discussion


* You must be logged in to add comment.