Course: Algorithm Design 1

» List of faculties » PRF » KMI
Course title Algorithm Design 1
Course code KMI/ALGO1
Organizational form of instruction Lecture + Exercise
Level of course Bachelor
Year of study not specified
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)
  • Masopust Tomáš, doc. RNDr. Ph.D., DSc.
  • Juračka Jakub, Mgr.
  • Jurka Jakub, Mgr.
  • 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
Problems and algorithms - examples, fundamental aspects, and representation using pseudocode. Correctness of algorithms. Time and space complexity of algorithms; introduction to complexity analysis. Big-O notation (asymptotic notation). Basic data structures: arrays, lists, stacks, and queues. Sorting - problem definition and solution approaches. Comparison-based sorting: insertion sort, selection sort, bubble sort, quicksort, mergesort, and heapsort. Time complexity of sorting algorithms. Other sorting methods: counting sort, radix sort, bucket sort. Order statistics. Solving recurrence relations - the Master Theorem and its application.

Learning activities and teaching methods
Lecture, Demonstration
Learning outcomes
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 class participation, fulfillment of assigned tasks, and successful completion of a written (or oral) examination.
Recommended literature
  • Bhargava, A. Y. (2016). Algorithms.. Manning Publications Co.
  • 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.
  • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. (2022). Introduction to Algorithms, 4th edition. MIT Press.


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): 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): Computer Science for Education (2024) Category: Informatics 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): 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): Mathematics (2020) Category: Mathematics courses 1 Recommended year of study:1, Recommended semester: Winter
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): 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): 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): Bioinformatics (2021) Category: Informatics courses 1 Recommended year of study:1, Recommended semester: Winter