1.  From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree. 
Answer: (a).en+1

2.  Minimum number of spanning tree in a connected graph is 
Answer: (c).1

3.  Find the odd out 
Answer: (c).FloydWarshall's All pair shortest path Algorithm

4.  The minimum number of edges required to create a cyclid graph of n vertices is 
Answer: (a).n

5.  What will be the runningtime 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 − 
Answer: (c).Ο(E+V log V)

6.  Maximum degree of any vertex in a simple graph of vertices n is 
Answer: (d).n  1

7.  If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is − 
Answer: (d).Ο(log (log n))

8.  A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. 
Answer: (b).Strongly Connected

9.  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. 
Answer: (b).True, True, False

10.  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. 
Answer: (a).True, True
