adplus-dvertising
frame-decoration

Question

What data structure is used for breadth first traversal of a graph?

a.

queue

b.

stack

c.

list

d.

none of the above

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. What data structure is used for breadth first traversal of a graph?

Similar Questions

Discover Related MCQs

Q. A queue data-structure can be used for −

Q. If locality is a concern, you can use _______ to traverse the graph.

Q. Aposterior analysis are more accurate than apriori analysis because −

Q. Prefix notation is also known as

Q. In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is

Q. If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?

Q. Queue data structure works on

Q. Which of the following uses FIFO method

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.