CAT Intermediate 2016
CAT Intermediate 2016
Intermediate
Years 9 & 10
(Australian school years)
Name:
INSTRUCTIONS
• Do not open the CAT paper until told to do so.
• Maintain silence at all times.
• Do not bring mobile phones into the room.
• You may use calculators and printed language dictionaries.
• You may NOT borrow equipment without a supervisor’s permission.
• There are 15 questions. Questions 1–6 are multiple-choice with five possible answers given.
Questions 7–15 require a three-digit answer. Attempt all questions. Penalties do not apply.
• You are allowed working time of one hour (60 minutes). There is no extra reading time.
• This is a competition not a test; do not expect to answer all questions.
• Diagrams are NOT drawn to scale. They are intended only as aids.
• The questions have been thoroughly checked. Each question stands as written. No further
explanation of questions can be provided.
• You must not leave your seat. If you have any other questions or problems, please raise your
hand and wait for a supervisor.
• If you wish to leave the room a supervisor must accompany you.
• Record all your answers on the answer sheet provided.
• Use B or 2B lead pencils only. Ball point and ink pen markings may not activate the optical scanner.
• Do not make any other marks on the answer sheet as these may make the sheet unreadable.
• If you make an error, use a plastic eraser to completely remove all lead marks and smudges.
• Check the number of the answer you are filling in is the same as the number of the question
you are answering. This is particularly important if you decide to leave a question blank.
• To ensure the integrity of the CAT and to identify outstanding students, the AMT reserves
the right to re-examine students before deciding whether to grant official status to their score.
© 2016 AMT Publishing amtt limited acn 083 950 341
Computational and Algorithmic Thinking 2016 (Intermediate) 1
1. Fractal Circles
The first three fractal circles contain 1, 4 and 13 circles.
2. Star Distances
An ant has to get from the centre of the star to one of its tips. It can only walk along the
line segments shown in the diagram below. Each segment has a number on it, and the
ant adds up all the numbers on its path. What is the smallest sum that the ant can make
on its way from the centre to one of the tips?
6 3
8 5
6 5
5 6
3
7 7
2 1
3 5
3 2
5 6
4 5
6 6
7 5
3. Coded Message
A coded message consisting of a string of As, Bs, Cs and Ds undergoes a final transfor-
mation before being transmitted.
• each A is replaced by 1 0 1
• each B is replaced by 1 1 0 0
• each C is replaced by 0 1 1 0
• each D is replaced by 1 1 0
4. Computer Glitch
A computer sent a string of ♥s and ♠s over the internet. But at some point during
transmission there was a glitch, and from that point all of the ♥s became ♠s and all of
the ♠s became ♥s.
Before being transmitted, the string contained 12 ♥s and 12 ♠s. After transmission it
contained 10 ♥s and 14 ♠s as shown below.
♠ ♠ ♠ ♥ ♠ ♥ ♥ ♥ ♥ ♠ ♠ ♠ ♥ ♥ ♠ ♠ ♥ ♥ ♠ ♠ ♠ ♠ ♠ ♥
In how many places could the glitch have occurred?
5. Where to Start
A numbers game requires that you choose a starting point in a list of numbers. Starting
from 0, you add this number, subtract the next, and continue adding and subtracting
until you reach the end of the list.
For example, consider the list
843521
If you started with the 8, your total would be 8 − 4 + 3 − 5 + 2 − 1 = 3,
whilst if you started with the 5, your total would be 5 − 2 + 1 = 4.
For the list
7685941763
what is the largest total you could get?
6. Art Gallery
The director of an art gallery wishes to rearrange some paintings to make the display
more interesting. Twelve paintings hang in a line along a gallery wall. At the moment
the first four are by Streeton, the next four by Withers and the last four by Roberts. The
director has decided to rearrange them so that as you progress along the wall you see
four cycles: each consisting of one artwork by Streeton, one by Withers and then one
by Roberts.
However, the paintings are fragile. Each painting can only be moved once per day. Even
then it can only be swapped with one of the paintings on either side of it.
What is the minimum number of days needed to rearrange the paintings to satisfy the
director?
3 3
2 2
1
1
How many cubic metres of water will each of the following water troughs hold?
(The numbers represent the heights in metres of the baffles.)
7. 9684623
8. 936845742
9. 9536457368
Computational and Algorithmic Thinking 2016 (Intermediate) 5
no
Is A > 10? Add 4 to A
yes
Output A
For each of the following diagrams, what is the value of the output?
10.
Input A = 10, B = 44
yes
Is B > A? Subtract A from B
no
Output B
Note that if A was 2 and B was 6, then ‘Subtract A from B’ would make B
equal to 4 but leave A unchanged at 2.
11.
Input A = 43, B = 10, C = 0
no
Is A < B? Subtract B from A, add 1 to C
yes
Output C
Computational and Algorithmic Thinking 2016 (Intermediate) 6
12.
Input A = 6, B = 10
no no
no yes
Is A = 0? Is A > B? Is B = 0?
yes yes
Output B Output A
13. 4543643
14. 54336251
15. 54336251522
2016 CAT Answers
Question Intermediate
1 B
2 C
3 C
4 E
5 E
6 B
7 34
8 51
9 72
10 4
11 4
12 2
13 11
14 13
15 16
Get ready with
GetSet CAT
and
GetSet AMC
Intermediate
GetSet CAT and GetSet AMC are the best online training
programs available to prepare for the Computational and
Algorithmic Thinking (CAT) competition and the Australian
Mathematics Competition (AMC).
GetSet provides self-paced, online courses designed to
help students of all levels prepare effectively for the these
competitions. The courses consist of a collection of problem
sets and mock contests to be solved in a recommended
sequence.
All problem sets and mock contests are auto-graded and
students are presented with a comprehensive performance
report with suggested areas for improvement.
$6.00 per person allows access for 6 months to either
GetSet CAT or GetSet AMC. Schools can purchase the
program for a discounted price per student, available in the
same order as CAT or AMC competition entries.
To learn more visit the official site of the GetSet training at
amt.edfinity.com
Go