Graphs Questions

MCQ bookmark_border

101.

All paths and cyclic graphs are bipartite graphs.

A

1

C

May be

D

Can't say

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

102.

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

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

103.

All trees with n vertices consists of n-1 edges.

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

104.

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)

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

105.

Dijkstra

A

1

C

May be

D

Can't say

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

106.

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

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

107.

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

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

108.

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)

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

109.

All Graphs have unique representation on paper.

A

1

C

May be

D

Can't say

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

110.

Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?

A

add all values by 10

B

subtract 10 from all the values

C

multiply all values by 10

D

in both the cases of multiplying and adding by 10

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion