Algorithms and Data Structures III
Syllabus, Master's level, 1DL481
- Education cycle
- Second cycle
- Main field(s) of study and in-depth level
- Computer Science A1N
- Grading system
- Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
- Finalised by
- The Faculty Board of Science and Technology, 27 April 2015
- Responsible department
- Department of Information Technology
120 credits, of which at least 30 credits in Mathematics and 45 credits in Computer Science. Algorithms and Data Structures II.
To pass the course, the student must be able to
- use advanced standard methods in algorithm theory, such as perfect hashing and integer programming;
- analyse NP-completeness;
- use analysis methods in the areas of amortised analysis and randomised algorithms.
Advanced and modern techniques in algorithmics and analysis methods. Advanced standard methods in algorithm theory, such as perfect hashing and integer programming, NP-completeness, analysis methods in the areas of amortised analysis and randomised algorithms. Connections to modern research in the area.
Lectures, labs and lessons.
Written and oral presentation of assignments, 2 credits, and written exam, 3 credits.
The course cannot be included in a degree together with the courses Algorithms and data structures (DV)3/III (1DL104, 1DL113, 1DL030) and Advanced algorithmics (1DL480).