Graphs
Quizsummary
0 of 8 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
Information
Tricky questions on Graph data structure.
You must specify a text. 

You must specify an email address. 
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 8 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
 Not categorized 0%
 1
 2
 3
 4
 5
 6
 7
 8
 Answered
 Review

Question 1 of 8
1. Question
1 pointsTo implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:
Correct
Incorrect
The shortest path in an unweighted graph means the smallest number of edges that must be traversed in order to reach the destination in the graph. This is the same problem as solving the weighted version where all the weights happen to be 1. If we use Queue (FIFO) instead of Priority Queue (Min Heap), we get the shortest path in linear time O(V + E). Basically we do BFS traversal of the graph to get the shortest paths.

Question 2 of 8
2. Question
1 pointsA graph is a collection of nodes, called __________. And line segments called arcs or _________ that connect pair of nodes.
Correct
Incorrect

Question 3 of 8
3. Question
1 pointsState True of False.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair of vertices.
Correct
Incorrect

Question 4 of 8
4. Question
1 pointsIn the ___________ traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
Correct
Incorrect

Question 5 of 8
5. Question
1 pointsA vertex of degree one is called
Correct
Incorrect

Question 6 of 8
6. Question
1 pointsWhich of the following statement is true ?
Correct
Incorrect

Question 7 of 8
7. Question
1 pointsA connected graph T without any cycles is called
Correct
Incorrect

Question 8 of 8
8. Question
1 pointsIn a graph if e=[u, v], Then u and v are called
Correct
Incorrect