DD2441 Seminars on Theoretical Computer Science 6.0 credits

• Educational level

  Second cycle

• Academic level (A-D)

  D

• Subject area

  Information Technology
  

• Grade scale

  A, B, C, D, E, FX, F

• Course web page

• Course page on KTH Social

Learning outcomes

After a successfully completed course the student will be able to:

discuss advanced concepts within the area of the course,

actively attack problems in the area of the course, both through independent work and through finding relevant information elsewhere,

extract and understand the essential content of scientific articles in the area of the course.

Course main content

The syllabus will vary between years. Examples of subjects are:

• algorithms for approximation
• data mining
• cryptography
• parallel computations
• probabilistic algorithms.

Eligibility

Prerequisites

Can vary between years, but knowledge corresponding to one of the courses 2D1352/DD1352 Algorithms, Data Structures, and Complexity and 2D1354/DD2354 Algorithms and Complexity will always be needed. The instructor can give more information.

Literature

To be announced at least 4 weeks beofre the course starts at course web page.

Examination

• ÖVN1 - Exercises, 6.0 credits, grade scale: A, B, C, D, E, FX, F

In this course all the regulations of the code of honor at the School of Computer science and Communication apply, see: http://www.kth.se/csc/student/hederskodex/1.17237?l=en_UK.

Requirements for final grade

Written exercises (OVN1; 6 university credits).

Offered by

CSC/Computer Science

Contact

Jakob Nordström, e-post: jakobn@kth.se

Examiner

Jakob Nordström <jakobn@kth.se>

Supplementary information

The course is given at irregular intervals. The course is given in swedish or english depending on the participants skills and wishes.

Add-on studies

Please discuss with the instructor.

Version

Course plan valid from: Autumn 09.
Examination information valid from: Autumn 07.