13M111TA - Theory of Algorithms
Course specification | ||||
---|---|---|---|---|
Course title | Theory of Algorithms | |||
Acronym | 13M111TA | |||
Study programme | Electrical Engineering and Computing | |||
Module | ||||
Type of study | master academic studies | |||
Lecturer (for classes) | ||||
Lecturer/Associate (for practice) | ||||
Lecturer/Associate (for OTC) | ||||
ESPB | 6.0 | Status | elective | |
Condition | Algorithms and Data structures 1 and 2 | |||
The goal | Intoducing the students to the advanced concepts of algorithm theory, the analysis and implementation of algorithms from specific classes. | |||
The outcome | Deep knowledge and understanding of algorithms from several relevant classes, ability of analysis and an efficient implementation. | |||
Contents | ||||
Contents of lectures | About algorithms and data structures. Analysis and implementation of algorithms. Advanced data structures. Manipulation with strings and sets. Advanced graph algorithms. Geometrical algorithms. Parallel algorithms. Compression. Cryptographic algorithms. Genetic algorithms. Dynamic and linear programming. | |||
Contents of exercises | Demonstration of algorithm functioning in visual simulators. Solving practical problems. Implementation of algorithms and their performance evaluation. | |||
Literature | ||||
| ||||
Number of hours per week during the semester/trimester/year | ||||
Lectures | Exercises | OTC | Study and Research | Other classes |
2 | 2 | |||
Methods of teaching | auditory class lessons and exercises with presentations, lab exercises, homeworks | |||
Knowledge score (maximum points 100) | ||||
Pre obligations | Points | Final exam | Points | |
Activites during lectures | 0 | Test paper | 70 | |
Practical lessons | 30 | Oral examination | 0 | |
Projects | ||||
Colloquia | ||||
Seminars | 0 |