A queue follows ……….. .
एक क्यू ……….. का अनुसरण करती है।
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. FIFO (First In First Out) principleफीफो (फर्स्ट इन फर्स्ट आउट) सिद्धान्त
Explanation
A queue is First In First Out — the element inserted first is removed first.
क्यू FIFO सिद्धांत पर चलती है — पहले डाला गया तत्व पहले निकलता है।
More Data Structures questions
- Process of inserting an element in stack is called :
- If the elements 'A', 'B', 'C' and 'D' are placed in a queue and are deleted one at a time, in what order will these elements be removed ?
- In a stack, if a user tries to remove an element from an empty stack, it is called :
- A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear), is…
- Which of the following recurrence relation is related to worst case time complexity of quick sort ?
- In directed graph G(V, E) where V = {P, Q, R, S, T} and E = {PQ, RS, TP, PS, QR, PT, ST, QP, RQ, TS}, the vertex with maximum in- degree is…