MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
____ form of access is used to add and remove nodes from a queue.
A
LIFO, Last In First Out
B
FIFO, First In First Out
C
Both a and b
D
none
Explanation: 

Detailed explanation-1: -In queue, insertion operation is known as Enqueue whereas deletion operation is known as Dequeue.

Detailed explanation-2: -Explanation: New nodes are added to the back of the queue.

Detailed explanation-3: -Queue is an abstract data type or a linear data structure, in which the first element is inserted from one end called the rear, and the removal of existing element takes place from the other end called as front.

Detailed explanation-4: -It is also known as “first-come first-served.” The simplest example of a queue is the typical line that we all participate in from time to time. We wait in a line for a movie, we wait in the check-out line at a grocery store, and we wait in the cafeteria line (so that we can pop the tray stack).

There is 1 question to complete.
Previous
Next