Third-Cycle Courses

Faculty of Engineering | Lund University

Details for the Course Syllabus for Course FRT310F valid from Autumn 2023

Printable view

  • The course's objective is to provide participants with an increased understanding of algorithms and their practical applications in C/C++.
  • The course is offered as a seminar series. The following subjects will be covered: dynamic programming, graph algorithms, square root techniques, flows, matchings, cuts, Fenwick, segment trees, treaps, topological sorting, tries, suffix arrays, and computational game theory.
Knowledge and Understanding
  • For a passing grade the doctoral student must
  • have a comprehensive understanding of the syntax, semantics, and type system of the C/C++ -programming languages.
    understand theoretical algorithms and their time complexity.
Competences and Skills
  • For a passing grade the doctoral student must
  • independently solve a variety of practical problems with the correct time complexity.
    be able to identify the problem class to which a given problem belongs.
    create a conceptual solution to a given problem and assess whether C/C++ is a suitable option.
Judgement and Approach
  • For a passing grade the doctoral student must
Types of Instruction
  • Seminars
  • Self-study literature review
  • The course is provided as a seminar series of a total of 14 meetings.
Examination Formats
  • Written assignments
  • Each week, a set of around 10 tasks will be presented for the students to solve, and these will serve as the students' examinations.
  • Failed, pass
Admission Requirements
Assumed Prior Knowledge
  • Basic knowledge of complexity theory, good coding practices, and algorithms.
Selection Criteria
  • Laaksonen, A.: Guide till Tävlingsprogrammering: Lära och förbättra algoritmer genom tävlingar. Springer Nature Computer Science, 2020. ISBN 9783030393571.
Further Information
Course code
  • FRT310F
Administrative Information
  • 2023-10-23
  • Maria Sandsten

All Published Course Occasions for the Course Syllabus

No matching course occasions were found.

0 course occasions.

Printable view