Nyhetsflöde
Logga in till din kurswebb
Du är inte inloggad på KTH så innehållet är inte anpassat efter dina val.
Har du frågor om kursen?
Om du är registrerad på en aktuell kursomgång, se kursrummet i Canvas. Du hittar rätt kursrum under "Kurser" i personliga menyn.
Är du inte registrerad, se Kurs-PM för DD2352 eller kontakta din studentexpedition, studievägledare, eller utbilningskansli.
I Nyhetsflödet hittar du uppdateringar på sidor, schema och inlägg från lärare (när de även behöver nå tidigare registrerade studenter).
Schemahandläggare redigerade 13 maj 2016
D32, D354, D35, E31
how do you know what room you should be in?
@Olof : check your KTH email account. there must be an email with the subject of course code.
inside that email it is mentioned which room you should go ;)
That's strange. Being an SU student, I had to sign up by email. But I'm sure I did and I got a confirmation email back. But I can't find any email about seating.
Are there solutions for last years exam? Also can I find even older exams for this course some where?
Just so I've gotten this right: is the final grade the unweighted mean value of MAS1, MAS2 and Exam even though the exam is worth 3 credits and MAS1 and MAS 2 are only worth 1.5 credits each?
Yes, that's it.
How and when will we be allotted times for the complementary oral exam?
Which grade will you get if you get A:s on the mästarprov and a C on the exam? Do you have to do the complementary exam to get A as the final grade?
I am also wondering if there is any solutions to last years exam?
Hello!
My lab partner and I just finished a lab from the ADK course which we need to present. If I have understood correctly it is possible to present this lab (lab 3, bipartite matching) during the lab times for this course. However I cannot see a schedule containing the times in which we can do this. When will the next lab session be?
///Alexander Tingström & Erik Deng
Alexander och Erik, ADK-labbar kommer att kunna redovisas under labbveckan 2-9 juni. Schema kommer att läggas upp på http://www.csc.kth.se/utbildning/kth/labbvecka/
How are the rules the other way round? In how far are the labs, mästarprov, exam of algokomp and adk exchangable given one is registered for algokomp (and is sufficiently good at Swedish and Swedish to understand the tasks at hand).
Are these exercises supposed to be handed in? Presented orally? And in that case, what are the deadlines?
No, you don't have to do that.
So these are intended to give us some practice?
Yes, that is the meaning.
When will the solutions for Exercise 3 be available? Having the solutions to these exercises available early would help immensely in getting practice well before the labs and other examination moments.
Now.
A can't open any of the exercises. I am getting a 403 error. Can you fix the problem ASAP please?
See the page "Problem with files"
Oh ok, sorry, didn't notice that page. Thank you!
I'm no longer able to access any of the lectures, I get a 403 Forbidden Error.
I have provided a temporal solution. See the page: "Problem with files".
When will the first lab be published?
Probably at the end of this week.
Lab 1 is now published.
Hi,
Are the labs supposed to be done individually or are we allowed to talk about solutions with other students?
You can do them in groups of two. The answers to the theory questions should be written individually and given to the lab assistent. Except from working two and two on the code, you should not collaborate.
Hi,
Some of the links in the document is not working. I also think some of the information might be outdated. For example it says algokomp14.
I have made an update now.
I still can't find algokomp16 on Kattis though...? (the only course offering listed is algokomp15)
Should be fixed now.
Just for clarification, are the theory questions worth 1 point and submitting a working solution to kattis worth 1 point as well? So it is possible to earn 2 points total in lab 1?
Yes, that is correct. But it is not enough just to submit your solution to kattis. You have to present it to a lab assistent.
The first lab should be done in Java. I think I have said something else before but this is what is stated in the problem formulation. More precise, you should modify an existing Java program and make algorithmic improvements. Here are some more comments (in Swedish):
Anledningen till att Java krävs i labb 1 är att uppgiften handlar om att
snabba upp ett existerande Javaprogram med algoritmiska förbättringar. Att
skriva om hela programmet i ett snabbare språk tränar inte samma
färdigheter och skymmer de algoritmiska skillnaderna mellan programmen,
vilket kan göra redovisningen svårare. Dessutom kan man nog undvika att
göra någon av de algoritmiska förbättringarna om man skriver om
programmet i C++.
OK Got it,
Follow up question - Are the theory questions due on the 12th and the programming due on the 19th? Or can they both be presented on the 19th?
If the assistents have time, you can present them both on Feb 12th.
But is it possible to present the theory questions as well on the 19th and still get the bonus point? It is a bit unclear.
No you have to present them on the 12th.
ok thanks :)
Question 6 states "Show with pseudocode how the recursion can be calculated by using dynamic programming, ie how a matrix M can be created." (emphasis mine). However, on one exercise session it was claimed that part of the definition of dynamic programming is that it is iterative rather than recursive. What is the task really?
The idea with dynamic programming is that we have a recursion formula (the recursion referred to above) and with the help of this formula we can iteratively compute "later" values in terms of "earlier" values. So there is no contradiction here.
Are you going to extend the deadline for the theory part of lab1? Qwait is not open and there's more than 40 people that written their names on the white board queue with just one assistant here.
Anytime today is ok.
Are there going to be any more lab sessions than the two after the one today? I feel that it could be problematic if you get stuck since there is very little time to get assistance.
In laboration 1 the theory questions was optionally, is it the same on laboration 2?
Yes!
In lab2: "No monologues are allowed". Does this mean that all scenes must have at least 2 roles in them? Or is it just the equivalent of "Each actor may have only one role in each scene." It says a little further down that "the number of roles is between 1 and n", suggesting that a scene may contain only 1 actor after all.
thanks, Olof K
EDIT: [...] only 1 role after all.
Hello I am having difficulty with understanding the 4th theory question
- "Which is the smallest possible production that satisfies all input constraints for the casting problem and is possible to stage. Specify the input for this production."
What do you mean by "production"? Do you minimum number of actors? Or roles? Or simply an instance?
Also what do you mean by "is possible to stage"? What do you mean by "stage" in this context?
Hi, is there a possibility to present lab2 theoritic work on a day other than the 14th of april? I have to fly back to my homecity that day. Thank you in advance!
I have the same question as above (present lab2 theory on another day than 14th April)
My interpretation of exercise 4 is that the "smallest possible production" is the production that requires the least amount of actors and/or scenes. Is that correct?
By "stage" I think it's meant to be able to perform the play on stage with the given constraints.
I also have a question about the 5th exercise. Is the number of actors, which is asked for, the number of actors that produces that "smallest possible production" or is it something else?
If you can not attend the session on April 14 you can give your theory solutions to Mladen at any earlier date.
In lab 2, are we only supposed to reduce the graph coloring problem to the casting problem or also solve it?
What should the output be? Similar to the instances in the description?
Hi,
Regarding Lab 2.
Should we apply the "divas" constraints when reducing one of the two NP-complete problems to the casting problem?
Should we apply the "divas" constraints to the theory questions 4-6? It is not explicitly specified.
Hello,
I was wondering, what is the input from Kattis is exactly? I've been trying to read the graph, assuming that the edges are given one line at the time as two integers separated by a space, but I continue to get a NumberFormatError. If we could get some specifications as to how the input is formatted so we can know how to read it properly that would be very helpful.
Thanks a lot!
An update has been made to Lab 2
What exactly is the update to the lab? I've been working on the lab and I don't see any difference in the assignment.
Thank you
The links are ok now.
I still can't see any difference, the Kattis pages only consist of a title and a submit-page.
To clarify what the task is in Lab 2: Should the output of our program be equal to the input to the casting problem, as exemplified in the instructions?
It was a problem with the links to the submit-page it seems as it they didn't work for everyone.
Your output should be an input to the casting problem.
Does each role need to be in at least one scene for a valid casting problem? If not, does actor 1 and 2 need to be in a scene or just assigned a role?
What format does Kattis input to the program have?
Will it be separated by commas or white spaces?
@Oskar, it seems the Kattis input has leading whitespace
16 of my test cases are accepted on Lab 2 (NP reduction 1) but then I get the error message "Output Limit Exceeded". What does this mean?
I solved it. I had simply literally constructed a solution that had too much output and I was able to construct a different solution with much less.
We are trying to reduce the Graph coloring problem, but its passes 5 tests and shows this:
The judge failed to verify your reduction. It is possible that your reduction is correct - and that it is wrong. However, it is possible to accomplish more compact reductions, that can be verified by the judge.
What does it mean? I'm pretty sure our reduction is correct...
Hi,
Another question, I presented both parts of LAB 2 last week but have not been given any points/marks for it.
Are all the presentations going to be marked after today's session?
Yes.
Schemahandläggare redigerade 11 april 2016
Fredag 22 april 2016 kl 13:00 - 157:00
Schemahandläggare redigerade 11 april 2016
Torsdag 14 april 2016 kl 15:00 - 178:00
Schemahandläggare redigerade 1 februari 2016
D4E2
Schemahandläggare redigerade 26 februari 2016
E2
What building is this in? Booking page just says room 1523
Schemahandläggare redigerade 1 februari 2016
E53
Schemahandläggare redigerade 26 februari 2016
E3
Schemahandläggare redigerade 1 februari 2016
D35M33
Schemahandläggare redigerade 15 februari 2016
M33D34
Schemahandläggare redigerade 1 februari 2016
D42Q31
Schemahandläggare redigerade 1 februari 2016
D42Q33
Schemahandläggare redigerade 1 februari 2016
D42Q33
Schemahandläggare redigerade 1 februari 2016
D42Q34
Schemahandläggare redigerade 1 februari 2016
D42Q33
Schemahandläggare redigerade 1 februari 2016
D42Q34
Schemahandläggare redigerade 1 februari 2016
E53Q34
Schemahandläggare redigerade 1 februari 2016
D42Q34
Schemahandläggare redigerade 1 februari 2016
E53Q34
Schemahandläggare redigerade 1 februari 2016
D35Q33
Schemahandläggare redigerade 1 februari 2016
E33Q34
Länkarna Aim och Required går inte att nå. Jag är inloggad och registrerad på kursen, men tycks sakna rätt att läsa sidorna.
I think it is fixed now.
Good! Now I can read them.
Is the book under Required Reading important course litterature?
This is the first time I see it, and I think I have read all pages carefully at least twice.
Yes, I would say it is important.
Schemahandläggare redigerade 19 januari 2016
D3L52
Schemahandläggare redigerade 19 januari 2016
B24L52
Schemahandläggare redigerade 19 januari 2016
E36Q34
Schemahandläggare redigerade 19 januari 2016
D35L51
Schemahandläggare redigerade 19 januari 2016
E33L51
Hello, I was wondering what textbook do the readings in the schedule correspond to?
The coursebook is
Kleinberg, Tardos; Algorithm Design, Pearson Addison-Wesley.