Time Complexity Quiz

What is the time complexity to access an element at a given index in an array?

• O(1)

• O(n)

• O(log n)

• O(n log n)

What is the worst-case time complexity for inserting an element at the beginning of a dynamic array (vector) of size n?

• O(1)

• O(log n)

• O(n)

• O(n²)

What is the time complexity for inserting a node at the head of a singly linked list?

• O(1)

• O(n)

• O(log n)

• O(n log n)

What is the worst-case time complexity for searching an element in a singly linked list?

• O(1)

• O(n)

• O(log n)

• O(n log n)

What is the time complexity for push and pop operations in a stack (whether implemented using an array or linked list)?

• O(1)

• O(n)

• O(log n)

• O(n log n)

In a queue implemented with a linked list, what is the time complexity for both enqueue and dequeue operations?

• O(1)

• O(n)

• O(log n)

• O(n log n)

In a hash table using chaining, what is the average-case time complexity for search operations?

• O(1)

• O(n)

• O(log n)

• O(n log n)

In a hash table using chaining, what is the worst-case time complexity for search when all keys hash to the same bucket?

• O(1)

• O(n)

• O(log n)

• O(n²)

What is the worst-case time complexity for searching in an unbalanced Binary Search Tree (BST)?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the time complexity for insertion in a balanced BST (like an AVL or Red–Black tree)?

• O(1)

• O(log n)

• O(n)

• O(n log n)