Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

DMU6D2 Skill Check Spanning Trees and MSTs

Total questions: 15

Worksheet time: 8mins

Name
Class
Date
1.

Which of the following is spanning tree of the shown network

a)

ABCD

b)

ABCBDE

c)

AC

d)

ECDAB

2.

What is the redundancy of the shown network

a)

3

b)

5

c)

6

d)

4

3.

What is the largest degree of separation between a pair of vertices in the shown network

a)

0

b)

1

c)

2

d)

3

4.

Find a spanning tree of this network.

a)

This network does not have a spanning tree.

b)

CABDEGI

c)

This network is a spanning tree.

d)

CABDEGJ

5.

Calculate the redundancy of this network

a)

0

b)

1

c)

2

d)

3

6.

What is the largest degree of separation between a pair of vertices in this network?

a)

3

b)

4

c)

5

d)

6

7.

Which of the following links has to be in a spanning tree of this network?

a)

AC

b)

DI

c)

DE

d)

IE

8.

Which of the following links has to be in a spanning tree of this network?

a)

CD

b)

DJ

c)

DI

d)

JE

9.

Which of the following links has to be in a spanning tree of this network?

a)

IJ

b)

DL

c)

KE

d)

HF

10.

How many spanning trees does this network have?

a)

1

b)

2

c)

3

d)

4

11.

How many spanning trees does this network have?

a)

1

b)

2

c)

3

d)

4

12.

How many spanning trees does this network have?

a)

1

b)

2

c)

3

d)

4

13.

How many spanning trees does this network have?

a)

12

b)

2

c)

3

d)

6

14.

How many spanning trees does this network have?

a)

3

b)

8

c)

18

d)

54

15.

What is the longest possible degree of separation of two vertices on all possible spanning trees?

a)

5

b)

7

c)

6

d)

4