ADSA Moderate-Level Quiz

Which data structure is ideal for reversing a string character-by-character?

• Queue

• Stack

• Linked List

• Hash Table

What is the time complexity of 'find' in Quick Find algorithm?

• O(log N)

• O(1)

• O(N)

• O(N log N)

Which technique is used in Fisher-Yates Shuffle?

• Recursion

• Swap from left to right

• Random swapping from end

• Sorting

What is the key difference between interval search and rectangle intersection?

• Data structure used

• Time complexity

• Dimensionality

• Use of loops

Which of the following maintains balance using node splitting and merging?

• AVL Tree

• Binary Search Tree

• Red-Black Tree

• 2-3 Tree

Which method offers best performance for both find and union with optimizations?

• Quick Find

• Quick Union

• Union by Rank with Path Compression

• Simple array mapping

In which tree traversal do you visit Root → Left → Right?

• Inorder

• Preorder

• Postorder

• Level Order

Which of these operations is not used in heapify-down process?

• Compare node with children

• Swap with larger child

• Swap with parent

• Repeat recursively

What is the advantage of B-Tree over Red-Black Tree?

• Lower height

• Simpler to implement

• Better for memory

• Not balanced

Which algorithm uses the divide and conquer technique?

• Dijkstra's

• Merge Sort

• Kruskal's

• BFS