Skolan för
datavetenskap
och kommunikation
KTH / CSC / Kurser / DD2440 / avalg11 / Nyheter

# Nyheter

### 2012-02-22

Hjälp oss förbättre utbildningen genom att fylla i kursenkäten. Tack.

Tryck här för att hämta kursenkäten:

### 2012-02-12

The TSP report has now been graded and all results should be in "rapp". It may take a day or two before you see it in "Mina sidor".

### 2012-01-30

For various reasons, such as me being only 50% at KTH, we have not yet managed to grade the TSP projects. We are working at them and hope to complete them by next week.

I apologize for any inconvenience this causes.

### 2011-12-01

Homeork D is now available.

### 2011-11-24

Today I sent a mail with changes in deadlines for project 2 and homework D. Please be aware of those changes.

### 2011-11-20

• Projektredovisningen innebär diskussion av och frågor om uppgiften och rapporten. Ni behöver inte förbereda en presentation.
• För att lärarna ska kunna se dina resultat på Kattis behöver du logga in på Kattis. Sedan går du till sidan https://kth.kattis.scrool.se/courses?id=48 och klickar på en länk under kursnamnet för att markera att du följer kursen.

### 2011-11-19

• Problem 1: You will make calls to both FFT and FFT-inverse. For each call to one of these, show which recursive calls are made from the top level. For example, for a call to FFT from the multiplication algorithm, show what parameters it gets, what recursive calls it makes, what is returned from the recursive calls, and how those return values are used.
• Problem 4: You do not need to find an example where Nearest Neighbor fails no matter which city you start at. It is enough that NN fails for a particular starting city. Please note that your example should be an instance of Euclidian TSP, that is, the cities are points in R2.
• On not searching the web for answers: Searching for information related to the area covered by the problems is fine, but avoid searching for or reading solutions to precisely these problems. For instance, it is probably easy to Google for an example that solves problem 4, and this is what I want you to avoid.

### 2011-11-03

Inputs for the factoring problem have been reordered. Please see project 1 page.

### 2011-10-24

Homework B posted. Deadline is Nov 7 (not Nov 4 as stated in class today).

### 2011-10-07

Deadline for homework A moved. See homework page.

### 2011-09-27

Välkommen till första föreläsningen, 2011-09-28, kl 10:00-12:00 i v1.

Sidansvarig: Mikael Goldmann <migo@kth.se>