Skip to content / Đến nội dung
ThichHocToan.com

Question bank BEBRAS 2018

Exam papers

45 questions

Question 1

Benjamin fills each 3 × 3 grid with pictures so no row or column contains a repeated picture. He made a mistake in one grid. Which one?

Question illustration
  1. Grid A
  2. Grid B
  3. Grid C
  4. Grid D

Question 2

Peter helps his mother bake a cake. Her instructions are:
1. Add butter to the bowl.
2. Add sugar.
3. Repeat three times: add one egg, then mix the bowl thoroughly.

Which procedure follows these instructions?
  1. Add butter, add sugar, mix.
  2. Add butter, add sugar, add one egg, mix.
  3. Add butter, add sugar, add three eggs, mix.
  4. Add butter, add sugar, add one egg, mix, add another egg, mix, add another egg, mix.

Question 3

Two sizes of dogs stand in this order.

Question illustration

One swap exchanges two neighbouring dogs. What is the minimum number of swaps needed to make the three large dogs stand together?
  1. 5
  2. 6
  3. 7
  4. 8

Question 4

A car park has 12 spaces. These pictures show the occupied spaces on Monday and Tuesday.

Question illustration

How many spaces were unused on both days?
  1. 3
  2. 4
  3. 5
  4. 6

Question 5

Honomakato has islands Ho, No, Ma, Ka, To. A large cable joins the mainland to Ho. Smaller cables join Ho–No, Ho–Ka, Ka–Ma and Ka–To.

Question illustration

Which extra cables ensure every island keeps Internet access even if any one small cable breaks?
  1. Ho–To and No–Ma
  2. Ho–To and Ma–To
  3. Ka–No and No–Ma
  4. Two extra cables are not enough.

Question 6

The friendly beavers of Jeju leave messages for visiting neighbours using a special three-bar gate.

Question illustration

Four example messages are: I am home; I will return late; I will return soon; nobody is home.

Question illustration

Cheolsoo thinks more messages are possible by changing the bars. What is the largest number of messages?

Editorial reading of the examples: each of the three distinct bar positions can independently be across the gate or lowered at its free end.
  1. 4
  2. 6
  3. 8
  4. 10

Question 7

John wants to visit nine cities: Onecity, Twoland, Threecity, Fourland, Fivecity, Sixland, Sevencity, Eightland, Ninecity. Bus routes connect Threecity–Onecity, Ninecity–Twoland, Threecity–Ninecity, Ninecity–Onecity, Onecity–Twoland, Eightland–Ninecity, Sixland–Sevencity, Fivecity–Fourland and Fourland–Eightland. Starting at Threecity, which pair consists of cities he cannot visit?
  1. Onecity, Twoland
  2. Sixland, Sevencity
  3. Fourland, Ninecity
  4. Sevencity, Ninecity

Question 8

Zac starts at 1 and walks to 2; Pan starts at 2 and walks to 1. Letters B, E, R, A, S stand beside the path, but each beaver reads only letters on their left while walking.

Question illustration

Which pair of letter sequences do they read?
  1. Zac: BRSBAASE; Pan: RBSRBAE
  2. Zac: BRSEBAASE; Pan: RBBSRBAE
  3. Zac: BRSEBAASE; Pan: RBSRBAE
  4. Zac: BRSEBAAS; Pan: RBSRBE

Question 9

Seven skaters start in the pictured order.

Question illustration

After every minute, the front skater moves to the back to save energy. Who is at the front after one hour?
  1. P
  2. R
  3. T
  4. V

Question 10

A smile detector first replaces a face by two eye dots and a mouth line.

Question illustration

It places this sketch over a test template with two red eye circles, a red mouth boundary and four black contact points.

Question illustration

It accepts a smile only when the sketch touches the black points without touching the red outlines. The examples show an accepted face and a rejected face.

Question illustration

How many of these ten sketches are accepted?

Question illustration
  1. 3
  2. 4
  3. 5
  4. 6

Question 11

Count binary strings (made only of 0 and 1) with no two adjacent ones, such as 010010001. The table records counts for length N.

Question illustration

For N=1 the strings are 0,1; for N=2 they are 00,01,10; for N=3 they are 000,100,010,001,101. How should the complete count row read?
  1. 2, 3, 5, 7, 9
  2. 2, 3, 5, 10, 15
  3. 2, 3, 5, 8, 13
  4. 2, 3, 5, 8, 14

Question 12

Martin travels from home H to work W by metro and must change trains. The map labels stations with circles and gives the time between adjacent stations.

Question illustration

Assume changing trains takes no time. What is the shortest journey time?
  1. 13
  2. 12
  3. 11
  4. 19

Question 13

Ivan builds a stepped pyramid from identical cubes. Its layers, from bottom upward, contain 25,16,9,4,1 cubes as shown. He paints every outside face, including the bottom.

Question illustration

How many small-cube faces does he paint?
  1. 85
  2. 101
  3. 105
  4. 110

Question 14

Two roads connect Beavertown and Treeville. Road 1 has a bridge allowing weight at most 7 tonnes. Road 2 has a tunnel allowing height less than 3 m and a ferry allowing length less than 7 m.

Question illustration

Vehicle labels give height, weight, length in that order: for example 180 cm, 6 t, 8 m means height 180 cm, weight 6 tonnes, length 8 m. Which vehicle can use either road?

Question illustration
  1. 210cm, 8t, 6m
  2. 210cm, 2t, 8m
  3. 180cm, 4t, 6m
  4. 310cm, 5t, 5m

Question 15

The park has six letter-labelled trees. A letter is encoded by L and R turns from the entrance arrow, taking left or right at each junction.

Question illustration

For example A is LLL and R is LRR. Concatenating codes makes words: RLLLLRRLLL encodes SARA. How many L/R characters encode BEBRAS?
  1. 19
  2. 20
  3. 21
  4. 22

Question 1

A beaver wishes to become a ninja and chooses the nickname Zukame Moru using the alphabet below. What is the beaver's real name?

Question illustration

The complete mapping is A–ka, B–zu, C–mi, D–te, E–ku, F–lu, G–ji, H–ri, I–ki, J–zu, K–me, L–ta, M–rin, N–to, O–mo, P–mor, Q–ke, R–shi, S–ari, T–chi, U–do, V–ru, W–mei, X–na, Y–fu, Z–zi.
  1. Josip
  2. Jani
  3. Jakov
  4. Jurica

Question 2

Lara defines the nonuniformity of a string as the largest frequency of a character minus the smallest frequency among characters that occur. For abacaba it is 4−1=3. Changing two characters can give abbccba, whose nonuniformity is 1. Lara has ababaaaaaaccabc and may replace 6 characters with letters of the alphabet. What is the smallest possible nonuniformity?

Question illustration

Source wording note: the final source sentence says “uniformity”, while the definition and objective concern nonuniformity; use the defined largest-minus-smallest quantity. The illustration circles 2 beside abacaba, but its frequencies 4,2,1 actually give 3; the original graphic is retained.
  1. 0
  2. 1
  3. 2
  4. 3

Question 3

A fashion shop makes bracelets from the two pairs of ornaments shown. It starts with one pair, then inserts further complete pairs between the two ornaments of any existing pair, as in the examples. Which bracelet follows this rule?

Question illustration

Question illustration

Question illustration
  1. Original bracelet A
  2. Original bracelet B
  3. Original bracelet C
  4. Original bracelet D

Question 4

A car park has 12 spaces. The diagrams show occupied spaces on Monday (left) and Tuesday (right). How many spaces were unused on both days?

Question illustration
  1. 3
  2. 4
  3. 5
  4. 6

Question 5

Zac starts at 1 and walks to 2. Pan starts at 2 and walks to 1. The letters B,E,R,A,S are placed along the road, but each beaver can read only signs on their left. What sequences do they read?

Question illustration
  1. Zac: BRSBAASE; Pan: RBSRBAE
  2. Zac: BRSEBAASE; Pan: RBBSRBAE
  3. Zac: BRSEBAASE; Pan: RBSRBAE
  4. Zac: BRSEBAAS; Pan: RBSRBE