Algorithms and Data Structures II

5 credits

Syllabus, Bachelor's level, 1DL230

This course has been discontinued.

A revised version of the syllabus is available.

Code: 1DL230
Education cycle: First cycle
Main field(s) of study and in-depth level: Computer Science G1F
Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
Finalised by: The Faculty Board of Science and Technology, 12 March 2009
Responsible department: Department of Information Technology

Entry requirements

Mathematics, 15 credits, and Computer Science, 30 credits, including Algorithms and data structures I or the equivalent.

In order to pass, the student must be able to

have a clear understanding of the notation of asymptotic growth of functions and be able to use this notation to describe the complexity of computational problems
describe equations for the complexity of algorithms and solve such equations
work with common algorithmic techniques such as dynamic programming, greedy algorithms, etc.
deal with basic problems in areas such as graph algorithms, string matching, computational geometry.

Asymptotic notation and recurrence equations.

Dynamic programming, including Strassen's algorithm for matrix multiplication.

Greedy Algorithms.

Basic Graph algorithms.

Application areas such as String Matching, computational geometry, data compression.

Lectures, lessons, and exercises.

Written exam (3 credits). Assignments (2 credits).