## 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?

True | |

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 .....

Tightly Connected | |

Strongly Connected | |

Weakly Connected | |

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?

2 | |

4 | |

5 | |

9 |

**Reading comprehension Questions answers**

Question 4 |

Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of .....

O(V*V) | |

O(V*V*V) | |

O(E*V) | |

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.

True | |

False |

**UPSC GS Questions answers**

Question 5 Explanation:

Same Graph may be drawn in different ways on paper.

There are 5 questions to complete.