Subject Matter

This lecture gives an introduction to basic algorithms and various datastructures. It deals mainly with sorting and hashing algorithms, datastructures and algorithms for trees, as well as time- and memory complexity measures.

Mailing List

There is a mailing list for this lecture (ad-ss06@lists.deri.org) to which all students participating in the exercises will automatically be subscribed. For all other students that do not have an automatic subscription and those who only participate in the lecture are asked to subscribe themselves under http://lists.deri.org/mailman/listinfo/ad-ss06.

Lectures

Programme		Material
Thu 02.03.	Introduction & Basic Principles	pdf	6up
Thu 09.03.		pdf	6up
Thu 16.03.		pdf	6up
Thu 23.03.		pdf	6up
Thu 30.03.		pdf	6up
Thu 06.04.		pdf	6up
Thu 27.04.		pdf	6up
Thu 04.05.		pdf	6up
Thu 11.05.		pdf	6up
Thu 18.05.		pdf	6up
Thu 01.06.		pdf	6up
Thu 08.06.		pdf	6up
Thu 22.06.		pdf	6up
Thu 29.06.		pdf	6up

Exercises

The first tutorial will be held for all students on March 6, 2006 from 08:30-09:30 in HS-A

Group 1:	Monday, 08:00-10:00	SR13
Group 2:	Monday, 16:00-18:00	SR12
Group 3:	Monday, 08:00-10:00	SR24
Group 4:	Monday, 16:00-18:00	SR24

Programme		Material
Mon 06.03.	Introduction (08:30-09:30 in HS-A)	pdf
Mon 13.03.	Ü1	pdf	groups
Mon 20.03.	Ü2	pdf
Mon 27.03.	Ü3	pdf
Mon 03.04.	Ü4	pdf
Mon 24.04.	Ü5	pdf	groups
Mon 08.05.	Ü6	pdf
Mon 15.05.	Ü7	pdf
Mon 22.05.	Ü8	pdf	groups
Mon 29.05.	Ü9	pdf
Mon 12.06.	Ü10	pdf
Mon 19.06.	Ü11	pdf
Mon 26.06.	Ü12	pdf

Type

VO2/UE2

Lecturer

Thomas Strang
thomas.strang@deri.org

Tutors

Reto Krummenacher
Harald Grossauer
Martin Mössner
Hannes Sailer

Time

Thursdays 12.00 to 2.00 pm,
HS B

Language

German