Lab # 7

QUEUE OPERATION USING LINEAR ARRAY

Task 1:
Write a function for enqueue operation.
int enqueue(int data)

if (isFullO) {

return 0;

}
rear = (rear + 1) % CAPACITY;

size++;

queue[rear] = data;

return 1;

Task 2:

Write a function for dequeue

operation.
int dequeue(int data)

int data = INT MIN;

if (isEmpty()) {

return INT MIN;

data = queue[front];

front = (front + 1) % CAPACITY;

size--;

return data;

}
Task 3:

Write a function for display of a

queue.

void display() {
int i;

printf("The queue elements are as follows: ");

for(i = front; i < = rear; i++) {

printf("%d ", queue[i]);

}
}
Conclusion:
From this lab, I came learned the implementation of queue operation using
linear array and their use such as Enqueue & Dequeue Operations. I also came
to know about their working and programming step by step.