Computer Science, asked by Gahqhwnwjvsb5433, 9 months ago

Struct queue {
int data[100]; int front=0 rear=-1;
q;
}

Answers

Answered by TheChessKing
25

Answer:

It is a linear data structure.

It is considered as sequence of items.

It supports FIFO (First In First Out) property.

It has three components:

A Container of items that contains elements of queue.

A pointer front that points the first item of the queue.

A pointer rear that points the last item of the queue.

Insertion is performed from REAR end.

Deletion is performed from FRONT end.

Insertion operation is also known as ENQUEUE in queue.

Answered by Jamestiwari
0

A Container of items that contains elements of queue.

It is considered as sequence of items. It supports FIFO (First In First Out) property.

It has three components:

A pointer front that points the first item of the queue.

It is a linear data structure.

A pointer rear that points the last item of the queue.

Insertion is performed from REAR end.

Deletion is performed from FRONT end Insertion operation is also known as ENQUEUE in queue.

#SPJ2

Similar questions