1.
TWO DISJOINT PATHS BETWEEN ANY TWO VERTICES IS AN PROPERTY OF_____________ GRAPH.
2.
TO CHECK THE ACYCLICITY OF THE DIRECTED GRAPH _____________FIRST SEARCH IS USED.
3.
IN _____________FIRST SEARCH THERE IS NO CONCEPT OF BACKTRACKING.
4.
IN BFS,THE TIME COMPLEXITY IS____________CRITICAL AS COMPARED TO TIME COMPLEXITY.
5.
DFS REQUIRES ______________ TIME FOR TRAVERSAL.
6.
DIJIKSTRA'S ALGORITHM DEPLOYS _______________ APPROACH.
7.
A ___________ GRAPH IS A GRAPH IN WHICH THERE IS A SMALL NUMBER OF EDGES.
8.
IN ____________ THE LEAF NODES ARE LINKED TOGETHER.
9.
____________IS AN EXAMPLE FOR MULTIWAY REPRESENTATION.
10.
CRITICAL PATH ANALYSIS IS AN APPLICATION OF _____________ SORTING.
11.
THE NUMBER OF EDGES INCIDENT ON A VERTEX DETERMINES ITS__________.
12.
TOPOLOGICAL SORTING IS NOT POSSIBLE IF THE GRAPH IS NOT____________.
13.
MST IS THE SPANNING TREE WHERE THE COST IS ______________AMONG ALL THE SPANNING TREE.
14.
KRUSKAL'S ALGORITHM PREFERS ___________ DATA STRUCTURE.
15.
_____________WORKS ON CONNECTED GRAPH AS WELL AS IT GIVES CONNECTED COMPONENT.
16.
_______________ALGORITHM STARTS TO BUILT THE MST FROM THE VERTEX CARRYING MINIMUM WEIGHT IN THE GRAPH.
17.
BTREE IS A _____________BALANCING TREE.
18.
A GRAPH IS NOT BICONNECTED IF _______________POINT IS PRESENT.
19.
DESIGN OF NETWORKS IS AN APPLICATION OF_______________.
20.
TOPOLOGICAL SORTING IS MAINLY USED FOR______________.
