|
Lecturer(s)
|
-
Prokýšek Miloš, PhDr. Ph.D.
-
Icha Jaroslav, RNDr.
|
|
Course content
|
- The algorithm as a concept. - Algorithm design and construction - Basic data structures - Sorting data - Searching data
|
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Practical training
- Class attendance
- 56 hours per semester
- Preparation for classes
- 28 hours per semester
- Preparation for exam
- 16 hours per semester
|
|
Learning outcomes
|
This course is a basic introduction to the data structures and algorithms used in informatics. During the course students gain basic skills in algorithm design and construction and knowledge of basic types of data structures such as arrays, lists, trees, hash tables etc. Furthermore, some sorting and searching algorithms for data structures will be discussed.
|
|
Prerequisites
|
Basic knowledge of programming and PC work.
|
|
Assessment methods and criteria
|
Combined exam
Completion of partial tasks during the semester.
|
|
Recommended literature
|
-
LAFORE, R., Data Structures & Algorithms in Java. Sams, 2003.
-
MCMILLAN, M., Data Structures and Algorithms Using C#. New York, Cambridge University Press, 2007.
|