VCE General Maths Networks and Decision Mathematics 2019 Exam 1 Mini Test
VCAA General Maths Exam 1
This is the full VCE General Maths Exam with worked solutions. You can also try Mini-Tests, which are official VCAA exams split into short tests you can do anytime.
Number of marks: 8
Reading time: 3 minutes
Writing time: 18 minutes
Instructions
• Answer all questions in pencil on your Multiple-Choice Answer Sheet.
• Choose the response that is correct for the question.
• A correct answer scores 1; an incorrect answer scores 0.
• Marks will not be deducted for incorrect answers.
• No marks will be given if more than one answer is completed for any question.
• Unless otherwise indicated, the diagrams in this book are not drawn to scale.
Networks and decision mathematics - 2019 (Part 1)
Module 2 – Networks and decision mathematics
Question 1In the graph shown above, the sum of the degrees of the vertices is
- A. 5
- B. 6
- C. 10
- D. 11
- E. 12
Consider the graph below.
The minimum number of extra edges that are required so that an Eulerian circuit is possible in this graph is
- A. 0
- B. 1
- C. 2
- D. 3
- E. 4
The flow of water through a series of pipes is shown in the network below.
The numbers on the edges show the maximum flow through each pipe in litres per minute.
The capacity of Cut Q, in litres per minute, is
- A. 11
- B. 13
- C. 14
- D. 16
- E. 17
Two graphs, labelled Graph 1 and Graph 2, are shown below.
Which one of the following statements is not true?
- A. Graph 1 and Graph 2 are isomorphic.
- B. Graph 1 has five edges and Graph 2 has six edges.
- C. Both Graph 1 and Graph 2 are connected graphs.
- D. Both Graph 1 and Graph 2 have three faces each.
- E. Neither Graph 1 nor Graph 2 are complete graphs.
The following diagram shows the distances, in metres, along a series of cables connecting a main server to seven points, \(A\) to \(G\), in a computer network.
The minimum length of cable, in metres, required to ensure that each of the seven points is connected to the main server directly or via another point is
- A. 175
- B. 203
- C. 208
- D. 221
- E. 236
The map below shows all the road connections between five towns, \(P, Q, R, S\) and \(T\).
The road connections could be represented by the adjacency matrix
A project involves nine activities, \(A\) to \(I\).
The immediate predecessor(s) of each activity is shown in the table below.
| Activity | Immediate predecessor(s) |
|---|---|
| A | – |
| B | A |
| C | A |
| D | B |
| E | B, C |
| F | D |
| G | D |
| H | E, F |
| I | G, H |
A directed network for this project will require a dummy activity.
The dummy activity will be drawn from the end of
- A. activity \(B\) to the start of activity \(C\).
- B. activity \(B\) to the start of activity \(E\).
- C. activity \(D\) to the start of activity \(E\).
- D. activity \(E\) to the start of activity \(H\).
- E. activity \(E\) to the start of activity \(F\).
The directed network below shows the sequence of activities, \(A\) to \(S\), that is required to complete a manufacturing process.
The time taken to complete each activity, in hours, is also shown.
The number of activities that have a float time of 10 hours is
- A. 0
- B. 1
- C. 2
- D. 3
- E. 4
End of Multiple-Choice Question Book
VCE is a registered trademark of the VCAA. The VCAA does not endorse or make any warranties regarding this study resource. Past VCE exams and related content can be accessed directly at www.vcaa.vic.edu.au
