Chapter 4 Queues Objectives Upon completion you will
Chapter 4 Queues Objectives Upon completion you will be able to: • • • Explain the design, use, and operation of a queue Implement a queue using a linked list structure Understand the operation of the queue ADT Write application programs using the queue ADT Explain categorizing data and queue simulation Data Structures: A Pseudocode Approach with C 1
Data Structures: A Pseudocode Approach with C 2
4 -1 Queue Operations This section discusses the four basic queue operations. Using diagrammatic figures, it shows how each of them work. It concludes with a comprehensive example that demonstrates each operation. • Enqueue • Dequeue • Queue Front • Queue Rear • Queue Example Data Structures: A Pseudocode Approach with C 3
Data Structures: A Pseudocode Approach with C 4
Data Structures: A Pseudocode Approach with C 5
Data Structures: A Pseudocode Approach with C 6
Data Structures: A Pseudocode Approach with C 7
Data Structures: A Pseudocode Approach with C 8
(Continued) Data Structures: A Pseudocode Approach with C 9
4 -2 Queue Linked List Design We first discuss the data structure for a linked-list implementation. We then develop the eight algorithms required to implement a queue. • Data Structure Queue • Algorithms Data Structures: A Pseudocode Approach with C 10
Data Structures: A Pseudocode Approach with C 11
Data Structures: A Pseudocode Approach with C 12
Data Structures: A Pseudocode Approach with C 13
(Continued) Data Structures: A Pseudocode Approach with C 14
Data Structures: A Pseudocode Approach with C 15
Data Structures: A Pseudocode Approach with C 16
Data Structures: A Pseudocode Approach with C 17
Data Structures: A Pseudocode Approach with C 18
Data Structures: A Pseudocode Approach with C 19
Data Structures: A Pseudocode Approach with C 20
Data Structures: A Pseudocode Approach with C 21
Data Structures: A Pseudocode Approach with C 22
Data Structures: A Pseudocode Approach with C 23
Data Structures: A Pseudocode Approach with C 24
Data Structures: A Pseudocode Approach with C 25
4 -3 Queue ADT This section develops the data structures and C code to implement a Queue ADT. The first program contains the data structure declarations and a list of the prototypes for all of the functions. We then develop the C code for the algorithms discussed in Section 4. 2 • Queue Structure • Queue ADT Algorithms Data Structures: A Pseudocode Approach with C 26
Data Structures: A Pseudocode Approach with C 27
Data Structures: A Pseudocode Approach with C 28
Data Structures: A Pseudocode Approach with C 29
Data Structures: A Pseudocode Approach with C 30
Data Structures: A Pseudocode Approach with C 31
Data Structures: A Pseudocode Approach with C 32
Data Structures: A Pseudocode Approach with C 33
Data Structures: A Pseudocode Approach with C 34
Data Structures: A Pseudocode Approach with C 35
Data Structures: A Pseudocode Approach with C 36
Data Structures: A Pseudocode Approach with C 37
Data Structures: A Pseudocode Approach with C 38
Data Structures: A Pseudocode Approach with C 39
Data Structures: A Pseudocode Approach with C 40
- Slides: 40