INF4200 – Algorithms and efficiency
Course description
Schedule, syllabus and examination date
Course content
Algorithm theory as a model of practical computing. Turing machine, formal languages, computability, complexity algorithm design techniques, cryptography, expressiveness of programming languages, relationships between logic and complexity.
Learning outcome
To give a foundation for a systematic (academic) understanding of practical computing. To give a systematic overview of basic issues that arises in work with algorithms. To teach the main elements of algorithm theory. To teach the most relevant theoretical tools and techniques.
Admission
Students who are admitted to study programmes at UiO must each semester register which courses and exams they wish to sign up for in Studentweb.
If you are not already enrolled as a student at UiO, please see our information about admission requirements and procedures.
Prerequisites
Formal prerequisite knowledge
None
Recommended previous knowledge
INF1020 – Algorithms and data structures (discontinued) /INF 110
Overlapping courses
10 credits with INF3200 – Algorithms and efficiency (discontinued), 9 credits with IN 210 or 3 credits with IN 216
Teaching
2 hours of lectures and 2 hours of problem solving sessions per week. Submission of compulsory exercises is required.
Examination
A three-hour written exam. Graded marks.
Other
Note that the first lecture is compulsory. The subject is regarded equal to IN210 and INF3200 when practicing exam regulations.