Algorithms

Study facts

Course codeINF234
ECTS credits10
Teaching semesterAutumn
Number of semesters1
Teaching language
English
Study levelPostgraduate Courses
Resources
Belongs toDepartment of Informatics

Contact

Contact Information

studieveileder@ii.uib.no

Objectives and Content

The course includes advanced methods for design and analysis of discrete algoritms. A central theme in the course is how to cope with NP-hard problems, for example on restricted input, or via approximation algorithms, randomized algorithms or parameterized algorithms. The course also introduces tools to handle input that changes during the course of an algorithm.

Learning Outcomes

At the completion of INF234 the student should be able to:

  • utilize the classical algorithm design techniques for discrete problems. These techniques include greedy algorithms, dynamic programming, graph traversal and network flow.
  • recognize new problems that are amenable to the techniques they learned in this course, and design new algorithms for similar problems.
  • prove correctness of algorithms and to analyze the running time of algorithms.
  • know the difference between complexity classes P and NP and NP-completeness.

Semester of Instruction

Autumn

Required Previous Knowledge

At least 60 ECTS in computer science, preferably including some mathematics

Recommended Previous Knowledge

INF102 (Algorithms, data structures, and programming)

Subject Overlap

I234: 10 ECTS

Compulsory Assignments and Attendance

Exercises.

Compulsory assignments are valid two semesters, the semester of the approval and the following semester.

Forms of Assessment

Written exam. It is opportunity for grades on exercises, which can be included in the final grade. If less than 20 students are taking the course, it can be oral exam.

No aids allowed.

Grading Scale

The grading scale used is A to F. Grade A is the highest passing grade in the grading scale, grade F is a fail.