Algorithmics 1000-2D97AL
In this seminar we study algorithms for discrete problems.
We discuss methods of designing such algorithms and analyzing their time complexity. We are interested in classical sequential algorithms as well as parallel, distributed, randomized and approximation algorithms. Efficient data structures are also studied.
During the seminar students present articles from scientific journals and proceedings of conferences devoted to the area of algorithms and data structures.
Possible kinds of MSc theses include original research, experiments, surveys and implementations of computer systems with non-trivial algorithmic elements.
The classes may be in English in case foreign students are present.
Type of course
elective seminars
Course coordinators
Term 2024: | Term 2023: |
Learning outcomes
Knowledge (KW_01, KW_02):
The student knows the basic algorithms and algorithmic techniques and data structures, understands the current "trends" in this field, in particular, he knows:
1. Graph algorithms.
2. Text algorithms.
3. Approximation algorithms.
4. Exact exponential Algorithms.
5. Parallel algorithms
Skills (K_U01, K_U02, K_U04, K_U05, K_U11 - KU_15):
The student can specify algorithmic problems, is able to analyze the problem and propose an efficient solution.
The student is able to write scientific publication in the field of algorithms, also in English.
The student is able to prepare a presentation in the field of algorithms, also in English.
Social competence (K_K01-K_K09):
The student is able to find the information on the given research problem in available sources and evalutes its reliability and usefulness.
The student can present specialized results in a manner understandable to non-specialists.
The student understands the importance of intellectual property rights in the use of other people's results.
Assessment criteria
Active participation in the seminar and giving a talk.
Bibliography
Modern scientific literature of the subject, including scientific journals and data from Internet. Details are provided by the lecturers at the first meeting.
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: