Course: Algorithm Design 1

« Back
Course title Algorithm Design 1
Course code KMI/ALGO1
Organizational form of instruction Lecture + Exercise
Level of course Bachelor
Year of study 1
Semester Winter
Number of ECTS credits 6
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Balun Jiří, Mgr.
  • Zacpal Jiří, Mgr. Ph.D.
  • Večerka Arnošt, RNDr.
  • Bartl Eduard, doc. RNDr. Ph.D.
  • Foltasová Eliška, Mgr.
  • Urbanec Tomáš, Mgr.
Course content
Algorithms and their features, time and space complexity of algorithms. Data structures. Linear data structures - lists, stack, front, and their implementation, tree data structures. Sorting problem, types of sorting algorithms. Internal sorting methods: insertion sort , Shellsort, bubble sort, Quicksort, selection sort, Heapsort, implementation of these sorting methods. Special sorting methods: Bucket sort, Radix Sort. External sorting, principles of external sorting by merging method, polyphase merge sort.

Learning activities and teaching methods
Lecture, Demonstration
Learning outcomes
The students become familiar with basic concepts of algorithm design.
2. Comprehension. Understand basic concepts of algorithm design.
Prerequisites
unspecified

Assessment methods and criteria
Oral exam, Written exam

Active participation in class. Completion of assigned homeworks. Passing the oral (or written) exam.
Recommended literature
  • Bhargava, A. Y. (2016). Algorithms.. Manning Publications Co.
  • Cormen, T. H., Leiserson C. E., Rivest D. L., Stein c. (2001). Introduction to Algorithms. MIT Press.
  • Knuth, D. (1997). The Art of Computer Programming, Volume 1, Fundamental Algorithms, Third Edition. Addison-Wesley.
  • Knuth, D. (1998). The Art of Computer Programming, Volume 3, Sorting and Searching. Addison-Wesley.
  • SEDGEWICK, R. (2003). Algoritmy v C, části 1-4: základy, datové struktury, třídění, vyhledávání. Praha, Softpress.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Science Study plan (Version): Applied Mathematics - Specialization in Data Science (2020) Category: Mathematics courses 1 Recommended year of study:1, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Mathematics (2020) Category: Mathematics courses 1 Recommended year of study:1, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Computer Science - Specialization in Programming and Software Development (2021) Category: Informatics courses 1 Recommended year of study:1, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Computer Science for Education (2024) Category: Informatics courses 1 Recommended year of study:1, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Applied Mathematics - Specialization in Business Mathematics (2021) Category: Mathematics courses 1 Recommended year of study:1, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Computer Science - Specialization in General Computer Science (2021) Category: Informatics courses 1 Recommended year of study:1, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Applied Mathematics - Specialization in Industrial Mathematics (2020) Category: Mathematics courses 1 Recommended year of study:1, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Computer Science (2020) Category: Informatics courses 1 Recommended year of study:1, Recommended semester: Winter
Faculty: Faculty of Science Study plan (Version): Bioinformatics (2021) Category: Informatics courses 1 Recommended year of study:1, Recommended semester: Winter