ppt on circular queue in data structures useful for GTU students

1. DATA STRUCTURE:
CIRCULAR QUEUE
Dhananjaysinh Jhala
SY CE1,170410107027
Batch B

2. CONTENTS
• What is circular queue ?
• Why to use circular queue ?
• C program of circular queue using array
• Example

3. What is circular queue ?
• Circular queue is a type of queue where the first index comes right after the
last index.
• Conceptually, you can think of a circular queue
as shown in Fig

4. Why to use circular queue ?
• In CQ we utilize memory efficiently. because in queue when we delete any
element only front increment by 1, but that position is not used later. so
when we perform more add and delete operation, memory wastage increase.
• But in CQ memory is utilized, if we delete any element that position is used
later, because it is circular.

5. C program of circular queue using array

9. Example