|
Lecturer(s)
|
-
Semeniuk Martin, doc. Ing. Ph.D.
-
Dolejš Tomáš, Mgr. Ph.D.
-
Řezníček Ondřej, PhDr. Ph.D.
-
Fast Milan, Mgr. Ph.D.
-
Kasík Jakub, Mgr. Ph.D.
|
|
Course content
|
The term algorithm and associated properties. Algorithms ways. Basic algorithmic structures. Enrollment forms algorithms. An object-oriented approach to algorithmization and data. The programming environment for the development of algorithmic thinking. Algorithmic complexity. Graph theory. Numerical methods algorithms. Sorting algorithms. Activities developing algorithmic thinking. Examples of usable solutions to the development of algorithmic thinking in their chosen programming environment.
|
|
Learning activities and teaching methods
|
Lecture supplemented with a discussion, E-learning, Skills demonstration, Task-based study method, Seminar classes, Individual study
- Practical training (number of hours)
- 26 hours per semester
- Contact hours
- 26 hours per semester
- Undergraduate study programme term essay (20-40)
- 40 hours per semester
- Preparation for formative assessments (2-20)
- 15 hours per semester
|
| prerequisite |
|---|
| Knowledge |
|---|
| logical thinking developed at the level of secondary school RVP outputs |
| Skills |
|---|
| independently test functions in unfamiliar software |
| Competences |
|---|
| N/A |
| learning outcomes |
|---|
| Knowledge |
|---|
| explained by the historical development of the concept of the algorithm, including its properties. |
| identify the basic problems related to algorithmic complexity. |
| Skills |
|---|
| recognize algorithm based on the properties. |
| use different ways of algorithmization. |
| use basic algorithmic design. |
| distinguish the advantages and disadvantages of different forms of writing algorithms. |
| choose environment for the development of algorithmic thinking by use. |
| use with algorithmization knowledge of graph theory. |
| solve examples useful for the development of algorithmic thinking in their chosen environment. |
| analyze problems from different areas and build their solutions suitable algorithm in various forms based on rules. |
| Competences |
|---|
| N/A |
| N/A |
| N/A |
| teaching methods |
|---|
| Knowledge |
|---|
| Lecture supplemented with a discussion |
| E-learning |
| Individual study |
| Skills |
|---|
| Skills demonstration |
| Individual study |
| Seminar classes |
| Task-based study method |
| Competences |
|---|
| Task-based study method |
| Skills demonstration |
| Students' portfolio |
| Self-study of literature |
| Seminar classes |
| assessment methods |
|---|
| Knowledge |
|---|
| Test |
| Seminar work |
| Continuous assessment |
| Portfolio |
| Skills |
|---|
| Skills demonstration during practicum |
| Seminar work |
| Continuous assessment |
| Portfolio |
| Formative evaluation |
| Competences |
|---|
| Continuous assessment |
| Seminar work |
| Skills demonstration during practicum |
| Portfolio |
|
Recommended literature
|
-
Programování pro děti : naučte se programovat při tvorbě skvělých her. 1. vyd. Brno : Computer Press, 2013. ISBN 978-80-251-3809-0.
-
Mareš, Martin; Valla, Tomáš. Průvodce labyrintem algoritmů. 1. vydání. 2017. ISBN 978-80-88168-19-5.
-
Pelánek, Radek. Programátorská cvičebnice : [algoritmy v příkladech]. Brno : Computer Press, 2012. ISBN 978-80-251-3751-2.
-
Ryant, Ivan. Algoritmy a datové struktury objektově. Vydání první. 2017. ISBN 978-80-270-1660-0.
-
Wróblewski, Piotr. Algoritmy. 1. vydání. 2015. ISBN 978-80-251-4126-7.
|