Scribd
Upload
32 views3 pages

Stack & Queue Notes

The document explains the concepts of Stack and Queue as linear data structures, highlighting their operational principles: Stack follows Last In First Out (LIFO) while Queue follows First In First Out (FIFO). It provides examples and characteristics of both structures, emphasizing their usage in handling data. Additionally, it discusses the representation of these structures using arrays.

Uploaded by

Lapi Lapil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views3 pages

Stack & Queue Notes

The document explains the concepts of Stack and Queue as linear data structures, highlighting their operational principles: Stack follows Last In First Out (LIFO) while Queue follows First In First Out (FIFO). It provides examples and characteristics of both structures, emphasizing their usage in handling data. Additionally, it discusses the representation of these structures using arrays.

Uploaded by

Lapi Lapil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Stack and Queue

Stack
followS a
Stack is a lineas data stxuctuxe that
0xdex in which the ope3ations
are pertormed.
paxticulax
LIFOCLast In Fivst Out)
0T

The Oxdex may be


Last Out).
FILO CFixst In
Push PoP C
C
c
ToP C B
B
A A
Stack Data Stzuctuae

stack.
Thexe ase many veal-lite examples of a
stacked over one
Conside an example 0 plates
canteen. The plate which is at the
another in the
i.e. the plate
top is the fiast one to be xemoved,
which has been placed at the bottom-most position
emains in the Stack for the longest peviod of time.
So, it can be simply Seen to follow LIFOCLast.In
Fist Out)
oxdex.
FILO CFiast In Last Out)
Shubham Upadhyay CLinkedIn)
Queue
A Queue is defined as a lineas datq structuze that
is Open at both ends and the opebations ae peafoamed
ordex.
in Fixst In Fixst Out CFI F0)

We define a queue to be a list in which all additions

tothe list aze made at one end, and all deletions


tsom the list ave made at the othe end. Thne
element which is first pushed into the ordez,
Ozdes
the operation is first performed on that

Frort/Head Back/Tail/ Kear

Dequeue
B45 Engueve
2
Queue Datq Structve

Charactesistics of Queue
Queue can handle multiple data.
We can access both ends.
fast and flexible.
Tne
They are

Shubham UpadhyayCLinkedIn)
Queue Representation
Like stacks, Queves Can also be vepresented in an

the Gueue is
aray In this Tepresentation, implemented
Vasiables used in this Case axe
USing the array
of the array queue elements.
storing
Queue. the name
the First element is stored
o Front: the îndex where
thequeue.
in the aray epvesenting
where the last
element is stored în an
Reas: the index
epresenting the queue.
arayaray
Such
such Notes.)
Notes:)
Foz moze

Follow 5hubham Upadhyay

You might also like