T-106.250 Data Structures and Algorithms T
T-106.253 Data Structures and Algorithms Y
(3-5 ocr)

Course overview / Spring 2005

0. Introduction

T-106.250 is only for students of T-programme. Other students will take the course T-106.253, Data Structures and algorithms Y.

The course exercises are valid for one year, and old exercises done last year are not accepted for the course anymore. If you did not pass the last year's course, you must study the whole course again.

You will have four chances to take the course examination: the mid-term exams and three separate examinations. The last examination will be held in early 2006. Other course exercises must be completed during the spring.

1. Goals

The goals of the course are as follows.

1. Learn essential data structures and algorithms
2. Learn basics of algorithm analysis
3. Achieve skills to design and analyse simple algorithms.

2. Required previous knowledge

Students are required to understand simple programs written in an imperative programming language. During the course example programs will be written in Java, C, Pascal or in pascal-like pseudo language.

Students should also be familiar with use of e-mail and World Wide Web. Such skills are required to do exercises.

3. Following the course trough

Lectures (both T- & Y-courses) are held in lecture hall M on Tuesdays 14.15-17.00 .  The first lecture is on January 18th.

Lectures are given in Finnish.

T-version (T-106.250) includes following compulsory parts

• Exercises. Half of the exercises are done independently in the Web, using the TRAKLA2 environment. The other half is done in class. There will be six exercise rounds. Deadlines are approximately every other week.
• One exercise group is meant for English speaking students. Further information will be posted on the course www pages.
2. Exam

Students who take the T-version of the course can also do a voluntary design exercise. It will give one extra old credit (ocr) for the course. The design exercise is the same exercise as in the Y-version.

Y-version (T-106.253) includes following compulsory parts

1. Basic exercises
• In the basic exercises students will simulate workings of algorithms. Trakla system will be used to do the exercises. Basic exercises are personal.
2. Design exercise
• In the design exercise students will examine a more complicated problem and design data structures and algorithms to solve it. They must also give full reason for their solution. The design exercise will be done in small groups.
3. Exam

3.1 Credits

Taking the T-version will give 3-4 old credits. Students who do a voluntary design exercise will get four old credits.

Taking the Y-version will give 3 old credits.

3.2 Grade

T-course without the design exercise: min{1, C, E} * round(0.4*C + 0.6*E)

T-course with the design exercise: min{1, C, D, E} * round(0.3*C + 0.3*D + 0.4*E)

Y-course: min{1, B, D, E} * round(0.3*B + 0.3*D + 0.4*E)

4. Staff

Lectures will be given by professors Lauri Malmi and Ari Korhonen. The head assistant for the course is Jussi Nikander. Other assistants for the course are Jan Grö:ndahl, Kari Kähkönen, Mikko Lahola, Henri Ossi, Vesa Pirilä and Matti Risteli. Vesa Pirilä is the Foreign student advisor.

5. Study material

The course book for the T-course is T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein: Introduction to algorithms(2nd edition).

The course book for the Y-course is M.A. Weiss: Data Structures and Algorithm Analysis in Java.

The following books can be used as sources for additional information:

• Anany Levitin: The Design & Analysis of Algorithms
• S. Sahni: Data Structures, Algorithms, and Applications In Java
• W.J. Collins: Data Structures and the Java Collections Framework

Handouts are written in Finnish.

Some links to additional material can be found at the page http://www.cs.hut.fi/Opinnot/T-106.250/materiaali/k2005/. The page is in Finnish, but the relevant links can be found at the very bottom of the page.

6. Communication

• T-version: http://www.cs.hut.fi/Opinnot/T-106.250/
• Y-version: http://www.cs.hut.fi/Opinnot/T-106.253/

Foreing students should contact the foreign student advisor, if they have any questions.

7. Enrollment

Enrollment for the course is done trough webtopi. It is Furthermore, students must register to the TRAKLA2 exercise system in order to be able to solve the basic exercises. Further information can be found at the course web pages.