Coders Club 10/3/25 Adv Batch

In a circular queue implementation, how do you determine if the queue is full?

• Front == Rear

• Rear + 1 == Front (mod n)

• Front == Rear + 1

• Rear == n - 1

Which data structure is used for implementing undo operations in text editors?

• Queue

• Hash Map

• Heap

• Stack

What is the worst-case space complexity of Quick Sort?

• O(log n)

• O(n²)

• O(1)

• O(n)

What is the best data structure for efficiently checking if a string is a palindrome?

• Array

• Stack

• Linked List

• Queue

Which of the following is NOT a greedy algorithm?

• Kruskal’s Algorithm

• Bellman-Ford Algorithm

• Dijkstra’s Algorithm

• Huffman Encoding

Which of these data structures is NOT used to implement a queue?

• Stack

• Linked List

• Hash Map

• Array

Which data structure allows O(1) time complexity for checking if an element exists?

• Array

• Stack

• Hash Map

• Linked List

Which data structure can implement a queue in the most memory-efficient way?

• Array

• Stack

• Circular Queue

• Deque

If a sorting algorithm has O(N log N) best case and O(N²) worst case, which one is it?

• Merge Sort

• Quick Sort

• Selection Sort

• Insertion Sort

Which searching algorithm is best suited for a phone book where names are stored alphabetically?

• Hashing

• Linear Search

• Binary Search

• Jump Search