Queue

Question 1

Graph explains FIFO & LIFO

Answer 1

Question 2

Picture of operation of EnQueue and DeQueue implemented with array

Answer 2

Question 3

Pseudocode of function Enqueue implemented with array

Answer 3

Question 4

Pseudocode of function Dequeue implemented with array

Answer 4

Question 5

Pseudocode of function front implemented with array

Answer 5

Question 6

Queue : Struct Queue - Array

Answer 6

Question 7

Queue : Create_new_queue - Array

1.malloc
2.capacity(unsigned)
3.front,size
4.rear
5.array
6.return

Answer 7

Question 8

Queue : isfull && isempty - Array

Answer 8

Question 9

Queue : enqueue - Array

Hint: size= queue->capacity: Calculates the remainder of dividing the incremented rear pointer by the capacity of the queue. This ensures that if the rear pointer reaches the end of the array, it wraps around to the beginning, thus implementing a circular queue.

1.isfull
2.rear
3.item
4.size

Answer 9

Question 10

Queue : dequeue - Array

Hints:
1.isempty
2.item
3.front
4.size
5.return item

Answer 10

Question 11

Queue : front - Array

Answer 11

Question 12

Queue : rear - Array

Answer 12

Question 13

Queue: define structure - Link List

Answer 13

Question 14

Queue: newnode - Link List

Answer 14

Question 15

Queue: create_queue - Link List

Answer 15

Question 16

Queue: enqueue - Link List

Answer 16

Question 17

Queue: dequeue - Link List

Answer 17

Question 18

Queue: printf front &&rear - Link List

Answer 18

Question 19

A detail you should know when you traversal queue from rear to head:

Answer 19