Presentation is loading. Please wait.

Presentation is loading. Please wait.

PS3-Slides typedef struct ProcessTag{ int id; int size; int time; int importance; int priority; } PrintJob; Priority is - say - a function of size, time.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "PS3-Slides typedef struct ProcessTag{ int id; int size; int time; int importance; int priority; } PrintJob; Priority is - say - a function of size, time."— Presentation transcript:

1 PS3-Slides typedef struct ProcessTag{ int id; int size; int time; int importance; int priority; } PrintJob; Priority is - say - a function of size, time and importance Process Queue Insert Process into Process Queue Remove Process of highest priority

2 PS3-Slides Using an Abstract Data Type Application program Module Implementation Module Interface Specification Process Manager Priority Queue Abstract Data Type

3 PS3-Slides Priority Queue Abstract Data Type Interface Specification 1) Application must define PQItem. typedef Process PQItem; 2) Functions the Priority Queue needs from the Application: int Order(Process x, Process y); Process NullItem(void); void CopyItem(Process *newjob, Process oldjob);

4 PS3-Slides Priority Queue Abstract Data Type Interface Specification 3) Public Functions Available to Application from Priority Queue: void PQInitialization(PriorityQueue *); bool PQEmpty(PriorityQueue *); bool PQFull(PriorityQueue *); int PQSize(PriorityQueue *); void PQInsert(PQItem, PriorityQueue *); PQItem PQRemove(PriorityQueue *);

5 PS3-Slides Communicating Between Application Program and Module /* Application Program File */ #include … #include "Application.h" /*contains definitions of the items and structures used in the application program and prototypes of application functions the module needs */ #include "ModuleInterface.h" /* contains public data and function prototypes in the module */ void ApplicationFunction1(void) { … } … int main(void){ … }

6 PS3-Slides Communicating Between Application Program and Module /* Module File */ #include … #include "Application.h" /* see previous comments */ #include "ModuleInterface.h" /* see previous comments */ void ModuleFunction1(void){ … } …

7 PS3-Slides Application program Module Implementation 1 Module Interface Specification Application program Module Implementation 2 Module Interface Specification These are identical These are different Changing Module Implementations

8 PS3-Slides Priority Queue Implemented with Sorted Linked List Count ItemList PQItem Link PQItem Link PQItem Link The Priority Queue typedef struct PQNodeTag { /* Node */ PQItem NodeItem; struct PQNodeTag *Link; } PQListNode; typedef struct { /* The queue */ int Count; PQListNode *ItemList; } PriorityQueue;

9 PS3-Slides Priority Queue Implemented with Unsorted Array Count ItemArray The Priority Queue PQItem 0 1 2 3 Count-1 MAXCOUNT-1 typedef PQItem PQArray[MAXCOUNT] typedef struct{ int Count; PQArray ItemArray; } PriorityQueue; PQItems in order of INSERTION.

10 Process Management using a Priority Queue This program uses a Priority Queue to manage processes. The list can hold a maximum of 50 jobs. Using Sorted Linked-list Implementation of Priority Queue. MAKE SURE YOUR APPLICATION PROGRAM USES '#include PQImpl1.h'. Use the H command anytime to list valid commands. Valid commands are: A - Add a process to the Priority Queue R - Remove the highest priority process from the Priority Queue C - Show the number of processes in the Priority Queue H - List valid commands Q - Quit Command> a New process job: Size: 4 Time: 12 Importance (insignificant=0, average=1, or urgent=2): 1 Job id = 1 size = 4 time = 12 importance = 1 priority = 4 PS3-Slides

11 Command> a New process: Size: 2 Time: 8 Importance (insignificant=0, average=1, or urgent=2): 1 Job id = 2 size = 2 time = 8 importance = 1 priority = 2 Command> a New process: Size: 7 Time: 22 Importance (insignificant=0, average=1, or urgent=2): 1 Job id = 3 size = 7 time = 22 importance = 1 priority = 7 Command> c Number of jobs in Process Queue is 3 Command> r Highest priority process removed: Job id = 3 size = 7 time = 22 importance = 1 priority = 7 Command>

Download ppt "PS3-Slides typedef struct ProcessTag{ int id; int size; int time; int importance; int priority; } PrintJob; Priority is - say - a function of size, time."

Similar presentations

418115: II. Linked List A linked list can be thought of a chain of linked list elements. A linked list element contains a single data item, and contains.

418115: II. Linked List A linked list can be thought of a chain of linked list elements. A linked list element contains a single data item, and contains.
Lists, Stacks, Queues Svetlin Nakov Telerik Corporation www.telerik.com.

Lists, Stacks, Queues Svetlin Nakov Telerik Corporation
LIST PROCESSING.

LIST PROCESSING.
Queue Definition Ordered list with property: –All insertions take place at one end (tail) –All deletions take place at other end (head) Queue: Q = (a 0,

Queue Definition Ordered list with property: –All insertions take place at one end (tail) –All deletions take place at other end (head) Queue: Q = (a 0,
Queues. Queue Definition Ordered list with property: All insertions take place at one end (tail) All insertions take place at one end (tail) All deletions.

Queues. Queue Definition Ordered list with property: All insertions take place at one end (tail) All insertions take place at one end (tail) All deletions.
C++ Templates. What is a template? Templates are type-generic versions of functions and/or classes Template functions and template classes can be used.

C++ Templates. What is a template? Templates are type-generic versions of functions and/or classes Template functions and template classes can be used.
Module R2 Overview. Process queues As processes enter the system and transition from state to state, they are stored queues. There may be many different.

Module R2 Overview. Process queues As processes enter the system and transition from state to state, they are stored queues. There may be many different.
Queues CS-212 Dick Steflik. Queues First In, First Out operation – FIFO As items are added they are chronologically ordered, items are removed in their.

Queues CS-212 Dick Steflik. Queues First In, First Out operation – FIFO As items are added they are chronologically ordered, items are removed in their.
ADT Queue 1. What is a Queue? 2. STL Queue 3. Array Implementation of Queue 4. Linked List Implementation of Queue 5. Priority Queue.

ADT Queue 1. What is a Queue? 2. STL Queue 3. Array Implementation of Queue 4. Linked List Implementation of Queue 5. Priority Queue.
Priority Queues. 2 Priority queue A stack is first in, last out A queue is first in, first out A priority queue is least-first-out The “smallest” element.

Priority Queues. 2 Priority queue A stack is first in, last out A queue is first in, first out A priority queue is least-first-out The “smallest” element.
1 Heaps & Priority Queues (Walls & Mirrors - Remainder of Chapter 11)

1 Heaps & Priority Queues (Walls & Mirrors - Remainder of Chapter 11)
F00 pq 1 Priority Queues Review the abstract data type Priority Queues Review different implementation options.

F00 pq 1 Priority Queues Review the abstract data type Priority Queues Review different implementation options.
Priority Queues and Heaps. Overview Our last ADT: PriorityQueueADT A new data structure: heaps One more sorting algorithm: heapsort Priority Queues and.

Priority Queues and Heaps. Overview Our last ADT: PriorityQueueADT A new data structure: heaps One more sorting algorithm: heapsort Priority Queues and.
1 Chapter 6 Priority Queues (Heaps) General ideas of priority queues (Insert & DeleteMin) Efficient implementation of priority queue Uses of priority queues.

1 Chapter 6 Priority Queues (Heaps) General ideas of priority queues (Insert & DeleteMin) Efficient implementation of priority queue Uses of priority queues.
Main Index Contents 11 Main Index Contents Model for a Queue Model for a Queue The Queue The Queue ADTQueue ADT (3 slides) Queue ADT Radix Sort Radix Sort.

Main Index Contents 11 Main Index Contents Model for a Queue Model for a Queue The Queue The Queue ADTQueue ADT (3 slides) Queue ADT Radix Sort Radix Sort.
Priority Queues. Priority queue A stack is first in, last out A queue is first in, first out A priority queue is least-first-out –The “smallest” element.

Priority Queues. Priority queue A stack is first in, last out A queue is first in, first out A priority queue is least-first-out –The “smallest” element.
Priority Queues. Priority queue A stack is first in, last out A queue is first in, first out A priority queue is least-first-out –The “smallest” element.

Priority Queues. Priority queue A stack is first in, last out A queue is first in, first out A priority queue is least-first-out –The “smallest” element.
1 CS211, Lecture 20 Priority queues and Heaps Readings: Weiss, sec. 6.9, secs. 21.1--21.5. When they've got two queues going, there's never any queue!

1 CS211, Lecture 20 Priority queues and Heaps Readings: Weiss, sec. 6.9, secs When they've got two queues going, there's never any queue!
Source: Muangsin / Weiss1 Priority Queue (Heap) A kind of queue Dequeue gets element with the highest priority Priority is based on a comparable value.

Source: Muangsin / Weiss1 Priority Queue (Heap) A kind of queue Dequeue gets element with the highest priority Priority is based on a comparable value.
Queues CS-240 & CS-341 Dick Steflik. Queues First In, First Out operation – FIFO As items are added they are chronologically ordered, items are removed.

Queues CS-240 & CS-341 Dick Steflik. Queues First In, First Out operation – FIFO As items are added they are chronologically ordered, items are removed.

Similar presentations

Ads by Google