2024 Beaver Computing Challenge
(Grade 9 & 10)
Questions
2024 Beaver Computing Challenge
(Grade 9 & 10)
Questions
Beaver Robot can say sentences containing exactly 3 words.
Which sentence below cannot be said by Beaver Robot?
A baby’s rattle is made of a clear circular tube with colourful balls inside. When the baby shakes the rattle, some balls can move through the tube. An example of the rattle before and after it is shaken is shown.
While there is room for the balls to move, there isn’t room for one ball to move past another ball.
Which of the following could be the baby’s rattle after it has been shaken again?
A miracle plant seedling has a stem and two buds. It looks like
this: 
It takes one day for a bud to sprout a new stem and two new buds.
For example, two days after a seedling is planted, the miracle plant looks like this:
Over time, the miracle plant becomes quite large and magnificent. How many days ago was the seedling planted?
Luisa is typing a list of countries that border Argentina but her custom keyboard has malfunctioned. For most keys, when she presses the key, the character on the key to its right is displayed instead. The one exception is that when she presses the rightmost key in a row, the character on the leftmost key in that row is displayed.
For example, if she presses 
, then F is displayed. If she types 
, then # is displayed.
If Luisa wants to press keys so that BRAZIL is displayed, what keys should she press?
In the computer game Superbebras, the background and the illusion of motion is created using a sequence of tiles.
Tiles added to the right end of the sequence are chosen according to the rules in the diagram below. Arrows point directly from each tile to the only tile(s) that can be added immediately to the right of it.
For example, a tile immediately to the right of tile 
can only be tile
or tile 
.
Which of the following images is not a possible Superbebras background?
At the Hardwood Library, there is usually a long line of beavers waiting for the librarian to help them return their books. At this particular library, book returns are processed by quantity. That is, the beaver with the fewest books to return is helped first.
The librarian can process one book per minute. After processing all of the books returned by a particular beaver, the librarian next helps the beaver waiting in line with the fewest books to return.
One morning, five beavers come to the library to return their books. Their time of arrival and their number of books are shown in the table:
| Name | Time of Arrival | Number of Books |
|---|---|---|
| Luciano | 9:00 | 4 |
| Rui | 9:02 | 6 |
| Cene | 9:03 | 3 |
| Manuel | 9:05 | 4 |
| Priscilla | 9:12 | 1 |
Luciano arrives right when the library opens, so the librarian processes Luciano’s books first.
In which order will the beavers be helped?
A magician can transform one type of fruit into another. The magical
transformations are denoted by M. The fruit that the
transformation is applied to is put inside brackets and the fruit that
the transformation produces is put on the right after an equals sign.
Six magical transformations are shown in the table below. For example,
the top-left entry in the table describes a magical transformation that
can be applied to an 
to produce a 
.
)=)=
)=
)=
)=)=Transformations can be combined. For example, since we know
M()=
we can write the following combined transformation:
M(M())=M()=
What fruit is produced by the following combined magical transformation?
)))))
Rory is making Bebracelets. He takes numbered beads from a tube, one at a time. For each bead, he is allowed to put it on the string if:
the string is empty, or
the number on the bead is larger than the number on the last bead put on the string.
For each bead that Rory is allowed to put on the string, he then chooses whether to put it on the string or discard it. For example, if bead 2 is the last bead on the string, and bead 5 is the next bead from the tube, then Rory may put bead 5 on the string or discard it.
Now, Rory is making a new bracelet from the beads in this tube:
What is the largest number of beads that Rory can put on the string?
Hermit crabs wear shells in order to protect themselves. As hermit crabs grow, their shells become too small and the hermit crabs need to look for larger shells to wear.
An assortment of new shells has just been washed ashore. Several hermit crabs have gathered to try on these new shells. In the following diagram, the letters represent the hermit crabs and the numbers represent the new shells. A single line connecting a letter to a number means that the hermit crab has determined that the shell is a good fit. If there is no line connecting a letter to a number then the hermit crab has determined that the shell is not a good fit.
If a shell can only be worn by one hermit crab, and a hermit crab can only wear one shell, then what is the maximum number of hermit crabs that can wear one of these new shells?
In the land of Bebravia, there are six towns. All food is grown in Quandaria and transported by train to the other towns. The train routes are indicated by lines drawn between towns in the diagram. The arrow on each line indicates the direction in which trains carrying food are allowed to move.
Bebravia is not large so there is more than enough time for many trains to travel between any two towns. The only limitation is the daily capacity on each train route: the number on each line indicates the maximum number of trains that can travel along that route on one day.
In one day, what is the largest number of trains that can travel from Quandaria to Pixleton?
Five types of cards are labelled with the letters \(P\), \(Q\), \(R\), \(S\), and \(T\) on one side. On the opposite sides, the cards are labelled with exactly one of the numbers 1, 2, 4, 8, and 16, in some random order. For each letter, all cards with that letter have the same number on the opposite side (e.g. all cards with \(P\) on one side have the same number on the opposite side.)
Multiple copies of each type of card are gathered to form a deck. Fala, Grace, and Hari each draw the smallest possible number of cards from the deck so that the numbers on their cards add up to their own age.
Fala is 17 years old. One of the cards she is holding has an \(R\) on it.
Grace is 18 years old. One of the cards she is holding has a \(Q\) on it. Another card she is holding is the same type as one of Hari’s cards.
Hari is 15 years old. He is the only one holding a card with a \(P\) on it. The largest number on a card he is holding has a \(T\) on the opposite side.
Which number is on the cards that have the letter \(S\) on them?
Captain Bojana is looking for a treasure hidden on an island. The island is divided into 16 regions, each marked with a letter from A to P as shown.