Graphs Questions

MCQ bookmark_border

1.

In a graph if e=[u, v], Then u and v are called

A

endpoints of e

B

adjacent nodes

C

neighbors

D

all of above

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

2.

A connected graph T without any cycles is called

A

a tree graph

B

free tree

C

a tree

D

All of above

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

3.

In a graph if e=(u, v) means

A

u is adjacent to v but v is not adjacent to u

B

e begins at u and ends at v

C

u is processor and v is successor

D

both b and c

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

4.

. If every node u in G is adjacent to every other node v in G, A graph is said to be

A

isolated

B

complete

C

finite

D

strongly connected

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

5.

Identify the correct problem for multistage graph from the list given below.

A

Resource allocation problem

B

Traveling salesperson problem

C

Producer consumer problem

D

Barber

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

6.

. Identify the correct problem for multistage graph from the list given below.

A

Resource allocation problem

B

Traveling salesperson problem

C

Producer consumer problem

D

Barber

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.

A

e-n+1

B

n-e+1

C

n+e-1

D

e-n-1

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

8.

Minimum number of spanning tree in a connected graph is

A

n

B

n(n - 1)

C

1

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

9.

Find the odd out

A

Prim's Minimal Spanning Tree Algorithm

B

Kruskal's Minimal Spanning Tree Algorithm

C

Floyd-Warshall's All pair shortest path Algorithm

D

Dijkstra's Minimal Spanning Tree Algorithm

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

The minimum number of edges required to create a cyclic graph of n vertices is

A

n

B

n+1

C

n-1

D

2n

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion