Lecturer(s)
|
-
Beránek Ladislav, prof. Ing. CSc., MBA
|
Course content
|
Lectures: 1. Basic algorithmic construction; 2. Method of algorithm design; 3. Basic principles of algorithms evaluation; 4. Algorithmic construction; a. work with sequence; b. work with matrixes; 5. Data structures; a. compact and linked lists; b. stack, queue, heap; 6. Sorting algorithms; a. direct method; b. quicksort, heapsort; 7. Trees, hash tables - basic principles;
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Demonstration, E-learning
- Class attendance
- 32 hours per semester
- Preparation for classes
- 12 hours per semester
- Semestral paper
- 20 hours per semester
- Preparation for credit
- 20 hours per semester
|
Learning outcomes
|
The aim of this course is to acquaint students with principles of object-oriented analysis and design with an emphasis on the use of UML (Unified Modeling Language).
Students will understand the basic principles of algorithms, they will be able to create simpler algorithms and use them at their own programs design.
|
Prerequisites
|
The course has no prerequisities.
|
Assessment methods and criteria
|
Test
Credit Requirements: Final written test.
|
Recommended literature
|
-
Edmonds, J. How to Think about Algorithms.. Cambridge: University Press, 2008.
-
MAREŠ, Martin a Tomáš VALLA. Průvodce labyrintem algoritmů. Praha: CZ.NIC, z.s.p.o., 2017. ISBN 978-80-88168-19-5.
-
McMillan, M. Data Structures and Algorithms Using C#.. New York: Cambridge University Press, 2007.
-
Sedgewick, R. Algoritmy v C#.. New York: Softpress, 2003.
-
Wirth, N. Algoritmy a štruktúry údajov.. Alfa, 1988.
-
WRÓBLEWSKI, Piotr. Algoritmy. Brno: Computer Press, 2015. ISBN 9788025141267.
|