csce 3110 data structures & algorithm analysis stacks and queues reading: chap.3 weiss
TRANSCRIPT
![Page 1: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/1.jpg)
CSCE 3110Data Structures & Algorithm Analysis
Stacks and QueuesReading: Chap.3 Weiss
![Page 2: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/2.jpg)
Stacks
Stack: what is it?ADTApplicationsImplementation(s)
![Page 3: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/3.jpg)
What is a stack?
![Page 4: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/4.jpg)
Last In First Out
BA
DCBA
CBA
DCBA
EDCBAtop
toptop
toptop
A
![Page 5: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/5.jpg)
Stack Applications
Real lifePile of booksPlate trays
More applications related to computer science
Program execution stack (read more from your text)Evaluating expressions
![Page 6: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/6.jpg)
objects: a finite ordered list with zero or more elements. methods: for all stack Stack, item element, max_stack_size positive integer Stack createS(max_stack_size) ::= create an empty stack whose maximum size is max_stack_size Boolean isFull(stack, max_stack_size) ::= if (number of elements in stack == max_stack_size) return TRUE else return FALSE Stack push(stack, item) ::= if (IsFull(stack)) stack_full else insert item into top of stack and return
Stack ADT
![Page 7: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/7.jpg)
Boolean isEmpty(stack) ::= if(stack == CreateS(max_stack_size)) return TRUE else return FALSEElement pop(stack) ::= if(IsEmpty(stack)) return else remove and return the item on the top of the stack.
Stack ADT (cont’d)
![Page 8: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/8.jpg)
Array-based Stack Implementation
Allocate an array of some size (pre-defined)
Maximum N elements in stack
Bottom stack element stored at element 0last index in the array is the topIncrement top when one element is pushed, decrement after pop
![Page 9: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/9.jpg)
Stack createS(max_stack_size) ::= #define MAX_STACK_SIZE 100 /* maximum stack size */ typedef struct { int key; /* other fields */ } element; element stack[MAX_STACK_SIZE]; int top = -1;
Boolean isEmpty(Stack) ::= top< 0;
Boolean isFull(Stack) ::= top >= MAX_STACK_SIZE-1;
Stack Implementation: CreateS, isEmpty, isFull
![Page 10: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/10.jpg)
void push(int *top, element item){ /* add an item to the global stack */ if (*top >= MAX_STACK_SIZE-1) { stack_full( ); return; } stack[++*top] = item;}
Push
![Page 11: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/11.jpg)
element pop(int *top){ /* return the top element from the stack */ if (*top == -1) return stack_empty( ); /* returns and error key */ return stack[(*top)--]; }
Pop
![Page 12: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/12.jpg)
void push(pnode top, element item){ /* add an element to the top of the stack */ pnode temp = (pnode) malloc (sizeof (node)); if (IS_FULL(temp)) { fprintf(stderr, “ The memory is full\n”); exit(1); } temp->item = item; temp->next= top; top= temp; }
List-based Stack Implementation: Push
![Page 13: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/13.jpg)
element pop(pnode top) {/* delete an element from the stack */ pnode temp = top; element item; if (IS_EMPTY(temp)) { fprintf(stderr, “The stack is empty\n”); exit(1); } item = temp->item; top = temp->next; free(temp); return item;}
Pop
![Page 14: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/14.jpg)
Algorithm Analysis
pushO(?)pop O(?)isEmpty O(?)isFull O(?)
What if top is stored at the beginning of the array?
![Page 15: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/15.jpg)
A LegendThe Towers of Hanoi
In the great temple of Brahma in Benares, on a brass plate under the dome that marks the center of the world, there are 64 disks of pure gold that the priests carry one at a time between these diamond needles according to Brahma's immutable law: No disk may be placed on a smaller disk. In the begging of the world all 64 disks formed the Tower of Brahma on one needle. Now, however, the process of transfer of the tower from one needle to another is in mid course. When the last disk is finally in place, once again forming the Tower of Brahma but on a different needle, then will come the end of the world and all will turn to dust.
![Page 16: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/16.jpg)
The Towers of HanoiA Stack-based Application
GIVEN: three polesa set of discs on the first pole, discs of different sizes, the smallest discs at the topGOAL: move all the discs from the left pole to the right one. CONDITIONS: only one disc may be moved at a time. A disc can be placed either on an empty pole or on top of a larger disc.
![Page 17: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/17.jpg)
Towers of Hanoi
![Page 18: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/18.jpg)
Towers of Hanoi
![Page 19: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/19.jpg)
Towers of Hanoi
![Page 20: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/20.jpg)
Towers of Hanoi
![Page 21: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/21.jpg)
Towers of Hanoi
![Page 22: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/22.jpg)
Towers of Hanoi
![Page 23: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/23.jpg)
Towers of Hanoi
![Page 24: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/24.jpg)
Towers of Hanoi
![Page 25: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/25.jpg)
Towers of Hanoi – Recursive Solution
void hanoi (int discs,Stack fromPole, Stack toPole, Stack aux) {
Disc d;if( discs >= 1) {
hanoi(discs-1, fromPole, aux, toPole);d = fromPole.pop();toPole.push(d);hanoi(discs-1,aux, toPole, fromPole);
}
![Page 26: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/26.jpg)
Applications
Infix to Postfix conversion [Evaluation of Expressions]
![Page 27: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/27.jpg)
Is the End of the World Approaching?
Problem complexity 2n 64 gold discsGiven 1 move a second
![Page 28: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/28.jpg)
X = a / b - c + d * e - a * c
a = 4, b = c = 2, d = e = 3
Interpretation 1: ((4/2)-2)+(3*3)-(4*2)=0 + 8+9=1
Interpretation 2:(4/(2-2+3))*(3-4)*2=(4/3)*(-1)*2=-2.66666…
How to generate the machine instructions corresponding to a given expression? precedence rule + associative rule
Evaluation of Expressions
![Page 29: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/29.jpg)
Token Operator Precedence1 Associativity
( )[ ]-> .
function callarray elementstruct or union member
17 left-to-right
-- ++ increment, decrement2 16 left-to-right
-- ++!-- +& *sizeof
decrement, increment3
logical notone’s complementunary minus or plusaddress or indirectionsize (in bytes)
15 right-to-left
(type) type cast 14 right-to-left
* / % mutiplicative 13 Left-to-right
![Page 30: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/30.jpg)
+ - binary add or subtract 12 left-to-right
<< >> shift 11 left-to-right
> >= < <=
relational
10 left-to-right
== != equality 9 left-to-right
& bitwise and 8 left-to-right
^ bitwise exclusive or 7 left-to-right
bitwise or 6 left-to-right
&& logical and 5 left-to-right
logical or 4 left-to-right
![Page 31: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/31.jpg)
?: conditional 3 right-to-left
= += -=/= *= %=<<= >>=&= ^= =
assignment 2 right-to-left
, comma 1 left-to-right
![Page 32: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/32.jpg)
Infix Postfix
2+3*4 a*b+5 (1+2)*7 a*b/c (a/(b-c+d))*(e-a)*c a/b-c+d*e-a*c
234*+ ab*5+ 12+7* ab*c/ abc-d+/ea-*c* ab/c-de*+ac*-
user compiler
Postfix: no parentheses, no precedence
![Page 33: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/33.jpg)
Token Stack[0] [1] [2]
Top
62/3-42*+
66 26/26/2 36/2-36/2-3 46/2-3 4 26/2-3 4*26/2-3+4*2
010101210
![Page 34: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/34.jpg)
#define MAX_STACK_SIZE 100 /* maximum stack size */#define MAX_EXPR_SIZE 100 /* max size of expression */typedef enum{1paran, rparen, plus, minus, times, divide, mod, eos, operand} precedence;int stack[MAX_STACK_SIZE]; /* global stack */char expr[MAX_EXPR_SIZE]; /* input string */
Assumptions: operators: +, -, *, /, % operands: single digit integer
Infix to Postfix
![Page 35: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/35.jpg)
int eval(void){/* evaluate a postfix expression, expr, maintained as a global variable, ‘\0’ is the the end of the expression. The stack and top of the stack are global variables. get_token is used to return the token type and the character symbol. Operands are assumed to be single character digits */ precedence token; char symbol; int op1, op2; int n = 0; /* counter for the expression string */ int top = -1; token = get_token(&symbol, &n); while (token != eos) { if (token == operand) push(&top, symbol-’0’); /* stack insert */
Evaluation of Postfix Expressions
![Page 36: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/36.jpg)
else { /* remove two operands, perform operation, and return result to the stack */ op2 = pop(&top); /* stack delete */ op1 = pop(&top); switch(token) { case plus: push(&top, op1+op2); break; case minus: push(&top, op1-op2); break; case times: push(&top, op1*op2); break; case divide: push(&top, op1/op2); break; case mod: push(&top, op1%op2); } } token = get_token (&symbol, &n); } return pop(&top); /* return result */}
![Page 37: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/37.jpg)
precedence get_token(char *symbol, int *n){/* get the next token, symbol is the character representation, which is returned, the token is represented by its enumerated value, which is returned in the function name */ *symbol =expr[(*n)++]; switch (*symbol) { case ‘(‘ : return lparen; case ’)’ : return rparen; case ‘+’: return plus; case ‘-’ : return minus;
![Page 38: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/38.jpg)
case ‘/’ : return divide; case ‘*’ : return times; case ‘%’ : return mod; case ‘\0‘ : return eos; default : return operand; /* no error checking, default is operand */ }}
![Page 39: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/39.jpg)
Infix to Postfix Conversion(Intuitive Algorithm)
(1) Fully parenthesized expressiona / b - c + d * e - a * c -->((((a / b) - c) + (d * e)) – (a * c))
(2) All operators replace their corresponding right parentheses.
((((a / b) - c) + (d * e)) – (a * c))
(3) Delete all parentheses.ab/c-de*+ac*-
two passes
/ - *+ *-
![Page 40: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/40.jpg)
Token Stack[0] [1] [2]
Top Output
a+b*ceos
+++ *+ *
-10011-1
aaabababcabc*=
The orders of operands in infix and postfix are the same.a + b * c, * > +
![Page 41: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/41.jpg)
Token Stack[0] [1] [2]
Top Output
a*1
(b+c)*2
deos
*1
*1 (*1 (*1 ( +*1 ( +*1
*2
*2
*2
-1011220000
aaaabababcabc+abc+*1
abc+*1dabc+*1d*2
a *1 (b +c) *2 d
match )
*1 = *2
![Page 42: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/42.jpg)
(1) Operators are taken out of the stack as long as theirin-stack precedence is higher than or equal to the incoming precedence of the new operator.
(2) ( has low in-stack precedence, and high incomingprecedence.
( ) + - * / % eosisp 0 19 12 12 13 13 13 0icp 20 19 12 12 13 13 13 0
Rules
![Page 43: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/43.jpg)
precedence stack[MAX_STACK_SIZE];/* isp and icp arrays -- index is value of precedencelparen, rparen, plus, minus, times, divide, mod, eos */static int isp [ ] = {0, 19, 12, 12, 13, 13, 13, 0};static int icp [ ] = {20, 19, 12, 12, 13, 13, 13, 0};
isp: in-stack precedenceicp: incoming precedence
![Page 44: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/44.jpg)
void postfix(void){/* output the postfix of the expression. The expression string, the stack, and top are global */ char symbol; precedence token; int n = 0; int top = 0; /* place eos on stack */ stack[0] = eos; for (token = get _token(&symbol, &n); token != eos; token = get_token(&symbol, &n)) { if (token == operand) printf (“%c”, symbol); else if (token == rparen ){
Infix to Postfix
![Page 45: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/45.jpg)
/*unstack tokens until left parenthesis */ while (stack[top] != lparen) print_token(delete(&top)); pop(&top); /*discard the left parenthesis */ } else{ /* remove and print symbols whose isp is greater than or equal to the current token’s icp */ while(isp[stack[top]] >= icp[token] ) print_token(delete(&top)); push(&top, token); } } while ((token = pop(&top)) != eos) print_token(token); print(“\n”);}
Infix to Postfix (cont’d)
![Page 46: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/46.jpg)
QueueStores a set of elements in a particular orderStack principle: FIRST IN FIRST OUT= FIFOIt means: the first element inserted is the first one to be removedExample
The first one in line is the first one to be served
![Page 47: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/47.jpg)
Queue Applications
Real life examplesWaiting in lineWaiting on hold for tech support
Applications related to Computer Science
ThreadsJob scheduling (e.g. Round-Robin algorithm for CPU allocation)
![Page 48: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/48.jpg)
ABA
CBA
DCBA
DCBrear
front
rearfront
rear
front
rear
front
rear
front
First In First Out
![Page 49: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/49.jpg)
front rear Q[0] Q[1] Q[2] Q[3] Comments
-1-1-1-1 0 1
-1 0 1 2 2 2
J1J1 J2J1 J2 J3 J2 J3 J3
queue is emptyJob 1 is addedJob 2 is addedJob 3 is addedJob 1 is deletedJob 2 is deleted
Applications: Job Scheduling
![Page 50: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/50.jpg)
objects: a finite ordered list with zero or more elements.methods: for all queue Queue, item element, max_ queue_ size positive integer Queue createQ(max_queue_size) ::= create an empty queue whose maximum size is max_queue_size Boolean isFullQ(queue, max_queue_size) ::= if(number of elements in queue == max_queue_size) return TRUE else return FALSE Queue Enqueue(queue, item) ::= if (IsFullQ(queue)) queue_full else insert item at rear of queue and return queue
Queue ADT
![Page 51: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/51.jpg)
Boolean isEmptyQ(queue) ::= if (queue ==CreateQ(max_queue_size)) return TRUE else return FALSE Element dequeue(queue) ::= if (IsEmptyQ(queue)) return else remove and return the item at front of queue.
Queue ADT (cont’d)
![Page 52: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/52.jpg)
Array-based Queue Implementation
As with the array-based stack implementation, the array is of fixed size
A queue of maximum N elements
Slightly more complicatedNeed to maintain track of both front and rear Implementation 1
Implementation 2
![Page 53: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/53.jpg)
Queue createQ(max_queue_size) ::=# define MAX_QUEUE_SIZE 100/* Maximum queue size */typedef struct { int key; /* other fields */ } element;element queue[MAX_QUEUE_SIZE];int rear = -1;int front = -1;Boolean isEmpty(queue) ::= front == rearBoolean isFullQ(queue) ::= rear == MAX_QUEUE_SIZE-1
Implementation 1: createQ, isEmptyQ, isFullQ
![Page 54: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/54.jpg)
void enqueue(int *rear, element item){/* add an item to the queue */ if (*rear == MAX_QUEUE_SIZE_1) { queue_full( ); return; } queue [++*rear] = item;}
Implementation 1:enqueue
![Page 55: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/55.jpg)
element dequeue(int *front, int rear){/* remove element at the front of the queue */ if ( *front == rear) return queue_empty( ); /* return an error key */ return queue [++ *front];}
Implementation 1:dequeue
![Page 56: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/56.jpg)
EMPTY QUEUE[2] [3] [2] [3]
[1] [4] [1] [4]
[0] [5] [0] [5]
front = 0 front = 0 rear = 0 rear = 3
J2
J1
J3
Implementation 2:Wrapped Configuration
Can be seen as a circular queue
![Page 57: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/57.jpg)
FULL QUEUE FULL QUEUE
[2] [3] [2] [3]
[1] [4][1] [4]
[0] [5] [0] [5]
front =0rear = 5
front =4rear =3
J2 J3
J1 J4
J5 J6 J5
J7
J8 J9
Leave one empty space when queue is fullWhy?
How to test when queue is empty?How to test when queue is full?
![Page 58: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/58.jpg)
void enqueue(int front, int *rear, element item){/* add an item to the queue */ *rear = (*rear +1) % MAX_QUEUE_SIZE; if (front == *rear) /* reset rear and print error */ return; } queue[*rear] = item; }
Enqueue in a Circular Queue
![Page 59: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/59.jpg)
element dequeue(int* front, int rear){ element item; /* remove front element from the queue and put it in item */ if (*front == rear) return queue_empty( ); /* queue_empty returns an error key */ *front = (*front+1) % MAX_QUEUE_SIZE; return queue[*front];}
Dequeue from Circular Queue
![Page 60: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/60.jpg)
void enqueue(pnode &front, pnode rear, element item)
{ /* add an element to the rear of the queue */ pnode temp = (pnode) malloc(sizeof (queue)); if (IS_FULL(temp)) { fprintf(stderr, “ The memory is full\n”); exit(1); } temp->item = item; temp->next= NULL; if (front) { (rear) -> next= temp;} else front = temp; rear = temp; }
List-based Queue Implementation: Enqueue
![Page 61: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/61.jpg)
element dequeue(pnode &front) {/* delete an element from the queue */ pnode temp = front; element item; if (IS_EMPTY(front)) { fprintf(stderr, “The queue is empty\n”); exit(1); } item = temp->item; front = temp->next; free(temp); return item;}
Dequeue
![Page 62: CSCE 3110 Data Structures & Algorithm Analysis Stacks and Queues Reading: Chap.3 Weiss](https://reader035.vdocument.in/reader035/viewer/2022062322/56649c7b5503460f9492f35d/html5/thumbnails/62.jpg)
Algorithm Analysis
enqueue O(?)dequeue O(?)size O(?)isEmpty O(?)isFull O(?)
What if I want the first element to be always at Q[0] ?