Data Structures using Queue,linear,circular-2 Q.pptx

1. Queue Using Arrays

3. Queue

4. Operations on Queue

5. Implementation

6. Implementation Using Arrays

7. Enqueue(10) MAX = 5 Q = [0] * MAX front = -1 rear = -1 Front=Rear=-1

8. Enqueue(10)

9. Enqueue(10) if front==-1 and rear==-1 front += 1 rear += 1 Q[rear] = 10

10. Enqueue(10) if front==-1 and rear==-1 front += 1 rear += 1 Q[rear] = 10

11. Enqueue(20) if rear < MAX:

12. Enqueue(20) if rear < MAX: rear += 1 Q[rear] = 20

13. Enqueue(30) if front < rear: rear += 1 Q[rear] = 30

14. Dequeue() if front < rear: front += 1

15. Dequeue() if front < rear: front += 1

16. Dequeue() if front == rear:

17. Dequeue() front = rear = -1

18. Dequeue()

19. Dequeue()

20. Algorithm for Enqueue()

21. Enqueue(60)

22. Algorithm for Dequeue()

More Related Content