|
Lecturer(s)
|
-
Vraný Jiří, Mgr. Ph.D.
-
Kopetschke Igor, Ing.
|
|
Course content
|
Lectures 1.Basic notions. Arrays, matrices and it's purpose. Graph representation. 2.Sorting algorithms. Hungry Algorithms. 3.Graph algorithms 4.Trees 5.Introduction to searching. Hashing. Backtracking. 6.Searching in text strings. 7.Compressing algorithms. Exercises 1.Consulted practice of current lecture algorithms and/or structures. 2.Consulted practice of current lecture algorithms and/or structures. 3.Consulted practice of current lecture algorithms and/or structures. 4.Consulted practice of current lecture algorithms and/or structures. 5.Consulted practice of current lecture algorithms and/or structures. 6.Consulted practice of current lecture algorithms and/or structures. 7.Consulted practice of current lecture algorithms and/or structures.
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing), Self-study (text study, reading, problematic tasks, practical tasks, experiments, research, written assignments)
- Semestral paper
- 32 hours per semester
- Home preparation for classes
- 10 hours per semester
- Preparation for credit
- 20 hours per semester
- Class attendance
- 28 hours per semester
|
|
Learning outcomes
|
The subject is focused on basic principles of the computer algorithms, the most common algortihms and data structures.
Student will get basic knowledge of algorithms and common data structures.
|
|
Prerequisites
|
Unspecified
|
|
Assessment methods and criteria
|
Combined examination, Student's performance analysis
Requirements for getting a credit are activity at the practicals /seminars and successful passing the tests. Examination is of the written and oral forms.
|
|
Recommended literature
|
-
Knuth, D. The Art of Computer Programming. Reading, Massachutes: Addison-Wesley, 1997.
-
Wroblewski, P. Algoritmy -- Datové struktury a programovací techniky. Computer Press. ISBN 80-251-0343-9.
|