Complexity Analysis (Big O) - Exam Prep Insights

Complexity Analysis (Big O) - Applications - Real World Applications

Q. In a linked list, what is the time complexity of inserting an element at the beginning?

Solution

Inserting at the beginning of a linked list is a constant time operation, hence O(1).

Correct Answer: C — O(1)

Q. What is the time complexity of accessing an element in a stack?

Solution

Accessing the top element of a stack is a constant time operation, hence O(1).

Correct Answer: C — O(1)

Q. What is the time complexity of bubble sort in the average case?

Solution

Bubble sort has an average case time complexity of O(n^2) due to the nested loops.

Correct Answer: C — O(n^2)

Q. What is the time complexity of linear search in an unsorted array?

Solution

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

Correct Answer: B — O(n)

Showing 1 to 4 of 4 (1 Pages)