Scribd
Upload
475 views6 pages

Networks Part 1

Uploaded by

api-254501788
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
475 views6 pages

Networks Part 1

Uploaded by

api-254501788
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Ellill

this
The diagram below shows a map of the roads between four towns,
F, G, H and I
G
A network diagram that represents all the connections between the
four towns on the map is
< VCAA 2004 FM Exam 1
Module 5 Q4
Examiner says
26% answered correctly
225
ExamBusters Further Maths 3 & 4
< VCAA 2003 FM Exam 1
Module 5 Q4
Examiner says
62% answered correctly
The sum of the degrees of all the vertices m the network above is
A
B
C
D
E
6
7
8
15
16
< VCAA 2001 FM Exam 1
Module 5 Q1
I Examiner says
i 63% answered correctly
The sum of the degrees on the vertices of the graph above is
A 4
B 6
C 14
D 15
E16
The minimum number of edges for a graph with nine vertices to be
connected is
< VCAA 2000 FM Exam 1
Module 5 Q1
A 6
B 8
C 9
D 36
E72
Examiner says
51 % answered correctly
226
Examl
The adjacency matrix for the graph above with nodes as labelled is
A
"110 2
B
"0 10 2"
c
"0102
1111 10 11 0 0 11
0 110 0 10 0 0 0 0 0
2 1 0 1_ 2 1 0 0 0 0 0 0
D
"3 0 0 0"
E
"1 0 0 0^
0 3 0 0 0 2 0 0
0 0 10 0 0 3 0
0 0 0 3 0 0 0 4
A VCAA 2001 FM Exam 1
Module 5 Q6
Examiner says
78% answered correctly
6 A connected planar graph of 15 edges divides the plane into eight
distinct regions
The number of vertices m this graph is
A 3
B 7
C 9
D 23
E25
7 Euler's formula
v +/= e + 2
for certain types of planar graphs, relates the number of edges m the
graph, e, to the number of vertices, v, and the number of regions,/,
defined by these planar graphs
For this rule to apply, the graph needs to be
A a spanning tree
B bipartite
C complete
D connected
Esimple
8 A connected graph with 12 vertices divides the plane into seven
regions The number of edges connecting the vertices m this
graph will be
A 7
B 17
C 19
D 21
E84
< VCAA 2002 FM Exam 1
Module 5 Q1
Examiner says
76% answered correctly
A VCAA 2001 FM Exam 1
Module 5 Q4
Examiner says
55% answered correctly
A VCAA 2000 FM Exam 1
Module 5 Q4
Examiner says
64% answered correctly
227
Examl
all
of odd
Example 4
< VCAA 2001 FM Exam 1
Module 5 Q2
j* Examiner says
89%answered correctly
%
For the graph above, which one of the following is a Hamiltonian circuitl1
A ABCDEFA
B ABEFDC
C ABFEDCA
D ABCDEFBA
E ACBDEFBA
Solution
A Hamiltonian circuit is a simple circuit that visits each vertex other than
the start/finish vertex exactly once
We can disregard option B because the starting and finishing vertices
are different Hence this is not a circuit
We can disregard options D and E because vertex B is visited twice
In option A, there is no direct connection between F and A, so this is not
a well-defined path (circuit)
The path ABFEDCA is a Hamiltonian circuit since it starts and ends at A
and visits every other vertex exactly once
Answer: C
Distractor: Discussed above
Student thinks
I need to find a path, starting
and ending at the same vertex
(i e a circuit), that passes
' through every other vertex
exactly once
Student thinks
^Look at each alternative m turn
Teacher says
A simple cncuit has no repeat
vertices other than the first and
last vertex
(Student thinks
In C we visit each vertex exactly
once and return to the starting
vertex (vertex A)
EM
Try this
1 In the network below, an Euler path can be created by adding one
newedge
T
< VCAA 2003 FM Exam 1
Module 5 Q3
Examiner says
59%answered correctly
OW
Adding which one of the following edges creates an Euler path^
A ST
B SU
C SX
I) XW
E ZT
231
ExamBusters Further Maths 3 & 4
To convert the network above to one that has an Eulenan circuit, we
could add an edge between
A A and C
B A and E
C B and E
D C and E
E D and E
D
For the graph above, it is possible to form an Euler path that
A starts at A and finishes at B
B starts at A and finishes at C
C starts at B and finishes at C
D starts at E and finishes at B
E starts at E and finishes at D
< VCAA 2001 FM Exam 1
Module 5 Q3
Examiner says
60%answered correctly
< VCAA 2000 FM Exam 1
Module 5 Q5
Examiner says
75%answered correctly
232
ExamBusters Further Maths 3 & 4
By inspection there are only 3 routes between Q and T, and listing them
all shows that the shortest route between Q and T is QUST The shortest
route is denoted by the bold lines m the above graph
QUST has length 4 + 7 +10 = 21 km
Answer: B
Distractor A: Possibly misreads question and tinds the shortest
connecting road to T, which is ST of length 10 km
Distractor C: QRSThas length8 + 5+10 = 23km
:fc 26% of students made this
'Try this
The network below shows the travel times, m minutes, along a series of ^ VCAA 2003 FM Exam 1
roads that connect a student's home to school Module 5 Q8
home
Examiner says
28% answered correctly
school
The shortest time, m minutes, for this student to travel from home to
school is
A 22
B 23
C 24
D 25
E 26
240

You might also like