The contents may vary from one year to another, and is described more closely on the web page of the current course offering.
FDD3343 Seminars on Theoretical Computer Science 7.5 credits

Information per course offering
Course offerings are missing for current or upcoming semesters.
Course syllabus as PDF
Please note: all information from the Course syllabus is available on this page in an accessible format.
Course syllabus FDD3343 (Spring 2017–)Content and learning outcomes
Course contents
Intended learning outcomes
On completion of the course, a student should be able to: discuss advanced concepts within the area of the course, attack problems within the area of the course actively, both through own work and through search of relevant information (e g in scientific literature), profit from the essential contents of scientific articles within the area of the course.
Literature and preparations
Specific prerequisites
Knowledge equivalent to one of the courses DD1352 Algorithms, data structures and complexity or DD2352 Algorithms and complexity. The course assumes mathematical maturity.
Literature
Examination and completion
If the course is discontinued, students may request to be examined during the following two academic years.
Grading scale
Examination
Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.
The examiner may apply another examination format when re-examining individual students.
Practical assignments. Sometimes production of lecture notes.
Examiner
Ethical approach
- All members of a group are responsible for the group's work.
- In any assessment, every student shall honestly disclose any help received and sources used.
- In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.