Syllabus for Algorithms and Data Structures II

Algoritmer och datastrukturer II

Syllabus

  • 5 credits
  • Course 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)
  • Established: 2009-03-12
  • Established by: The Faculty Board of Science and Technology
  • Revised: 2010-04-23
  • Revised by: The Faculty Board of Science and Technology
  • Applies from: week 27, 2010
  • Entry requirements: Mathematics, 15 credits, and Computer Science, 30 credits, including Algorithms and data structures I or the equivalent.
  • Responsible department: Department of Information Technology

Learning outcomes

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.


  • deal with basic problems using graph algorithms, string matching, computational geometry and flow networks.

Content

Asymptotic notation and recurrence equations. Data structures for disjoint sets. Dynamic programming. Greedy algorithms. Graph algorithms such as shortest path and minimum spanning tree. Maximum flow problems in flow networks. Applications of string matching, computational geometry, data compression.

Instruction

Lectures, lessons, and exercises.

Assessment

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

Reading list

Reading list

Applies from: week 27, 2009