MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
If for an algorithm time complexity is given by O((3 2)n) then complexity will be ___________ |
| A. | constant |
| B. | quardratic |
| C. | exponential |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 2. |
If for an algorithm time complexity is given by O(n2) then complexity will ___________ |
| A. | constant |
| B. | quadratic |
| C. | exponential |
| D. | none of the mentioned |
| Answer» C. exponential | |
| 3. |
If for an algorithm time complexity is given by O(log2n) then complexity will be ___________ |
| A. | constant |
| B. | polynomial |
| C. | exponential |
| D. | none of the mentioned |
| Answer» E. | |