Syllabus for Algorithms and Data Structures II
Algoritmer och datastrukturer II
A revised version of the syllabus is available.
- 5 credits
- Course code: 1DL231
- Education cycle: First cycle
Main field(s) of study and in-depth level:
Computer Science G2F
Explanation of codes
The code indicates the education cycle and in-depth level of the course in relation to other courses within the same main field of study according to the requirements for general degrees:
- G1N: has only upper-secondary level entry requirements
- G1F: has less than 60 credits in first-cycle course/s as entry requirements
- G1E: contains specially designed degree project for Higher Education Diploma
- G2F: has at least 60 credits in first-cycle course/s as entry requirements
- G2E: has at least 60 credits in first-cycle course/s as entry requirements, contains degree project for Bachelor of Arts/Bachelor of Science
- GXX: in-depth level of the course cannot be classified
- A1N: has only first-cycle course/s as entry requirements
- A1F: has second-cycle course/s as entry requirements
- A1E: contains degree project for Master of Arts/Master of Science (60 credits)
- A2E: contains degree project for Master of Arts/Master of Science (120 credits)
- AXX: in-depth level of the course cannot be classified
- Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
- Established: 2012-03-08
- Established by:
- Revised: 2018-08-30
- Revised by: The Faculty Board of Science and Technology
- Applies from: Autumn 2019
60 credits of which 15 credits in mathematics and 30 credits in computer science including Algorithms and Data Structures I.
- Responsible department: Department of Information Technology
On completion of the course, the student should be able to:
- use the notation of asymptotic growth of functions and be able to use this notation to describe the complexity of algorithms and computational problems
- derive 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 using graph algorithms, string matching and flow networks.
- define the complexity classes P and NP, and discuss the open question whether P=NP.
- present and discuss topics related to the course content orally and in writing with a skill appropriate for the level of education.
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 problem in flow networks. Algorithms for string matching. Theory of intractable problems.
Lectures, lessons, and exercises.
Written exam (3 credits). Assignments (2 credits).
If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.
- Latest syllabus (applies from Autumn 2023)
- Previous syllabus (applies from Autumn 2022)
- Previous syllabus (applies from Autumn 2019)
- Previous syllabus (applies from Spring 2013)
- Previous syllabus (applies from Autumn 2012, version 3)
- Previous syllabus (applies from Autumn 2012, version 2)
- Previous syllabus (applies from Autumn 2012, version 1)
Applies from: Autumn 2019
Some titles may be available electronically through the University library.
Cormen, Thomas H.
Introduction to algorithms
3. ed.: Cambridge, Mass.: MIT Press, cop 2009
Boston, Mass.: Pearson/Addison-Wesley, cop. 2006