adplus-dvertising
101. How many of the following statements are correct?
i) All cyclic graphs are complete graphs.

ii) All complete graphs are cyclic graphs.

iii) All paths are bipartite.

iv) All cyclic graphs are bipartite.

v) There are cyclic graphs which are complete.
a. 1
b. 2
c. 3
d. 4
Answer: (b).2

102. All paths and cyclic graphs are bipartite graphs.
a. True
b. False
c. May be
d. Can't say
Answer: (b).False

103. What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
a. n-2
b. n
c. 2
d. 0
Answer: (a).n-2

104. All trees with n vertices consists of n-1 edges.
a. True
b. False
c. May be
d. Can't say
Answer: (a).True

105. What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
a. O(E*E)
b. O(V*V)
c. O(E)
d. O(V)
Answer: (b).O(V*V)

106. Dijkstra’s Algorithm will work for both negative and positive weights?
a. True
b. False
c. May be
d. Can't say
Answer: (b).False

107. A graph having an edge from each vertex to every other vertex is called a ___________
a. Tightly Connected
b. Strongly Connected
c. Weakly Connected
d. Loosely Connected
Answer: (a).Tightly Connected

108. What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?
a. 2
b. 4
c. 5
d. 9
Answer: (b).4

109. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________
a. O(V*V)
b. O(V*V*V)
c. O(E*V)
d. O(E*E)
Answer: (b).O(V*V*V)

110. All Graphs have unique representation on paper.
a. True
b. False
c. May be
d. Can't say
Answer: (b).False