Data Structures Algorithms-II MCQs

Page No. 61

Which of the following data structure is used to implement DFS?


alinked list


btree


cstack


dqueue


View Answer stack

In BFS, how many times a node is visited?


aOnce


bTwice


cEquivalent to number of indegree of the node


dThrice



Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1)


aCan be anything


b0


c At most 1


dInsufficient Information


View Answer At most 1

When the Breadth First Search of a graph is unique?


aWhen the graph is a Binary Tree


bWhen the graph is a Linked List


cWhen the graph is a n-ary Tree


dWhen the graph is a Ternary Tree



Which of the following is not an application of Breadth First Search?


a Finding shortest path between two nodes


bFinding bipartiteness of a graph


c GPS navigation system


dPath Finding


View Answer Path Finding

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?


aDepth First Search


bBreadth First Search


cTrim’s algorithm


dKruskal’s algorithm


View Answer Breadth First Search

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


aLinked List


b Tree


cGraph with back edges


dArrays


View Answer Tree

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


aStack


bQueue


cLinked List


dTree


View Answer Queue

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


aO(V + E)


b O(V)


c O(E)


dO(V*E)


View Answer O(V + E)

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


aPre-order Traversal


bPost-order Traversal


cLevel-order Traversal


dIn-order Traversal


View Answer Level-order Traversal

Goto Page No.

Page 61 of 149

Alphabetical MCQs Categories

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan