Suppose a circular queue of capacity n 1 elements is implemented with an array of n elements gate cse 2012

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
gate-cse-2012-->View question


Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. -gate-cse-2012

A.Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT
B.Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR
C.Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT
D.Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT



By:prajwalamv

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

(A) Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT

milan-ransingh

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!