Next: Array Queues: queue.dat Up: 3240 Previous: Stacks: C++ Contents

Queues: ADT [33]

$\begin{picture}(300,134)(40,680) \thicklines\put( 40,760){\line( 1, 0){300}} \pu... ...ut(235,735){\makebox(0,0)[lb]{\raisebox{0pt}[0pt][0pt]{\twlrm 5}}} \end{picture}$

FIFO: First-in First-out

QUEUE create_queue(unsigned int max_elements);
int is_empty(QUEUE Q);
int is_full(QUEUE Q);
void enqueue(element_type x, QUEUE Q);   /* rear++ */
element_type dequeue(QUEUE Q);           /* front++ */

% gcc -o queue queue.c                                 > tcc queue.c
% queue
> h
h(elp; q(uit; e(nqueue x; D(equeue; d(isplay; s(how_array; c(reate x
> e 7 e 9 e 4 e 5 d 

Queue (max_size=10, size=4, front=1, rear=4):
7 9 4 5

Applications: FIFO problems, ready queues in OS

Subsections

Ted Billard 2001-10-25