See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

## 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 == FRONTmilan-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|

------------------------------------

## Use Me ?