Complexity Analysis (Big O) for Competitive Exams

Complexity Analysis (Big O) - Applications - Competitive Exam Level

Q. What is the time complexity of a breadth-first search (BFS) on a graph?

Solution

BFS visits each vertex and edge once, resulting in a time complexity of O(V + E).

Correct Answer: C — O(V + E)

Q. What is the time complexity of inserting an element into a stack?

Solution

Inserting an element into a stack (push operation) is done in constant time, hence O(1).

Correct Answer: A — O(1)

Q. What is the time complexity of the bubble sort algorithm?

Solution

Bubble sort has a worst-case time complexity of O(n^2) due to the nested loops.

Correct Answer: C — O(n^2)

Q. What is the worst-case time complexity of inserting an element into a linked list?

Solution

Inserting an element in a linked list requires traversing the list in the worst case, leading to O(n).

Correct Answer: B — O(n)

Showing 1 to 4 of 4 (1 Pages)