A normal queue, if implemented using an array of size MAX_SIZE, gets f – McqOptions

MCQOPTIONS

1.	A normal queue, if implemented using an array of size MAX_SIZE, gets full when?
A.	Rear = MAX_SIZE 1
B.	Front = (rear + 1)mod MAX_SIZE
C.	Front = rear + 1
D.	Rear = front
Answer» B. Front = (rear + 1)mod MAX_SIZE

Discussion

No Comment Found

Related MCQs

Queues serve major role in ______________
A normal queue, if implemented using an array of size MAX_SIZE, gets full when?
A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?
If the elements A , B , C and D are placed in a queue and are deleted one at a time, in what order will they be removed?
Circular Queue is also known as ________
A queue follows __________
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _____________