Data Structure Questions and Answers-Directed Graph

 

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

Data Structure Questions and Answers-Directed Graph

Question 1
Dijkstra's Algorithm will work for both negative and positive weights?
A
True
B
False
Data interpretation (DI) Questions answers
Question 1 Explanation: 
Dijkstra's Algorithm assumes all weights to be non-negative.

Question 2
A graph having an edge from each vertex to every other vertex is called a .....
A
Tightly Connected
B
Strongly Connected
C
Weakly Connected
D
Loosely Connected
UPSC GS Questions answers
Question 2 Explanation: 
This is a part of the nomenclature followed in Graph Theory.

Question 3
What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?
A
2
B
4
C
5
D
9
Reading comprehension Questions answers
Question 4
Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of .....
A
O(V*V)
B
O(V*V*V)
C
O(E*V)
D
O(E*E)
ICT Questions answers
Question 4 Explanation: 
The Algorithm uses Dynamic Programming and checks for every possible path.

Question 5
All Graphs have unique representation on paper.
A
True
B
False
UPSC GS Questions answers
Question 5 Explanation: 
Same Graph may be drawn in different ways on paper.

There are 5 questions to complete.

 

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