adplus-dvertising
frame-decoration

Question

Which of the following uses FIFO method

a.

Queue

b.

Stack

c.

Hash Table

d.

Binary Search Tree

Answer: (a).Queue

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following uses FIFO method

Similar Questions

Discover Related MCQs

Q. In C programming, when we remove an item from bottom of the stack, then −

Q. What data structure can be used to check if a syntax has balanced parenthesis ?

Q. Stack is also called as

Q. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

Q. ……………. Is a pile in which items are added at one end and removed from the other.

Q. Which data structure allows deleting data elements from and inserting at rear?

Q. A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

Q. Which data structure is used in breadth first search of a graph to hold nodes?

Q. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

Q. In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.

Q. In a circular queue the value of r will be ..

Q. Which of the following statement is true?

i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.

ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5

Q. ………… is not the operation that can be performed on queue.

Q. Which of the following is not the type of queue?

Q. Which is/are the application(s) of stack

Q. A data structure where elements can be added or removed at either end but not in the middle is called …

Q. When does top value of the stack changes?

Q. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

Q. In a priority queue, insertion and deletion takes place at ………………