CUET Computer Science Key cards: 5 of this chapter’s 64 are free to read, with no account.
Say the answer in your head, then turn the card over.
The 5 free cards from Queue
Card 1 of 5
1 of 5
Definition
What is a Queue?
Computer Science, Ch 4, p. 53
Definition
What is a Queue?
Queue is an ordered linear list of elements, having different ends for adding and removing elements in it.
Computer Science, Ch 4, p. 53
Definition
Define the FIFO principle of a queue.
Computer Science, Ch 4, p. 54
Definition
Define the FIFO principle of a queue.
Queue follows the principle of First In First Out (FIFO), since the element entering first in the queue will be the first one to come out of it.
Computer Science, Ch 4, p. 54
Definition
How does a queue add and remove items? What are the REAR and the FRONT?
Computer Science, Ch 4, p. 54
Definition
How does a queue add and remove items? What are the REAR and the FRONT?
Queue is an arrangement in which new objects/items always get added at one end, usually called the REAR, and objects/items always get removed from the other end, usually called the FRONT of the queue.
Computer Science, Ch 4, p. 54
Definition
What is the ENQUEUE operation?
Computer Science, Ch 4, p. 55
Definition
What is the ENQUEUE operation?
ENQUEUE: is used to insert a new element to the queue at the rear end.
Computer Science, Ch 4, p. 55
Definition
What is the DEQUEUE operation?
Computer Science, Ch 4, p. 55
Definition
What is the DEQUEUE operation?
DEQUEUE: is used to remove one element at a time from the front of the queue.