This syllabus is valid: 2007-01-01
and until further notice
Course code: 5DV022
Credit points: 7.5
Education level: Second cycle
Main Field of Study and progress level:
Computing Science: Second cycle, has only first-cycle course/s as entry requirements
Grading scale: Pass with distinction, Pass with merit, Pass, Pass with distinction, Pass, Fail
Responsible department: Department of Computing Science
Contents
The course is designed to develop knowledge and competence in the following areas:
the foundations necessary for the construction and analysis of algorithms focusing on principal design techniques, including divide-and-conquer, greedy methods, dynamic programming, and search techniques such as backtracking and branch-and-bound; computational complexity, including questions surrounding computational tractability; and the performance evaluation of software.
Required Knowledge
Univ:To be admitted you must have 60 ECTS-credits i Computing Science or 2 years of completed studies, in both cases including Fundamentals of Computing Science, (5DV037), C-programming and Unix, (5DV006), Data Structures and Algorithms, (5DV043), Calculus II (MAMA09) and Discrete Mathematics, (5MA006) or equivalent.
English proficiency equivalent to IELTS Academic Training minimum score 5.0 with no individual score below 4.5 (Tests taken before January 2005 not admissible or TOEFL minimum score 500 on paper based test and not below 4.0 on the TWE, Alternatively 173 on computer based test with iBT61 is also required as well as basic entrance requirements for higher studies in Swedish language proficiency if the course is taught in Swedish.
Literature
The literature list is not available through the web.
Please contact the faculty.
