Bebras Junior Challenge Problems (Difficult)

Quiz
•
Computers
•
6th - 8th Grade
•
Hard
Calum Gordon
Used 8+ times
FREE Resource
15 questions
Show all answers
1.
FILL IN THE BLANK QUESTION
3 mins • 1 pt
Beautiful tiles
Robot-beaver is walking on tiles and decorating them with ornaments. He knows these commands:
Several flowers on the same tile are drawn next to each other.
What is the largest number of flowers drawn on a single tile by robot-beaver, after these commands?
(type a number only ...)
Answer explanation
This problem introduces programming. The presented set of commands is a very simple programming language. The programming language for different actions has functions (move, draw) with arguments and a loop.
2.
FILL IN THE BLANK QUESTION
3 mins • 1 pt
Beaver map
On the beaver map the location of objects are indicated by two numbers in brackets. Row number first, then – column number.
Lake (1, 1)
Bridge (5, 6)
The beaver hut is located four points below bridge and two points to the right of the bridge.
What is the location of the Beaver hut?
(type two numbers with no space)
3.
HOTSPOT QUESTION
3 mins • 1 pt
Clothes line
Kangaroo built a clothes dryer. They want to strengthen the poles to save the dryer from beavers. Unfortunately, they can only afford to strengthen one pole.
In which pole should they invest?
(click on the correct pole ...)
Answer explanation
Graphs are useful to model all kinds of real life problems, like traffic, maps and phone connections. In computing algorithms are often used to work with graphs.
4.
FILL IN THE BLANK QUESTION
3 mins • 1 pt
Swap
Beaver’s and kangaroos’ cards are in an order.
You can swap two cards next to each other.
How many swaps are needed to swap cards to get all beavers at the beginning of the row and kangaroos at the end? Use the minimum number of swaps.
(type a number only ...)
Answer explanation
Typically, automatic processing of data is much easier, when data is arranged according to some criteria – then it is sorted. The method for sorting the set of cards that is described in this task is called “bubble sort”. This sorting algorithm steps through a list of objects again and again, swapping any neighbouring objects which are in the wrong order. The list is sorted when no swap occurs during a pass through the list. Bubble sort is quite easy to understand compared to other sorting algorithms. But unfortunately, it is not very efficient.
5.
FILL IN THE BLANK QUESTION
3 mins • 1 pt
iFrog
Robot frog can grab one insect by jumping once from one leaf to another one.
How many jumps does robot frog have to make in order to to grab all the insects?
(type a number only ...)
Answer explanation
This task shows the concept of optimization. Optimization can be defined as finding the most efficient solution. Therefore, here a strategy is needed to find the best solution among all feasible solutions.
6.
FILL IN THE BLANK QUESTION
3 mins • 1 pt
Laundry
Beaver has a laundry with two separate machines for washing and drying. Both machines have an half hour operating cycle, so each customer needs 60 minutes.
Two beavers arrive in a hurry. They need to wash and dry their clothes as quickly as possible.
How many minutes it is going to take to wash and dry clothes for two beavers?
(type a number only ...)
Answer explanation
This task deals with parallel processing, where tasks which do not conflict can be run simultaneously. Most of today‘s CPUs are multi-core machines, which can perform parallel processing. Parallel processing is an important technique, which can be applied to factories producing cars and many other areas.
7.
FILL IN THE BLANK QUESTION
3 mins • 1 pt
Robot is carrying
Robot-beaver is programmed to carry parcels to the third floor. If a parcel weighs up to 10 kilo, robot can move one floor per minute. If it is heavier 2 minutes per floor. Robot-beaver delays 1 minute preparing to move before each flight of stairs.
How many minutes will it take Robot-beaver to carry a 13 kilo parcel to the 3rd floor?
(type a number only ...)
Answer explanation
A condition IF – THEN – ELSE is one of the most important commands in algorithms. A condition determines which action should be taken. If the result of the condition is true, the action, which is described after “then”, is taken. If the result of the condition is false, the action which follows “else” is taken. These situations are also common in the real world when we have to make a choice between two options.
Create a free account and access millions of resources
Similar Resources on Wayground
13 questions
VEXcode VR Course Unit 7

Quiz
•
6th Grade
10 questions
VEX Iterations

Quiz
•
6th - 8th Grade
10 questions
Quiz1

Quiz
•
7th - 9th Grade
20 questions
VEX V5 Coding

Quiz
•
8th Grade
10 questions
Computer Education Grade 3 Volume 4 Quiz

Quiz
•
3rd Grade - University
14 questions
LocoRobo LEDs

Quiz
•
5th - 12th Grade
15 questions
Edison robot

Quiz
•
6th - 7th Grade
10 questions
Laws of Robotics

Quiz
•
3rd - 6th Grade
Popular Resources on Wayground
10 questions
Lab Safety Procedures and Guidelines

Interactive video
•
6th - 10th Grade
10 questions
Nouns, nouns, nouns

Quiz
•
3rd Grade
10 questions
Appointment Passes Review

Quiz
•
6th - 8th Grade
25 questions
Multiplication Facts

Quiz
•
5th Grade
11 questions
All about me

Quiz
•
Professional Development
22 questions
Adding Integers

Quiz
•
6th Grade
15 questions
Subtracting Integers

Quiz
•
7th Grade
20 questions
Grammar Review

Quiz
•
6th - 9th Grade
Discover more resources for Computers
10 questions
Exploring Digital Citizenship Essentials

Interactive video
•
6th - 10th Grade
8 questions
Time Management

Quiz
•
6th Grade
18 questions
Company Logos

Quiz
•
6th - 8th Grade
15 questions
Acceptable Use Policy (Quiz)

Quiz
•
6th - 8th Grade
25 questions
Career Vs. Job

Quiz
•
6th - 8th Grade
15 questions
Computer Components Video

Interactive video
•
8th Grade
14 questions
Computer Hardware

Quiz
•
7th Grade
10 questions
Networking Devices and Their Functions

Interactive video
•
5th - 8th Grade