Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
0Activity
0 of .
Results for:
No results containing your search query
P. 1
Queues Son

Queues Son

Ratings: (0)|Views: 0|Likes:
Published by reaper_aeikanshc

More info:

Categories:Types, School Work
Published by: reaper_aeikanshc on Jun 30, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

06/30/2012

pdf

text

original

 
Queues
EENG212AlgorithmAndData Structures
 
DEFINITION OF QUEUE
 
A
Queue
is an ordered collection of items from which items maybe deleted at one end (called the
front 
 
of the queue) and intowhich items may be inserted at the other end (the
rear 
of thequeue).
The first element inserted into the queue is the first element to beremoved. For this reason a queue is sometimes called a
fifo 
(first-in first-out) list as opposed to the stack, which is a
lifo 
(last-in first-out).
 
 
Queue
items
[MAXQUEUE-1]
. .. .. .items[2] Citems[1] Bitems[0] A
Front=0Rear=2

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->