Graphs Questions

MCQ bookmark_border

121.

What is time complexity to check if a string(length S1) is a substring of another string(length S2) stored in a Directed Acyclic Word Graph, given S2 is greater than S1?

A

O(S1)

B

O(S2)

C

O(S1+S2)

D

O(1)

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

122.

In which of the following case does a Propositional Directed Acyclic Graph is used for?

A

Representation of Boolean Functions

B

String Matching

C

Searching

D

Sorting of number

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

123.

Every Binary Decision Diagram is also a Propositional Directed Acyclic Graph.

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

124.

In a Propositional Directed Acyclic Graph Leaves maybe labelled with a boolean variable.

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

125.

All undirected Multigraphs contain eulerian cycles.

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

126.

Determine the number of vertices for the given Graph or Multigraph?G is a 4-regular Graph having 12 edges.

A

3

B

6

C

4

D

Information given is insufficient

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

127.

Which of the following statement is true.

A

There exists a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9

B

There exists a MultiGraph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9

C

There exists a MultiGraph as well as a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

128.

Given Adjacency matrices determine which of them are PseudoGraphs?
i) {{1,0} {0,1}}

ii) {{0,1}{1,0}}

iii) {{0,0,1}{0,1,0}{1,0,0}}

A

only i)

B

ii) and iii)

C

i) and iii)

D

i) ii) and iii)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

129.

Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

A

3, Infinite, 4

B

4, 3, Infinite

C

4, Infinite

D

4, Infinite, Infinite

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

130.

Which of the following is a HyperGraph, where V is the set of vertices, E is the set of edges?

A

V = {v1, v2, v3} E = {e1, e2} = {{v2, v3} {v1, v3}}

B

V = {v1, v2} E = {e1} = {{v1, v2}}

C

V = {v1, v2, v3} E = {e1, e2, e3} = {{v2, v3}{v3, v1}{v2, v1}}

D

All of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion