de | en

Practical Course - Algorithms for Programming Contests (IN0012, IN2106, IN4051)
Praktikum - Algorithmen für Programmierwettbewerbe (IN0012, IN2106, IN4032)

Course 0000001525 in SS 2014

General Data

Course Type Practical Course
Semester Weekly Hours 6 SWS
Organisational Unit Informatics 14 - Chair of efficient algorithms (N.N.)
Lecturers
Dates

Assignment to Modules

Further Information

Courses are together with exams the building blocks for modules. Please keep in mind that information on the contents, learning outcomes and, especially examination conditions are given on the module level only – see section "Assignment to Modules" above.

additional remarks Programming constest are competitions for solving problems with the help of computer programs. By taking part in these contests one may improve skills in using algorithms and data structures as well as in problem solving, software development and teamwork through fun and games. Important topics in computer science are combined with the fun in programming. In this practical course we will get to know several algorithms and data structures which are widely used in programming contests. There are plenty of these contests by now, each of them having a different mode and focus. The excercise problems in this course will be similar to the ones used in the International Collegiate Programming Contest (ICPC), an international programming contest for students which is run by the Association for Computing Machinery (ACM) since the 1970s. In this contest, groups of three students each need to solve eight to ten problems in five hours using one computer only. The competition is run in several local and regional contests until the best teams compete in the World Finals. The Computer Science Department of TUM has been participating in the ICPC with multiple teams for several years. Some sample problems of the German Collegiate Programming Contest (GCPC) 2012 give an impression of the problems we are going to solve in this practical course. There will be a lecture where we explain algorithms for a new topic each week. During the following week the participants need to solve problems related to this topic. Solutions, different ideas and remarks regarding the problems will be presented in the next lecture. The problems differ in the level of difficulty: There will be problems asking for straightforward implementations of the presented algorithms as well as harder problems taken from several contests. For submitting and judging the submissions we will use the same system which is used for almost all rounds of the ICPC.
Links Course documents
Additional information
Current information
TUMonline entry
Top of page