Question:
A normal linear queue, if implemented using an array/list of size LIMIT, gets full when :
A normal linear queue, if implemented using an array/list of size LIMIT, gets full when :
Updated On: Apr 19, 2024
- front =rear + 1
- rear = front
- front (rear + 1)% LIMIT
- rear = LIMIT-1
Hide Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
The correct option is(D):rear = LIMIT-1
Was this answer helpful?
0
0
Top Questions on Array
Which one of the following options is correct for the given data in the table?
- An array \( A \) of length \( n \) with distinct elements is said to be bitonic if there is an index \( 1 \leq i \leq n \) such that \( A[1..i] \) is sorted in the non-decreasing order and \( A[i+1 .. n] \) is sorted in the non-increasing order. Which ONE of the following represents the best possible asymptotic bound for the worst-case number of comparisons by an algorithm that searches for an element in a bitonic array \( A \)?
Questions Asked in CUET exam
- Double fertilization is a characteristic feature of which group of plants?
- If $ A $ is a $ 2 \times 2 $ matrix and $ |A| = 4 $, then $ |A^{-1}| $ is:
- CUET (UG) - 2025
- Determinants
- In a certain code, WATER is written as YCVGT. How is HOUSE written?
- CUET (UG) - 2025
- Coding Decoding
- The professor's explanation was so esoteric that even graduate students struggled to understand it. What is the meaning of "esoteric" in this context?
- CUET (UG) - 2025
- Vocabulary
- A person walks 10 m North, then turns right and walks 5 m, then turns right again and walks 10 m. What direction is he facing now?
- CUET (UG) - 2025
- Direction sense
View More Questions