NEW
Font size
S
M
L
XL
WorksheetsYear 12 Networks Chapter 14 Review
Total questions: 12
Worksheet time: 8mins
Name
Class
Date
1.
This is a?
a)
Network
b)
spanning tree
c)
shortest path graph
2.
What is the shortest path from Bristol to London?
a)
125
b)
120
c)
115
d)
130
3.
What is the weight of the path AFGED?
a)
200
b)
230
c)
260
d)
290
4.
the minimum spanning tree include the following paths ...
a)
AB, BC, CD, CF, FG
b)
AB, BC, CD, CE, EF, EG
c)
BC, CD, AD, CF, EF, EG
d)
AB, BC, CD, CF, EF, EG
5.
What is the number of edges in this network
a)
13
b)
10
c)
12
d)
9
6.
Is this a connected graph
a)
Yes
b)
No
7.
The number of vertices in this graph is
a)
4
b)
8
c)
5
d)
10
8.
J could be identified as
a)
Isolated Vertex
b)
A dot
c)
Isolated Edge
d)
Isolated deg
9.
a)
0 1 1 0
1 0 1 0
1 1 0 0
0 0 0 0
1 0 1 0
1 1 0 0
0 0 0 0
b)
1 1 0 0
0 0 0 0
0 1 0 1
0 1 0 1
0 0 0 0
0 1 0 1
0 1 0 1
c)
1 1 1 1
1 1 0 0
2 0 1 0
1 1 0 0
2 0 1 0
d)
0 1 0 1
1 0 0 1
1 0 0 1
10.
Starting at town A, a man drives following an eulerian trail through the graph. His route must end at town
a)
B
b)
C
c)
D
d)
E
e)
F
11.
A planar graph has 6 faces and 14 edges. The number of vertices that the graph has is
a)
6
b)
10
c)
14
d)
18
e)
22
12.
Are these three Graphs Isomorphic (contain the same information)
a)
Yes
b)
No
Reset
