Tasks are very important both for competitors (students) and task developers (teachers). Students are being “pushed” to think on informatics. Whereas educators should think about harmonization of syllabus of computer science Creative interesting tasks the main drive for the Bebras contest.

The Bebras task’s developers seek to choose interesting tasks in order to motivate students to deal with informatics and think deeper about technology. Also they would like to cover as many as possible topics on informatics and computer literacy. In informatics there is also the problem of syllabus. Even if there is an education standard for informatics at school in some countries till now there is no common agreement what should be included in an integrated syllabus using informatics technologies.

A good Bebras task should be

• Representing informatics concept
• Easily understandable
• Solved within given time
• Short
• Independent from specifics systems
• Interesting 

For Class 1-2

Sequences, Pattern, Visualization, Computer graphics. Puzzles Sorting, Pattern matching, Find the path, Exhaustive search, Simple algorithms, Rotation comparing, counting combination, Arrangements, symmetry Logic.

For Class 3-4

Computer graphics Rotation, Reflection, Algorithm, Stack Memory Rules Optimization problem, Shortest path, Exclusive event Exclusive search Pattern matching. Find the path Logic. Sorting, Counting Pattern, Visualization, Graphics Editor, Sequence of operations.

For Class 5-6

Logics gates, Exhaustive search, Pattern matching, find the path, Algorithm Sorting   Graphics Editor Sequence of operations. Optimization, combinatorics Probability, Exclusive event Rules, Assignment Numeric representation, Simple computing Logic, Image, Visualization Caesar cipher Cryptography, Decryption, Encryption, Shortest paths, Dijkstra, Pipeline, Stack Scheduling.

For Class 7-8

Manhattan distance, Sequences, Pattern matching Information comprehension Rules, Assignment Information hiding, Numeric representation, Error correcting Algorithms, Simple computing partition, Graphics algorithm Visualization, Finite-State Automata. Exhaustive search Data storage Optimizing Turning Instruction Sequences of instructions. Routing Electronics programming simulation Origami Pictonal algorithm Trees Radix sort State space exploration puzzle, Digital literacy, pitch (music). Binary number, Number system, Chinese remainder theorem, sorting Queue State.

For Class 9-10

Backstep Logic Algorithm, Logic programming, Scheduling Pipeline, Optimizing, State-Exploration Digital literacy, Debugging, Stack Data structure origami pictorial algorithms. Binary numbers, Chinese remainder theorem, combinatorics, Turing machine, pitch (music). Number system, Normal algorithm, Relational database, Eulerian tour, path scheduling string algorithm, concurrent systems. Observation camera, state transition diagram, Distribution of computing, summed area table, integral image, encryption.

For class 11,12 & 13

Graphs, shortest path problem, Dijkstra, partition, Graphical Algorithm, Game, Artificial intelligence, Programming Gametree, Binary numbers, Number system, Recursion Algorithms, program execution. Hex coordinates, optimization, Binary search, complexity, Binary fraction, Floating points numbers, Turing machine, Grammar, instruction, sequences of instructions sorting, Radix sort logic gates Boolean algebra Queue stack RS232 Serial transmission Bits, Bytes Graph, Eulerian tour, path scheduling, semaphore, Bottle-neck, segment tree, Binary tree, Recursion Traversal, Postorder, Shortest path problem, Konigsberg bridge  problems Loops, Greedy algorithm, Transformation, combinatorics string algorithms, Recursive formula. Fibonacci numbers, Bubble-sort, sorting techniques, Algorithm running time, Summed area table, integral image, Encryption, Final state automata.