UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES

CS8391-DATA STRUCTURES
Unit - II
Dr. A. Kathirvel
Professor, Dept of CSE, M N M J E C, Chennai

UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES
 Stack ADT – Operations – Applications – Evaluating
arithmetic expressions- Conversion of Infix
to postfix expression – Queue ADT – Operations –
Circular Queue – Priority Queue – deQueue –
applications of queues.
 TEXTBOOKS:
1. Mark Allen Weiss, “Data Structures and Algorithm
Analysis in C”, 2nd Edition, Pearson Education,1997.
2. Reema Thareja, “Data Structures Using C”, Second Edition,
Oxford University Press, 2011
29 June 2018
2
MNMJEC, Chennai - 600 097

29 June 2018MNMJEC, Chennai - 600 097
3
Topics
 Stack ADT
 Queue ADT
 Applications of Stacks and Queues

4
Stack

5
What is a Stack ?
 a stack is a particular kind of abstract data type or
collection in which the fundamental (or only) operations
on the collection are the addition of an entity to the
collection, known as push and removal of an entity,
known as pop.

6
Basic Principle
 The relation between the push and pop operations is
such that the stack is a Last-In-First-Out (LIFO) data
structure.
 In a LIFO data structure, the last element added to the
structure must be the first one to be removed.

7
Operations on Stack
 This is equivalent to the requirement that, considered as
a linear data structure, or more abstractly a sequential
collection, the push and pop operations occur only at
one end of the structure, referred to as the top of the
stack.
 Often a peek or top operation is also implemented,
returning the value of the top element without removing
it.

8
Implementation
 A stack may be implemented to have a bounded
capacity. If the stack is full and does not contain enough
space to accept an entity to be pushed, the stack is
then considered to be in an overflow state. The pop
operation removes an item from the top of the stack. A
pop either reveals previously concealed items or results
in an empty stack, but, if the stack is empty, it goes into
underflow state, which means no items are present in
stack to be removed.

9
Restricted Data Structure
 A stack is a restricted data structure, because only a
small number of operations are performed on it. The
nature of the pop and push operations also means that
stack elements have a natural order. Elements are
removed from the stack in the reverse order to the
order of their addition. Therefore, the lower elements
are those that have been on the stack the longest.

10
Examples

11
In Simple Words
 A stack
 Last-in, first-out (LIFO) property
 The last item placed on the stack will be the first item
removed
 Analogy
 A stack of dishes in a cafeteria
 A stack of Books
 A stack of Dosa
 A stack of Money

12
ADT Stack
 ADT stack operations
 Create an empty stack
 Destroy a stack
 Determine whether a stack is empty
 Add a new item
 Remove the item that was added most recently
 Retrieve the item that was added most recently
 A program can use a stack independently of the
stack’s implementation

13
Stack Operations
bool isEmpty() const;
// Determines whether a stack is empty.
// Precondition: None.
// Postcondition: Returns true if the
// stack is empty; otherwise returns
// false.

14
Stack Operations
bool push(StackItemType newItem);
// Adds an item to the top of a stack.
// Precondition: newItem is the item to
// be added.
// Postcondition: If the insertion is
// successful, newItem is on the top of
// the stack.

15
Stack Operations
bool pop(StackItemType& stackTop);
// Retrieves and removes the top of a stack
// Postcondition: If the stack is not empty,
// stackTop contains the item that was added
// most recently and the item is removed.
// However, if the stack is empty, deletion
// is impossible and stackTop is unchanged.

16
Stack Operations
bool getTop(StackItemType& stackTop) const;
// Retrieves the top of a stack.
// Postcondition: If the stack is not empty,
// stackTop contains the item that was added
// most recently. However, if the stack is
// empty, the operation fails and stackTop
// is unchanged. The stack is unchanged.

17
Implementation Using Arrays

18
The Stack Class - Public Contents
class Stack
{
public:
Stack() { size = 10; current = -1;}
int pop(){ return A[current--];}
void push(int x){A[++current] = x;}
int top(){ return A[current];}
int isEmpty(){return ( current == -1 );}
int isFull(){ return ( current == size-1);}

19
The Stack Class - Private Contents
private:
int object; // The data element
int current; // Index of the array
int size; // max size of the array
int A[10]; // Array of 10 elements
};

20
Stack - a Very Simple Application
 The simplest application of a stack is to reverse a
word.
 You push a given word to stack - letter by letter -
and then pop letters from the stack.

21
Applications of Stack
 Recursion
 Decimal to Binary Conversion
 Infix to Postfix Conversion and Evaluation
of Postfix Expressions
 Rearranging Railroad Cars
 Quick Sort
 Function Calls
 Undo button in various software.

22
outputInBinary - Algorithm
function outputInBinary(Integer n)
Stack s = new Stack
while n > 0 do
Integer bit = n modulo 2
s.push(bit)
if s is full then
return error
end if
n = floor(n / 2)
end while
while s is not empty do
output(s.pop())
end while
end function

23
Algebraic Expressions
 Infix expressions
 An operator appears between its operands
 Example: a + b
 Prefix expressions
 An operator appears before its operands
 Example: + a b
 Postfix expressions
 An operator appears after its operands
 Example: a b +

24
A complicated example
 Infix expressions:
a + b * c + ( d * e + f ) * g
 Postfix expressions:
a b c * + d e * f + g * +
 Prefix expressions:
+ + a * b c * + * d e f g

25
Evaluation of Postfix Expression

26
Evaluation of Postfix Expression
 The calculation: 1 + 2 * 4 + 3 can be written down like
this in postfix notation with the advantage of no
precedence rules and parentheses needed
 1 2 4 * + 3 +
 The expression is evaluated from the left to right using
a stack:
 when encountering an operand: push it
 when encountering an operator: pop two operands,
evaluate the result and push it.

27

28
Infix to Postfix Conversion

29
What’s this ?

30
Queue

31
Queue
 A stack is LIFO (Last-In First Out) structure. In contrast, a
queue is a FIFO (First-In First-Out ) structure.
 In a FIFO data structure, the first element added to the
queue will be the first one to be removed.
 A queue is a linear structure for which items can be only
inserted at one end and removed at another end.

32
Operations on Queue
 We will dedicate once again six operations on the
Queue.
 You can add a person to the queue (enque),
 Look who is the first person to be serviced (front)
 Rremove the first person (dequeue) and
 Check whether the queue is empty (isEmpty).
 Also there are two more operations to create and to
destroy the queue.

33
Operations
 Queue create()
 Creates an empty queue
 boolean isEmpty(Queue q)
 Tells whether the queue q is empty
 enqueue(Queue q, Item e)
 Place e at the rear of the queue q
 destroy(Queue q)
 destroys queue q

34
Operations Continued
 Item front(Queue q)
 returns the front element in Queue q without
removing it
Precondition: q is not empty
 dequeue(Queue q)
 removes front element from the queue q
Precondition: q is not empty

35
Implementation Using Arrays
 If we use an array to hold queue elements, dequeue
operation at the front (start) of the array is
expensive.
 This is because we may have to shift up to “n”
elements.
 For the stack, we needed only one end; for queue
we need both.
 To get around this, we will not shift upon removal of
an element.

36
Snapshot of a Queue

37
enqueue()

38
enqueue() again

39
dequeue()

40
dequeue() again

41
Two more enqueue()

42
What’s Wrong ?
 We have inserts and removal running in constant time
but we created a new problem.
 We cannot insert new elements even though there are
two places available at the start of the array.
 Solution: allow the queue to “wrap around”. Basic idea
is to picture the array as a circular array as show
below.

43
Queue array wrap-around

44
enqueue(element)
void enqueue(int x)
{
rear = (rear+1)%size;
array[rear] = x;
noElements = noElements+1;
}

45
dequeue()
int dequeue()
{
int x = array[front];
front = (front+1)%size;
noElements = noElements-1;
return x;
}

46
isEmpty() and isFull()
int isFull()
{
return noElements == size;
}
int isEmpty()
{
return noElements == 0;
}

47
Pointer Based Implementation
 Possible implementations of a pointer-based queue
 A linear linked list with two external references
 A reference to the front
 A reference to the back
 A circular linked list with one external reference
 A reference to the back

48
Queue - Linear and Circular List

49
Non-empty Queue - Insertion

50
Empty Queue - Insertion

51
Queue with more than 1 element - Deletion

52
Applications of Queues
 Queue is used when things don’t have to be processed
immediatly, but have to be processed in First In First
Out order like Breadth First Search.
 This property of Queue makes it also useful in
following kind of scenarios.

53
 When a resource is shared among multiple
consumers. Examples include CPU scheduling, Disk
Scheduling.
 When data is transferred asynchronously (data not
necessarily received at same rate as sent) between
two processes. Examples include IO Buffers, pipes,
file IO, etc.
 Operating systems often maintain a queue of
processes that are ready to execute or that are
waiting for a particular event to occur.

54
 Computer systems must often provide a “holding area”
for messages between two processes, two programs,
or even two systems. This holding area is usually called
a “buffer” and is often implemented as a queue.
 Call center phone systems will use a queue to hold
people in line until a service representative is free.

55
 Buffers on MP3 players and portable CD players, iPod
playlist. Playlist for jukebox - add songs to the end,
play from the front of the list.
 Round Robin (RR) algorithm is an important scheduling
algorithm. It is used especially for the time-sharing
system. The circular queue is used to implement such
algorithms.

Questions and Discussion
29 June 2018
56
MNMJEC, Chennai - 600 097

UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES

More Related Content

What's hot

Similar to UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES

More from Kathirvel Ayyaswamy

Recently uploaded

In this document

UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES