- 11. What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored in form of adjacency list and binary heap is used ?
-
filter_dramaExplanationAnswer is : C
None. - 12. Maximum degree of any vertex in a simple graph of vertices n is
-
filter_dramaExplanationAnswer is : D
None. - 13. If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is ?
-
filter_dramaExplanationAnswer is : D
None. - 14. A directed graph is
-
filter_dramaExplanationAnswer is : B
None. - 15. State 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. -
filter_dramaExplanationAnswer is : B
None. - 16. State True or False.i) An undirected graph which contains no cycles is called forest.ii) A graph is said to be complete if there is an edge between every pair of vertices.
-
filter_dramaExplanationAnswer is : A
None. - 17. A graph is said to be
-
filter_dramaExplanationAnswer is : B
None. - 18. A graph is a collection of nodes, called
-
filter_dramaExplanationAnswer is : A
None. - 19. A
-
filter_dramaExplanationAnswer is : C
None. - 20. A
-
filter_dramaExplanationAnswer is : A
None. -
Rahul Kumar
191 Points
-
VIKRAM JEET
54 Points
-
GEETHIKA CHOWDARY
53 Points
-
sunita saini
52 Points
-
Zain
49 Points
Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightGraphs
Graphs MCQs
leaderboardLeaderboard