Graphs Questions

MCQ bookmark_border

91.

For some sparse graph an adjacency list is more space efficient against an adjacency matrix.

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

92.

Time complexity to find if there is an edge between 2 particular vertices is _________

A

O(V)

B

O(E)

C

O(1)

D

O(V+E)

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

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

A

ii iii i iv

B

i iii ii iv

C

iv iii i ii

D

i ii iii iv

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

94.

Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________

A

O(V)

B

O(E*E)

C

O(E)

D

O(E+V)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

95.

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

A

vertex, vertex

B

neighbor, vertex

C

neighbor, neighbor

D

vertex, neighbor

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

96.

In which case adjacency list is preferred in front of an adjacency matrix?

A

Dense graph

B

Sparse graph

C

Adjacency list is always preferred

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

97.

To create an adjacency list C++

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

98.

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?

A

1

B

2

C

3

D

4

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

99.

Number of vertices with odd degrees in a graph having a eulerian walk is ________

B

Can

C

2

D

either 0 or 2

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

100.

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

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion