Virtual Labs

Tools

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Aim

Theory

Pretest

Procedure

Simulation

Posttest

References

Contributors

Feedback

Time complexities of Algorithms

Choose difficulty:

Beginner

Intermediate

Advanced

What does Big-O notation represent in algorithm analysis?

a: The exact running time in seconds Explanation

Explanation

b: The upper bound (worst-case) growth rate of an algorithm Explanation

Explanation

c: The memory usage of an algorithm Explanation

Explanation

d: The number of lines of code Explanation

Explanation

What is the time complexity of Binary Search?

a: O(n) Explanation

Explanation

b: O(n²) Explanation

Explanation

c: O(log n) Explanation

Explanation

d: O(1) Explanation

Explanation

Which sorting algorithm has O(n²) time complexity in the average case?

a: Bubble Sort Explanation

Explanation

b: Merge Sort Explanation

Explanation

c: Quick Sort Explanation

Explanation

d: Heap Sort Explanation

Explanation

What is the time complexity of multiplying two n×n matrices using the standard algorithm?

a: O(n) Explanation

Explanation

b: O(n²) Explanation

Explanation

c: O(2ⁿ) Explanation

Explanation

d: O(n³) Explanation

Explanation

How many subsets can be generated from a set of n elements?

a: n Explanation

Explanation

b: 2ⁿ Explanation

Explanation

c: n² Explanation

Explanation

d: n! Explanation

Explanation

Which of the following has the fastest growth rate?

a: O(2ⁿ) Explanation

Explanation

b: O(n²) Explanation

Explanation

c: O(n log n) Explanation

Explanation

d: O(n³) Explanation

Explanation

What is a prerequisite for Binary Search to work correctly?

a: The array must be unsorted Explanation

Explanation

b: The array must be sorted Explanation

Explanation

c: The array must have unique elements Explanation

Explanation

d: The array must have even number of elements Explanation

Explanation

What is the time complexity of generating all permutations of n elements?

a: O(n) Explanation

Explanation

b: O(n²) Explanation

Explanation

c: O(2ⁿ) Explanation

Explanation

d: O(n!) Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)