91.  For some sparse graph an adjacency list is more space efficient against an adjacency matrix. 
Answer: (a).True

92.  Time complexity to find if there is an edge between 2 particular vertices is _________ 
Answer: (a).O(V)

93.  For the given conditions, which of the following is in the correct order of increasing space requirement? i) Undirected, no weight ii) Directed, no weight iii) Directed, weighted iv) Undirected, weighted 
Answer: (a).ii iii i iv

94.  Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________ 
Answer: (c).O(E)

95.  Complete the given snippet of code for the adjacency list representation of a weighted directed graph.

Answer: (c).neighbor, neighbor

96.  In which case adjacency list is preferred in front of an adjacency matrix? 
Answer: (b).Sparse graph

97.  To create an adjacency list C++’s map container can be used. 
Answer: (a).True

98.  What would be the time complexity of the following function which adds an edge between two vertices i and j, with some weight ‘weigh’ to the graph having V vertices?

Answer: (a).O(1)

99.  Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components? 
Answer: (b).2

100.  Number of vertices with odd degrees in a graph having a eulerian walk is ________ 
Answer: (d).either 0 or 2
