LOGIA is an informatics (computer science) competition for students of schools in the Mazowieckie Province (Poland).
It focuses on building skills in logical thinking, problem-solving, and algorithmic thinking through tasks implemented mainly in Python.
The competition includes:
- Stage 1: Basic tasks in computer graphics and computations.
- Stage 2: Tasks involving graphics, computations, text processing, and single-level lists.
- Stage 3: More advanced tasks, including multi-level lists, recursion, dynamic programming, encryption, and graph structures.
LOGIA promotes:
- Safe and ethical use of technology.
- Understanding of computer networks, data representation, and basic algorithms.
- Developing, implementing, and testing solutions with attention to algorithm efficiency.
Participants solve increasingly challenging problems to develop computational thinking and technical skills.
Subject Competition in Informatics "LOGIA" for Students of Schools in the Mazowieckie Province, School Year 2024/2025
- Understanding, analyzing, and solving problems through logical, abstract, and algorithmic thinking.
- Implementing algorithmic tasks in the Python programming language.
- Stage 1: Graphics and computations.
- Stage 2: Graphics and computations, text processing, and single-level lists.
- Stage 3: Graphics and computations, text processing, and multi-level lists.
- Operating computers, digital devices, and computer networks, including:
- Representation of information.
- Functioning of digital devices and computer networks.
- Performing calculations and writing programs.
- Creating with computers: drawings, designs, texts, animations, multimedia presentations, and numeric data.
- Communication using computers and ICT.
- Observing laws and safety rules:
- Privacy and data protection.
- Intellectual property rights.
- Communication etiquette and social norms.
- Evaluating and mitigating technological risks.
- Basic Python constructs and turtle graphics commands.
- Input/output instructions, arithmetic and logical operations, assignment, conditional statements, loops (fixed and conditional), variables, strings, lists (Stage 2 and 3), and other data structures.
- Defining custom functions and using built-in functions (e.g., square root), including recursion.
- Problem-solving steps: analyzing the problem, developing an algorithm, implementing it, and testing; breaking problems into subproblems.
- Using mathematical knowledge:
- Squares and their diagonals, equilateral triangles and heights, other polygons.
- Dividing angles into equal parts.
- Scaling drawings, finding similar elements.
- Representing numbers, strings, and images in computers.
- Encoding images with numbers, strings, and lists.
- Basic number algorithms:
- Divisibility, primality, Euclid’s algorithm (GCD, LCM), number properties.
- Text processing by specific rules: palindromes, anagrams, permutations, and combinations.
- Searching in ordered and unordered sets, counting elements, finding minima and maxima, and sorting.
- Topics related to encryption (various cipher types).
- Examining relations between elements: tree and graph structures; labyrinth tasks.
- Greedy algorithms and dynamic programming.
- Non-decimal number systems: conversions between systems.
- Using randomness in problem-solving.
- Algorithm evaluation: time complexity.
- Testing solutions for task-compliant parameters.
- Using built-in help/documentation.
Stage | Scope | Date |
---|---|---|
I (School Level) | - Start of the school stage. - End of access to the general IT knowledge test. - End of possibility to submit solutions for algorithmic tasks in the areas of graphics and defining computations. - End of the school stage. |
- October 31, 2024 - November 19, 2024, 2:00 PM - November 20, 2024, 2:00 PM |
II (Regional Level) | Solving algorithmic competition tasks in the areas of graphics, defining computations, text processing, and single-level lists. | January 22, 2025, 11:00 AM |
III (Provincial Level) | Solving algorithmic competition tasks in the areas of graphics, defining computations, text processing, and lists. | March 19, 2025, 11:00 AM |