Which approach is optimal to find the smallest missing positive number in an unsorted array?

• Sorting

• HashMap

• In-place Indexing

• Binary Search

• Greedy

What is the time complexity of rotating an array of n elements by k positions (using reversal algorithm)?

• O(nk)

• O(log n)

• O(n)

• O(k)

• O(n log n)

What’s the optimal way to design a circular queue using array?

• Push from front

• Push using two arrays

• Use front and rear pointers with modulo

• Doubly Linked List

• Prefix tree

Time complexity to reverse a doubly linked list?

• O(log n)

• O(n)

• O(1)

• O(n²)

• O(n log n)

Which of the following cannot be implemented using a linked list?

• Stack

• Queue

• Hash Table

• Random Access Array

• Deque

In a Binary Tree, the diameter is the:

• Max number of leaves

• Depth of root

• Longest path between any two nodes

• Height + width

• Sum of left subtree

Which of the following trees is ideal for implementing priority queues?

• Binary Search Tree

• AVL Tree

• Heap

• Red-Black Tree

• Segment Tree

Which algorithm finds all pairs shortest paths in a graph?

• Dijkstra

• Prim

• Floyd-Warshall

• DFS

• Kruskal

Which sorting is NOT stable?

• Merge Sort

• Insertion Sort

• Bubble Sort

• Heap Sort

• Tim Sort

Which sorting algorithm is best suited for large data that doesn’t fit into memory (external sort)?

• QuickSort

• HeapSort

• MergeSort

• Insertion Sort

• Bubble Sort