MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Technical MCQs knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Asymptotic analysis is _______ bound. |
| A. | output |
| B. | input |
| C. | outer |
| D. | inner |
| E. | |
| Answer» C. outer | |
| 2. |
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 |
| Answer» D. None of the above | |
| 3. |
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 |
| Answer» B. FALSE | |
| 4. |
Ο(log n) is? |
| A. | constant asymptotic notations |
| B. | logarithmic asymptotic notations |
| C. | polynomial asymptotic notations |
| D. | quadratic asymptotic notations |
| Answer» C. polynomial asymptotic notations | |
| 5. |
Which of the following is linear asymptotic notations? |
| A. | Ο(1) |
| B. | Ο(log n) |
| C. | Ο(n) |
| D. | Ο(n log n) |
| Answer» D. Ο(n log n) | |
| 6. |
Worst Case indicates maximum time required for program execution. |
| A. | Yes |
| B. | No |
| C. | Can be yes or no |
| D. | Can not say |
| Answer» B. No | |
| 7. |
__________ 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 |
| Answer» D. All of the above | |
| 8. |
Which case indicate the minimum time required for program execution? |
| A. | best case |
| B. | average case |
| C. | worst case |
| D. | None of the above |
| Answer» B. average case | |
| 9. |
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 |
| Answer» E. | |
| 10. |
________ of an algorithm refers to defining the mathematical boundation/framing of its run-time performance. |
| A. | Symptotic analysis |
| B. | Asymptotic analysis |
| C. | PosteriorAnalysis |
| D. | PrioriAnalysis |
| Answer» C. PosteriorAnalysis | |