Request New Subject
Home
Data Structures (DS)
Linear Data Structures -Stacks and Queues
Q. In a circular queue, how do you increment the rear end of the queue? (Solved)
1. rear++
2. (rear+1) % CAPACITY
3. (rear % CAPACITY)+1
4. rear–
b. (rear+1) % CAPACITY
Related Topics
→ Non Linear Data Structures - Graphs
→ Non Linear Data Structures - Trees
→ Searching, Sorting and Hashing Techniques
Subscribe Now
Get All Updates & News
Subscribe