|
Lecturer(s)
|
-
Greiner Karel, doc. Ing. Ph.D.
|
|
Course content
|
Abstract data types, abstract data structures. Complexity of algorithms. Sorting algorithms. Linear data structures. Tree data structures. Priority queue. Table. Graph structures.
|
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing)
- Home preparation for classes
- 9 hours per semester
- Term paper
- 32 hours per semester
- Preparation for an exam
- 57 hours per semester
- Participation in classes
- 22 hours per semester
|
|
Learning outcomes
|
To acquaint students with basic data structures and algorithms related to them.
After finishing this course student is able to use basic data structures and algorithms.
|
|
Prerequisites
|
Knowledge of object-oriented programming.
|
|
Assessment methods and criteria
|
Oral examination, Home assignment evaluation
The student submits a project prepared on a topic assigned by the teacher and successfully defends the project during the oral exam.
|
|
Recommended literature
|
-
Sedgewick R., Wayne K. Algorithms. 2011.
-
Wróblewski, Piotr. Algoritmy. Brno: Computer Press, 2015. ISBN 978-80-251-4126-7.
|