## Help authour, Buy PDF Ebook
>>>**Click Here**<<<

## Data Structure Questions and Answers-Breadth First Search

## Click on any option to know the CORRECT ANSWERS

Question 1 |

Breadth First Search is equivalent to which of the traversal in the Binary Trees?

Pre-order Traversal | |

Post-order Traversal | |

Level-order Traversal | |

In-order Traversal |

**Economics Questions answers**

Question 1 Explanation:

The Breadth First Search Algorithm searches the nodes on the basis of level. It takes a node (level 0), explores it's neighbors (level 1) and so on.

Question 2 |

Time Complexity of Breadth First Search is? (V - number of vertices, E - number of edges)

O(V + E) | |

O(V) | |

O(E) | |

None of the mentioned |

**Economics Questions answers**

Question 2 Explanation:

The Breadth First Search explores every node once and every edge once (in worst case), so it's time complexity is O(V + E).

Question 3 |

The Data structure used in standard implementation of Breadth First Search is?

Stack | |

Queue | |

Linked List | |

None of the mentioned |

**GK Questions answers**

Question 3 Explanation:

The Breadth First Search explores every node once and put that node in queue and then it takes out nodes from the queue and explores it's neighbors.

Question 4 |

The Breadth First Search traversal of a graph will result into?

Linked List | |

Tree | |

Graph with back edges | |

All of the mentioned |

**Home science Questions answers**

Question 4 Explanation:

The Breadth First Search will make a graph which don't have back edges (a tree) which is known as Breadth First Tree.

Question 5 |

A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use?

Depth First Search | |

Breadth First Search | |

Trim's algorithm | |

None of the mentioned |

**Puzzles Questions answers**

Question 5 Explanation:

This is the definition of the Breadth First Search. Exploring a node, then it's neighbors and so on.

There are 5 questions to complete.