In an array implementation of a Queue, what problem occurs when elements are repeatedly dequeued and enqueued without circular wrapping?
In a linear array queue, when rear reaches N-1, new enqueues fail even if front has moved forward, causing false overflow.
What is the worst-case time complexity of finding the maximum element in a standard Stack of size n?
Finding the maximum element in an unaugmented stack requires popping elements to inspect every item, taking O(n) time.
What is the time complexity of Enqueue and Dequeue operations in a Priority Queue implemented using a Binary Max-Heap?
Inserting an item (heapify-up) and extracting the maximum item (heapify-down) both take O(log n) time in a binary heap.
Which type of recursion can be converted directly into an iterative loop with equivalent asymptotic time and reduced stack usage when tail-call optimization is applied?
In tail recursion, the recursive call is the final operation. Such a function can be transformed into an iterative loop, and tail-call optimization can eliminate the additional call-stack frames.
Which of the following is the result of the prefix expression * + 2 3 4?
Evaluate + 2 3 first: 2+3=5. Then 5$\times 4=20$. Since 20 is not listed in A, B, or C, none of the above is correct.