Tech-it-out 3.0

What is the time complexity of searching an element in a hash table (on average)?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which data structure is best suited for implementing an undo operation?

• Queue

• Stack

• Priority Queue

• Hash Map

If a queue is implemented using an array, how can we make it circular to use all positions?

• By shifting all elements on each dequeue

• By using a circular linked list

• By using modulo arithmetic for front and rear

• By keeping one extra space always empty

Which of the following sorting algorithms is in-place and unstable?

• Merge Sort

• Insertion Sort

• Quick Sort

• Bubble Sort

The number of edges in a complete undirected graph with n vertices is

• n²

• n(n + 1)/2

• n(n − 1)/2

• n − 1

What is the auxiliary space complexity of recursive binary search?

• O(1)

• O(n)

• O(log n)

• O(n log n)

Which traversal method uses a queue in a binary tree?

• Inorder

• Preorder

• Postorder

• Level Order

Which algorithm can be used to detect a cycle in a linked list efficiently?

• Dijkstra’s Algorithm

• Floyd’s Tortoise and Hare Algorithm

• Kruskal’s Algorithm

• Bellman-Ford Algorithm

Which of the following algorithms is NOT a Divide and Conquer algorithm?

• Merge Sort

• Quick Sort

• Binary Search

• Dijkstra’s Algorithm

What is the maximum number of nodes in a binary tree of height 4?

• 7

• 8

• 15

• 16