Graphs Questions

MCQ bookmark_border

81.

What are the dimensions of an incidence matrix?

A

Number of edges*number of edges

B

Number of edges*number of vertices

C

Number of vertices*number of vertices

D

None of the mentioned statements

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

82.

The column sum in an incidence matrix for a directed graph having no self loop is __________

B

1

C

2

D

equal to the number of edges

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

83.

Time complexity to check if an edge exists between two vertices would be ___________

A

O(V*V)

B

O(V+E)

C

O(1)

D

O(E)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

84.

The graphs G1 and G2 with their incidences matrices given are Isomorphic.

e1 e2 e3 e4 e5 e6
v1 1 0 0 0 0 0
v2 1 1 0 0 0 1
v3 0 1 1 0 1 0
v4 0 0 1 1 0 0
v5 0 0 0 1 1 1



e1 e2 e3 e4 e5 e6
v1 0 0 1 0 0 0
v2 1 0 1 0 1 0
v3 1 1 0 1 0 0
v4 0 1 0 0 0 1
v5 0 0 0 1 1 1

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

85.

If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix?

A

n-1

B

values greater than n are possible

C

values less than n-1 are possible

D

insufficient Information is given

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

86.

A Graph Structured Stack is a _____________

A

Undirected Graph

B

Directed Graph

C

Directed Acyclic Graph

D

Regular Graph

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

87.

If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?

A

Source

B

Source

C

Source

D

None of the Mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

88.

Graph Structured Stack finds its application in _____________

A

Bogo Sort

B

Tomita

C

Todd

D

All of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

89.

If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M.

A

1

C

May be

D

Can't say

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

90.

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

A

O(E)

B

O(V*V)

C

O(E+V)

D

O(V)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion