Complexity Analysis (Big O) for Competitive Exam Success

Complexity Analysis (Big O) - Applications - Case Studies

Q. What is the time complexity of a bubble sort algorithm in the worst case?

Solution

Bubble sort compares adjacent elements and requires O(n^2) time in the worst case.

Correct Answer: C — O(n^2)

Q. What is the time complexity of a depth-first search (DFS) in a graph?

Solution

DFS visits each vertex and edge once, leading to a time complexity of O(V + E), where V is vertices and E is edges.

Correct Answer: C — O(V + E)

Q. What is the time complexity of a linear search algorithm?

Solution

Linear search checks each element one by one, resulting in a time complexity of O(n).

Correct Answer: B — O(n)

Q. What is the time complexity of finding the maximum element in a binary search tree (BST)?

Solution

In a balanced BST, finding the maximum element involves traversing down the rightmost path, which takes O(log n) time.

Correct Answer: B — O(log n)

Showing 1 to 4 of 4 (1 Pages)