Introduction to Algorithms and Data Structures, Spring 2005

Breaking News

April 26, 2005: At the last lecture we will discuss last semesters exam. Have a look at it before the lecture, if possible.
February 25, 2005: Pseudocodes presented at lecture 4 are available on the plan of the episode
February 24, 2005: The reading material for Episode 5 will be distributed tomorrow, at the February 25 lecture (I will leave the leftovers in the course's pigeon whole, so go there after the lecture if you missed it).
February 17, 2005: Big week assignment 1 has been already published to your greater benefit. There is still lots of time until the deadline, but we recommend starting early. Some comments on the assignment will be given during the lecture on Feb 25.
February 17, 2005: We will use this article in the lecture on February 25th. Please grab the PDF version. Note that you need an ACM subscription to get it (Fortunately ITU is subscribed as an institution so you can get it freely by using a browser on any of the campus' workstations).
February 9, 2005: Description of Episode 2, including exercises, is avaliable now.
February 9, 2005: The course homepage was gone for a while. My fault(Anna). Sorry about that.
February 3, 2005: New room for exercise sessions. Exercises will be in room 3A14. (Note, no exercise session February 4.)
January 24, 2005: Lectures will be in room 2A12.
December 13, 2004: The (non-obligatory) primer in discrete math will be held on Monday, January 24, 9:00-12:00, room 2A12. Check whether you should consider coming.
November 19, 2004: Everybody is cordially invited to Math Primer in the week preceeding the introduction week. Time and place is not decided yet.

Time and Place

Lectures: Friday 9:00-12:00, Room 2A12.

Tutorials: Friday 13:00-16:00, Room 3A14.

Teachers

Lecturers	Office
Anna Pagh (annao@itu.dk)	3C11
Andrzej Wąsowski (wasowski@itu.dk)	4E07

You are welcome with any problems, concerns, questions etc. regarding the contents, organization, style etc. of the course including exercises. You are welcome to contact the teachers any time you can catch her/him.

Teaching Assistant : Esben Rune Hansen (esben@itu.dk)

Textbook

T.H.Cormen, C.E.Leiserson, R.L.Rivest, C.Stein. Introduction to Algorithms. 2nd ed. The MIT Press (2001). ISBN 0-262-53196-8. Available in IT-bogladen, on the right of the information in the main hall (599 kr).

Newsgroup

Please post questions and comments to the IADS newsgroup (it-c.courses.IADS) so that others may answer your questions and/or share your insights. Feel free to answer each other's questions and comment on messages. The newsgroup is our discussion forum. Sending and receiving news messages is very similar to sending and receiving e-mails. You can use mozilla, the standard mail&news client at ITU, to read the newsgroups. Ask SysAdm if you need help setting up your software for reading news. There is also this information about newsgroups, available from SysAdm.

Assignments

Now, here, you see, it takes all the running you can do, to keep in the same place.
L. Carroll

Mandatory assignments earn students points towards eligibility for admission to the exam. Assignments are graded, and students must achieve 70% of the maximum possible point sum to qualify for the exam.

Mandatory weekly assignments are marked with the letter (M) on pages describing Episodes' details.

Instructors Page

Here you can see how well you are doing with your mandatory assignments. You can also check out old exam set from previous semesters and find some various informations concerning the exercise sessions. To enter click here.