|
Lecturer(s)
|
-
Kolingerová Ivana, prof. Dr. Ing.
-
Maňák Martin, Mgr. Ph.D.
|
|
Course content
|
Students will solve programming chalenges using graph algorithms, greedy algorithms, divide and conquer, dynamic programming, numerical methods, string processing and more. The emphasis will be on identifying the type of a challenge, correctness and efficiency of the solution. Several mini-competitions of small teams will take place during the labs. Home assignments will be individual.
|
|
Learning activities and teaching methods
|
Collaborative instruction, Cooperative instruction, Discussion, Students' portfolio, One-to-One tutorial, Laboratory work, Task-based study method, Individual study, Students' self-study, Self-study of literature, Seminar
- Contact hours
- 26 hours per semester
- Presentation preparation (report in a foreign language) (10-15)
- 15 hours per semester
- Practical training (number of hours)
- 63 hours per semester
|
| prerequisite |
|---|
| Knowledge |
|---|
| Znalost algoritmického řešení úloh. |
| learning outcomes |
|---|
| Students will substantially expand their practical skills with solving programming challenges. |
| teaching methods |
|---|
| Seminar |
| Laboratory work |
| Task-based study method |
| Collaborative instruction |
| Cooperative instruction |
| Self-study of literature |
| Individual study |
| Students' portfolio |
| One-to-One tutorial |
| Discussion |
| assessment methods |
|---|
| Skills demonstration during practicum |
| Individual presentation at a seminar |
| Continuous assessment |
|
Recommended literature
|
-
Donald E. Knuth, překlad David Krásenský:. Umění programování. 1. díl, Základní algoritmy.
-
Donald E. Knuth, překlad David Krásenský:. Umění programování. 2. díl, Seminumerické algoritmy.
-
Steven Halim and Felix Halim:. Competitive Programming 3: The New Lower Bound of Programming Contests (Handbook for ACM ICPC IOI contestants 2013).
-
Steven S. Skiena and Miguel A. Revilla. Programming Challenges: The Programming Contest Training Manual (Texts in Computer Science).
-
Thomas H. Cormen, Charles E. Leiserson, Ronald R. Rivest and Clifford Stein:. Introduction to Algorithms, 3rd Edition.
|