Abstract

Analysis of the understanding of the material of theoretical informatics in competitions and olympiads in informatics

Highlights

  • After Unified State Exam became final exam for schoolchildren, but an entrance exam to Russian universities as well, Russian universities faced up with a question of how to ensure the quality of entrants and later students in this conditions

  • At this time there are six subject manipulators within the framework of the Discrete Mathematics and Theoretical Informatics Olympiad: logical circuits, regular expressions, Tarski world, finite state machines, Turing machines and graph, and additional module used for plain text tasks

  • The use of computer models of the concepts of discrete mathematics and theoretical informatics provides the basis for creating a wide range of constructive problems

Read more

Summary

INTRODUCTION

After Unified State Exam became final exam for schoolchildren, but an entrance exam to Russian universities as well, Russian universities faced up with a question of how to ensure the quality of entrants and later students in this conditions. If there are thousands students that want to participate in oral Olympiad, the organizers have to use written preliminary stage Another issue is that the very small amount of possible final results (from 0 to 7) which sometimes causes some troubles with assigning the prizes. 1–3 points mean that the problem is not solved, but the solution submitted has some ideas important for the certain task, for example, a correct answer is given without necessary explanation or some partial case is investigated This form is possible when all participants are gathered at the same place. At the oral Olympiad a small mistake probably could be corrected during the presentation and the final mark for the task is the same as the mark for the student who initially solved it correctly. It is supposed that a good construction is a good result for the informatics; a constructive task is considered to be a step for understanding and solving more theoretical ones and grasping the general properties of those objects

ANALYSIS OF TYPICAL INFORMATICAL TASKS
STRUCTURE OF THE DISCRETE MATHEMATICS AND THEORETICAL INFORMATICS OLYMPIAD
SUBJECT MANIPULATORS
EXAMPLES OF TASKS SUPPORTED BY MANIPULATORS
SOLUTION ANALYSIS
Findings
CONCLUSIONS

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.