1. Lecture No.09 Data Structures Dr. Sohail Aslam

2. Memory Organization Process 1 (browser) Code Process 3 (word)
Static data
Process 4 (excel)
Stack
End of lecture 8
Process 2 (dev-c++)
Windows OS
Heap

3. Stack Layout during a call
Here is stack layout when function F calls function G:
Parameters(F)
Local variables(F)
Return address(F)
Parameters(G)
Parameters(F)
Local variables(F)
Return address(F)
Parameters(G)
Local variables(G)
Return address(G)
Parameters(F)
Local variables(F)
Return address(F) sp sp sp
At point of call
During execution of G
After call

4. Queues A stack is LIFO (Last-In First Out) structure.
In contrast, a queue is a FIFO (First-In First-Out ) structure.
A queue is a linear structure for which items can be only inserted at one end and removed at another end.

5. Queue Operations Enqueue(X) – place X at the rear of the queue.
Dequeue() -- remove the front element and return it.
Front() -- return front element without removing it.
IsEmpty() -- return TRUE if queue is empty, FALSE otherwise

6. Implementing Queue Using linked List: Recall
Insert works in constant time for either end of a linked list.
Remove works in constant time only.
Seems best that head of the linked list be the front of the queue so that all removes will be from the front.
Inserts will be at the end of the list.

7. Implementing Queue Using linked List: rear front rear front 1 7 5 2 1

8. Implementing Queue Using linked List: dequeue() rear front rear front1 7 5 2 1 7 5 2
dequeue()
rear
front
rear
front 1 7 5 2 7 5 2

9. Implementing Queue Using linked List: enqueue(9) front rear front rear1 7 5 2 1 7 5 2
enqueue(9)
rear
front
rear
front 7 5 2 9 7 5 2 9

10. Implementing Queue int dequeue() { int x = front->get();
Node* p = front;
front = front->getNext();
delete p;
return x; }
void enqueue(int x)
Node* newNode = new Node();
newNode->set(x);
newNode->setNext(NULL);
rear->setNext(newNode);
rear = newNode;

11. Implementing Queue int front() { return front->get(); }
int isEmpty()
return ( front == NULL );

12. Queue using Array
If we use an array to hold queue elements, both insertions and removal at the front (start) of the array are 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.

13. Queue using Array
front
rear 6 5 7 1 3 2 4
front
rear 1 7 5 2

14. Queue using Array enqueue(6) front rear 1 7 5 2 6 1 7 5 2 6 1 2 3 4 51 2 3 4 5 6 7
front
rear 4

15. Queue using Array enqueue(8) front rear 1 7 5 2 6 8 1 7 5 2 6 8 1 2 31 2 3 4 5 6 7
front
rear 5

16. Queue using Array dequeue() front rear 7 5 2 6 8 7 5 2 6 8 1 2 3 4 5 61 2 3 4 5 6 7
front
rear 1 5

17. Queue using Array dequeue() front rear 5 2 6 8 5 2 6 8 1 2 3 4 5 6 71 2 3 4 5 6 7
front
rear 2 5

18. Queue using Array enqueue(9) enqueue(12) enqueue(21) ?? front rear 5 26 8 9 12 5 2 6 8 9 12 1 2 3 4 5 6 7
front
rear 2 7
enqueue(21) ??

19. Queue using Array
We have inserts and removal running in constant time but we created a new problem.
Cannot insert new elements even though there are two places available at the start of the array.
Solution: allow the queue to “wrap around”.

20. Queue using Array
Basic idea is to picture the array as a circular array. 6 5 7 1 3 2 4 8 9 12
front
front
rear 2 5 2 6 8 9 12
rear 7

21. Queue using Array enqueue(21) void enqueue(int x) {1 2
front 8
size
front
rear 21 7 2 12 5 5 2 6 8 9 12 21 9 2 6 3
rear
noElements 8 6 7 5 4
void enqueue(int x) {
rear = (rear+1)%size;
array[rear] = x;
noElements = noElements+1; }

22. Queue using Array enqueue(7) int isFull() { return noElements == size;1 2
front 8
size
front
rear 21 7 7 2 12 5 5 2 6 8 9 12 21 7 9 2 6 3 1
rear
noElements 8 6 8 5 4
int isFull() {
return noElements == size; }
int isEmpty()
return noElements == 0;

23. Queue using Array dequeue() int dequeue() { int x = array[front];1 4
front 8
size
front
rear 21 7 7 2 12 6 8 9 12 21 7 9 6 3 1
rear
noElements 8 6 6 5 4
int dequeue() {
int x = array[front];
front = (front+1)%size;
noElements = noElements-1;
return x; }

24. Use of Queues
Out of the numerous uses of the queues, one of the most useful is simulation.
A simulation program attempts to model a real-world phenomenon.
Many popular video games are simulations, e.g., SimCity, FlightSimulator
Each object and action in the simulation has a counterpart in real world.

25. Uses of Queues
If the simulation is accurate, the result of the program should mirror the results of the real-world event.
Thus it is possible to understand what occurs in the real-world without actually observing its occurrence.
Let us look at an example. Suppose there is a bank with four tellers.

26. Simulation of a Bank
A customer enters the bank at a specific time (t1) desiring to conduct a transaction.
Any one of the four tellers can attend to the customer.
The transaction (withdraw, deposit) will take a certain period of time (t2).
If a teller is free, the teller can process the customer’s transaction immediately and the customer leaves the bank at t1+t2.
End of lecture 9