|
Lecturer(s)
|
-
Šebela Marek, prof. Mgr. Dr.
-
Kühr Tomáš, Mgr. Ph.D.
-
Krupka Michal, doc. RNDr. Ph.D.
-
Osička Petr, Mgr. Ph.D.
|
|
Course content
|
Interesting variants of data structures, their use and implementation. Basic problems and algorithms from the fields: graph theory, linear algebra, simple cryptography, number theory, classification. Slide custom solutions students talk.
|
|
Learning activities and teaching methods
|
|
Demonstration
|
|
Learning outcomes
|
The students become familiar with advanced concepts of seminar for bioinformatics.
1. Knowledge Ability to create and implement algorithms for simple problems.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Written exam, Student performance
Active participation in class. Completion of assigned homeworks. Passing the written exam.
|
|
Recommended literature
|
-
CORMEN, T. H., LEISERSON C. E., RIVEST D. L., STEIN C. (2001). Introduction to Algorithms, Second Edition. MIT Press.
-
Herout P. Učebnice jazyka C. Kopp.
-
KNUTH, D. (1998). The Art of Computer Programming, Volumes 1-3. Addison-Wesley.
-
SEDGEWICK, R. (2003). Algoritmy v C, části 1- 4: základy, datové struktury, třídění, vyhledávání. Praha, Softpress.
-
SKIENA, S. S. (2008). The Algorithm Design Manual, Second Edition. Springer.
|