Graphs Questions

MCQ bookmark_border

71.

On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?

A

Depends on the number of edges

B

Depends on the number of vertices

C

Is independent of both the number of edges and vertices

D

It depends on both the number of edges and vertices

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

72.

Which of these adjacency matrices represents a simple graph?

A

[ [1, 0, 0], [0, 1, 0], [0, 1, 1] ]

B

[ [1, 1, 1], [1, 1, 1], [1, 1, 1] ]

C

[ [0, 0, 1], [0, 0, 0], [0, 0, 1] ]

D

[ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

73.

Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], how many ways are there in which a vertex can walk to itself using 2 edges.

A

2

B

4

C

6

D

8

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

74.

If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.

A

x=5, y=3

B

x=3, y=5

C

x=3, y=3

D

x=5, y=5

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

75.

Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

76.

Given the following program, what will be the 3rd number that

A

2

B

6

C

8

D

4

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

77.

For which type of graph, the given program would run infinitely? The Input would be in the form of an adjacency Matrix and n is its dimension (1

A

All Fully Connected Graphs

B

All Empty Graphs

C

All Bipartite Graphs

D

None of the Mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

78.

Given the following adjacency matrix of a graph(G) determine the number of components in the G. [0 1 1 0 0 0], [1 0 1 0 0 0], [1 1 0 0 0 0], [0 0 0 0 1 0], [0 0 0 1 0 0], [0 0 0 0 0 0].

A

1

B

2

C

3

D

4

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

79.

Incidence matrix and Adjacency matrix of a graph will always have same dimensions?

A

1

C

May be

D

Can't say

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

80.

The column sum in an incidence matrix for a simple graph is __________

A

depends on number of edges

B

always greater than 2

C

equal to 2

D

equal to the number of edges

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion