Академический Документы
Профессиональный Документы
Культура Документы
STRUCTURES
MAHESH GOYANI
MAHATMA GANDHI INSTITUE OF TECHNICAL EDUCATION & RESEARCH CENTER
mgoyani@rediffmail.com
Push : rear++
Pop : front++
3. [Insert Element]
QUEUE[REAR] = X
4. [Exit]
2. [Read Element]
X = QUEUE [FRONT]
4. [Exit]
Front = -1
Rear = -1
front rear
1 7 5 2 6
1 7 5 2 6
0 1 2 3 4 5 6 7
front rear
1 7 5 2 6
1 7 5 2 6
0 1 2 3 4 5 6 7
front rear
1 7 5 2 6 8
1 7 5 2 6 8
0 1 2 3 4 5 6 7
enqueue(8) front rear
0 5
(C) GOYANI MAHESH 10
front rear
7 5 2 6 8
7 5 2 6 8
0 1 2 3 4 5 6 7
dequeue()
front rear
1 5
front rear
5 2 6 8
5 2 6 8
0 1 2 3 4 5 6 7
dequeue()
front rear
2 5
front rear
5 2 6 8
5 2 6 8
0 1 2 3 4 5 6 7
dequeue()
front rear
2 5
front rear
5 2 6 8 9 12
5 2 6 8 9 12
0 1 2 3 4 5 6 7
enqueue(9)
front rear
enqueue(12)
enqueue(21) ?? 2 7
(C) GOYANI MAHESH 13
QUEUE – Using LINKED LIST
1 7 5 2 1 7 5 2
1 7 5 2 1 7 5 2
7 5 2 1 7 5 2
dequeue()
1 7 5 2 1 7 5 2
7 5 2 1 7 5 2
dequeue()
7 5 2 9 7 5 2 9
enqueue(9)
(C) GOYANI MAHESH 16
CIRCULAR QUEUE
6 3 2 QUEUE Full
0 1
front rear 21 front size
7 2 2 8
12 5
5 2 6 8 9 12 21
6 9 2
8 6 3 rear noElements
enqueue(21) 0 7
5 4
0 1
front rear 21 front size
7 2 2 8
12 5
5 2 6 8 9 12 21
6 9 2
8 6 3 rear noElements
enqueue(21) 0 7
5 4
0 1
front rear 21 7 front size
7 2 2 8
12 5
5 2 6 8 9 12 21 7
6 9 2
8 6 3 rear noElements
enqueue(7)
1 8
5
(C) GOYANI MAHESH 4 20
0 1
0 1
int dequeue()
{
int x = QUEUE[front];
front = (front+1)%size;
noElements = noElements-1;
return x;
}
int isFull()
{
return noElements == size;
}
int isEmpty()
{
return noElements == 0;
}
b). Exit.
a). FRONT = 0
b). REAR = 0
6. Exit.
b). Exit.
3. if (FRONT == REAR)
REAR = FRONT = -1
Else
Insertion Insertion
14 69 44 33 34
Deletion Deletion
Simulation
NODE
DATA 14 10 12 60 13
12 7
9 11 23 56 15
Priority
DATA Priority
REAR
10 9 12 17
10 9 12 17 60 30
10 9 12 17 60 30 13 46
10 9 14 10 12 17 60 30 13 46
14 10 12 17 60 30 13 46
12 17 60 30 13 46