Schedule
The following list contains the schedule of the course. Small changes
are possible.
Follow the newsgroup
January
Week Topic
26-30.1
-
Linear structures: arrays, lists, stacks, queues
February
9-13.2
16-20.2
-
Applications of trees
Search structures: arrays, lists, binary search trees
23-27.2
-
Binary search trees, balanced trees: AVL trees, red-black trees
March
2-6.3
-
B-trees, digital search trees, tries
9-13.3
-
Hashing
-
Application exercises 1, deadline 9.3
16-20.3
-
Sorting methods
-
Basic exercises 2, deadline 16.3
23-27.3
April
30.3-3.4
-
Graph algorithms
-
Basic exercises 3, deadline 30.3
6-10.4
-
Graph algorithms
-
Application exercises 2, deadline 6.4
13-17.4
20-24.4
-
Graph algorithms, string algorithms
-
Basic exercises 4, deadline 20.4
27-1.5
May
4-8.5
-
Conclusion
-
Basic exercises 5, deadline
-
Application exercises 5, deadline
18.5 Examination
June
Results of the exam published in mid June.
Summer
Extra exercises, deadline at the end of September.
Tämän sivun sisällöstä vastaavat/This page is maintained by
kurssin assarit,
E-mail: tik76122@hut.fi.
Sivua on viimeksi päivitetty/The page has been updated 29.06.1998.
URL: http://www.niksula.cs.hut.fi/~tik76122/k98/yleista/Course_schedule.html