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 are the main drive for the Bebras contests.

The Bebras tasks’ developers seek to choose interesting tasks in order to motivate students to deal with informatics and to 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 information technologies.

 A good Bebras task should be

• Representing informatics concepts
• Easily understandable
• Solved within given time 
• Short
• Independent from specific systems
• Interesting

COURSE OUTLINE

For Class 1-2

Sequences, Pattern, Visualization, Computer graphics, Puzzles, Sorting, Pattern matching, Find the path, Exhaustive search, Simple algorithms, Rotation, Comparing, Counting, Combinations, Arrangements, Symmetry, Logic.

 

For Class 3-4

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

 

For Class 5-6

Logic gates, Exhaustive search, Pattern matching, Find the path, Algorithms, 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, Graphical algorithm, Visualization, Finite-State Automata, Exhaustive search, Data storage, Optimizing, Turning, Instructions, Sequences of instructions, Routing, Electronics programming, Simulation, Origami, Pictorial algorithms, Trees, Radix sort, State space exploration, Puzzle, Digital literacy, pitch (music), Binary number, Number system, Chinese remainder theorem, Sorting, Queue, Stack.

 

For Class 9-10

Backstep, Logic, Algorithms, Logic programming, Scheduling, Pipeline, Optimization, 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 algorithms, Concurrent systems, Observation camera, State transition diagram, Distribution of computing, Summed area table, Integral image, Encryption

 

For Class 11-12

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, Instructions, 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, Königsberg bridge problem, 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.