What is Beaver Computational Thinking ?
The Beaver Computational Thinking Competition is part of the international Bebras initiative to introduce Computational Thinking to school students.
Bebras (which means “Beaver” in the Lithuanian language) has been held in more than 36 countries across the globe for more than 10 years. This will be the third Beaver competition held in Malaysia!
What is Computational Thinking?
Computational thinking, is a method of problem solving using computer science techniques. The Beaver competition is all about tasks that encourage students to think creatively and critically to solve problems using concepts from computational thinking.
Who is this for?
Beaver is suitable for all students within the age group! Participants do not need prior computer science or programming knowledge. There are 5 categories for students aged 6 to 19 (Year 1 to Form 6).
Q1 : Falling Ball (EASY)
A ball is placed at the top left corner of a maze. It falls down the maze from platform to platform until it reaches one of the slots at the bottom. The ball always moves in the same way. It starts by going to the right. Every time it falls from one platform to another, it changes direction. You can see an example on the left.
Which slot will the ball reach in the maze on the right?
Q2 : Folding Paper (MEDIUM)
A Beaver has developed special instructions for paper folding. These instructions can be used to explain how to fold a piece of paper with straight sides. One of the commands in this instruction is fold.
e = fold(a, b) means:
fold the piece of paper in a way that side ‘a’ is lying completely on side ‘b’. That way, you create a new side, the fold. This line is called ‘e’.
Please note that the paper remains on the table during folding, and that the length of side b is twice the length of side a.
How does the paper rectangle (a, b, c, d) look like after the execution of these three instructions?
e = fold(c, a); f = fold(c, d); g = fold(a, f)
Q3 : Zebra Tunnels (HARD)
There are two kinds of tunnels in Bebras Land. When beavers enter a black tunnel one after the other, they come out in reversed order. When beavers enter a white tunnel one after the other, when they come out, only the first and the last beavers are interchanged.
A beaver family goes through thess three tunnels:
In what order are they arranged when they come out of the last tunnel?