Intermediate AMC Questions

A u s t r a l i a n M a t h e ma t i c s T r u s t
2012 Australian Mathematics Trust
Australian Informatics Competition Sample Question Set 1 Intermediate

These questions are based on questions from past AIC papers. The data in the questions has been changed, so the answers will be different. In all other respects, the questions are the same. AIC papers have two parts. Part A consists of 6 multiple choice questions. Part B questions have integer answers, and in each question students apply their solutions to three sets of data. A book of 2005-2010 past questions, with answers and solutions is available for purchase on the AMT website www.amt.edu.au.
Australian Informatics Competition : Sample questions, Set 1
Intermediate Questions: Part A

Each question should be answered by a single choice from A to E. Questions are worth 3 points each. 1. Evacuation 2006 I.3 Your school is preparing for its annual re drill. Each building in the school consists of a grid of classrooms, with the top-left classroom left empty. Each time the clock ticks another second, students may leave classrooms according to the following rules: If a classroom is adjacent to an empty room (or possibly several empty rooms), one and only one student may leave. This student leaves the building immediately (they do not spend any time walking through the empty rooms). If a classroom is not adjacent to any empty rooms, no students may leave. Note that you can never have several students leaving a room at the same time (even if the room is adjacent to several different empty rooms). Rooms are only adjacent horizontally or vertically, not diagonally. An example of a 2 3 grid of classrooms is shown below, with the initial numbers of students on the left hand side. It can be seen that the entire building is evacuated after four seconds.
0 1 1 2 3 1 0 0 0 2 3 1 0 0 0 1 2 1 0 0 0 0 1 1 0 0 0 0 0 0
Your building is slightly larger a 4 4 grid of classrooms, as illustrated below. How many seconds does it take to evacuate your building? 0 1 4 3 (A) 11 (B) 13 2 4 2 1 5 3 5 4 3 2 4 2 (D) 15 (E) 45
(C) 14
2. Rising Sequences 2006 I.2 A rising sequence is a list of numbers where each number is greater than the sum of all the numbers before it. For example, 1, 2, 4, 12, 22 is a rising sequence because 1 < 2, 1 + 2 < 4, 1 + 2 + 4 < 12 and 1 + 2 + 4 + 12 < 22. On the other hand, 1, 2, 4, 6, 17 is not a rising sequence because 1 + 2 + 4 < 6. You are given the following list of numbers: 3, 5, 8, 11, 25, 30, 45, 50, 60, 95. Your task is to form the longest possible rising sequence using numbers from this list. How many numbers are in your rising sequence? (A) 4 (B) 5 (C) 6 (D) 7 (E) 8
3. Dungeon 2005 I.6 A token (marked X in the diagram) is in a maze. You may move the token around according to the following rule: in each move the token may travel any distance either horizontally or vertically, but it cannot pass over or stop on a shaded square.
For example, from its starting position the token could travel either one square left, one square right, or one square down in a single move. To reach any other square would require more than one move. What is the minimum number of moves that you need to ensure that the token can reach any white square from its starting position? (A) 8 (B) 9 (C) 10 (D) 11 (E) 12
4. SMS Payments 2009 I.4, S.2 The footy season is over, the bets have been added up and it is time for settling the debts. The members of the tipping competition are scattered over Australia, so they decide to use SMS payments. SMS payments charge 1% of the amount for each transfer, and the tippers deem it a point of honour to pay as little as possible in charges. For instance, transferring $10 from A to B and $10 from B to C would cost 20, but the same result could be achieved by transferring $10 from A to C for a total charge of 10. The actual amounts owed to each other by the tippers were: Ann owed $4 to Bob and $2 to Col Bob owed $5 to Eric Col owed $6 to Eric Don owed $7 to Bob and $5 to Col Eric owed $3 to Don What is the smallest amount of SMS charges possible in settling all debts? (A) 10 (B) 15 (C) 25 (D) 26 (E) 32
Intermediate Questions: Part B

Each question should be answered by a number in the range 0999. Questions are worth 2 points each. 57. Escape 2008 I.10-12 3 The escape has been planned but the prisoners have the wrong instructions. The prisoner in cell 1 should have instructions A, and the prisoner in cell 2 should have instructions B, and so on. Each day there is an opportunity for prisoners in adjacent cells to swap instructions, but more than one swap per day would be too risky. For instance if the instruction order was CDBA, it would take 5 days of swapping to get to the correct order ABCD. For each of the following orders, how many days of swapping would it take to get the correct instructions to every prisoner? 5. 6. 7. DCBAHGFE GHIDEFABC DHJIABFECG
810. Spiral Amoeba 2010 I.13-15, S.10-12 3 The DNA of the spiral amoeba is laid down in a spiral pattern. The second base is placed directly above the rst and subsequent bases are added clockwise. (DNA is made up of bases A C G and T.) For example, the DNA sequence A C G T G T A C would be laid down as follows: A C A CG A CG AT ... CG CAT ATG
A mutant base M has inltrated the DNA of the spiral amoeba, and scientists are concerned to nd its location in the DNA sequence. However, they can only read the sequence row by row from top to bottom, and within each row from left to right. So in the example above the reading of the sequence would be C G C A T A T G. For each of the readings of DNA sequences below, what is the position of the M base in the original DNA sequence? 8. 9. 10. M A C T G G C A T A G C T T G C A T T M T G C A G C A T M C C G G

Intermediate AMC Questions

Uploaded by

Copyright:

Available Formats

Intermediate AMC Questions

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Intermediate AMC Questions

Uploaded by

Copyright:

Available Formats

A u s t r a l i a n M a t h e ma t i c s T r u s t

2012 Australian Mathematics Trust

Australian Informatics Competition Sample Question Set 1 Intermediate

Australian Informatics Competition : Sample questions, Set 1

Intermediate Questions: Part A

Australian Informatics Competition : Sample questions, Set 1

Australian Informatics Competition : Sample questions, Set 1

Australian Informatics Competition : Sample questions, Set 1

Intermediate Questions: Part B

Australian Informatics Competition : Sample questions, Set 1

You might also like