Question

7. Which of the following data structure works on the principle of First Come First
Serve?
A) Priority queue
(B) Heap
(C) Stack
(D) Queue

Answer 1

Answer:

Queue uses FIFO principle. Explanation: Element first added in queue will be deleted first which is FIFO principle. Explanation: Circular Queue is also called as Ring Buffer. Circular Queue is a linear data structure in which last position is connected back to the first position to make a circle.

Answer 2

Answer:

$\huge\pink{\boxed{\green{\mathfrak{\overbrace{\underbrace{\fcolorbox{red}{aqua}{\underline{\pink{✯Answer✯}}}}}}}}}$

Explanation:

queue is your answer mate tq

stay home stay safe ✌☺