Course: Selected Algorithms of Coding and Decision

» List of faculties » FBI » UAI
Course title Selected Algorithms of Coding and Decision
Course code UAI/603
Organizational form of instruction Lecture
Level of course Master
Year of study not specified
Frequency of the course In each academic year, in the summer semester.
Semester Summer
Number of ECTS credits 6
Language of instruction Czech
Status of course Compulsory-optional
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Říhová Zora, doc. Ing. CSc.
  • Ivánek Jiří, prof. RNDr. CSc.
Course content
1 Coding information resources - Basic types of codes - Effective coding - Fan and Huffman algorithms - Detection and correction of transmission errors - Hamming and other self-correcting codes - Message transmission limits in the communication system 2 Data compression - Lossless compression - Lossy audio compression - Lossy image compression 3 Basic encryption methods - Classical substitution ciphers - Cryptanalysis of Vigener cipher - DES encryption standard - AES new encryption standard 4 Public Key Encryption - Mathematical principles of RSA - Rabin's algorithm for generating large primes - Identification of public and secret keys - The complexity of the factorization problem - Other public key encryption methods 5 Decision tables and trees - Logical properties of decision tables - Construction of decision trees from the decision table - Selected algorithms (direct, branch and bound, heuristic driven) - Construction of decision trees from data - TDIDT algorithm Lectures are stored in the Moodle system

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Work with multi-media resources (texts, internet, IT technologies), Group work
  • Class attendance - 30 hours per semester
  • Preparation for exam - 90 hours per semester
  • Preparation for classes - 30 hours per semester
Learning outcomes
The aim of the course is to introduce selected practically widely used algorithms for the construction of codes, ciphers and decision trees, including the relevant theoretical concepts and results on which these algorithms are based.
no requiard
Prerequisites
without limits

Assessment methods and criteria
Oral examination, Student performance assessment, Test

Successful completion of 3 tests, each for 60 % and 1 presentation of the chosen problem.
Recommended literature
  • Berka P. Dobývání znalostí z databází.. ACADEMIA Praha, 2003. ISBN 80-200-1062-9.
  • Ivánek J. Základy matematické informatiky I. Informace a automaty. VŠE Praha, 1991. ISBN 80-7079-673-1.
  • Jiroušek R., Ivánek J., Máša P., Toušek J., Vaněk N. Principi digitální komunikace. Praha, 2006. ISBN 80-7335-084-X.


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 Informatics (1) Category: Informatics courses - Recommended year of study:-, Recommended semester: Summer