COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following data structure works on the principle of First Come First Serve?
|
|
Stack
|
|
|
Linked List
|
|
|
Tree
|
|
|
Queue
|
Explanation:
Detailed explanation-1: -A queue is a linear data structure that stores the elements sequentially. It uses the FIFO approach (First In First Out) for accessing elements.
Detailed explanation-2: -4.1.1 First In First Out (FIFO) 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.
Detailed explanation-3: -Among these data structures, heap data structure provides an efficient implementation of priority queues.
Detailed explanation-4: -A queue is structured, as an ordered collection of items which are added at one end, called the “rear, ” and removed from the other end, called the “front.” Queues maintain a FIFO ordering property.
There is 1 question to complete.