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.

Exercises

starting March 10, 2005
Group 1: Thu, 1000am - 1130am, RR19
Group 2: Thu, 1145am - 0115pm, RR19
Group 3: Thu, 1000am - 1130am, RR20
Group 4: Thu, 1145am - 0115pm, RR20
Group 5: Thu, 1000am - 1130am, RR18
Group 6: Thu, 1145am - 0115pm, RR18
Group 7: Thu, 1000am - 1130am, RR14

Schedule

Exercises

Final Exam

written, June 30, 2005 2 p.m. - 4 p.m. HS-E

Please find the exam results here!

Information:
- 90 Minutes - no additives allowed - only bring a pen, paper will be provided - bring your Student's Card!

Alternative exams:

October 6, 2005 12 p.m. - 2 p.m. HS A

oral, please contact Thomas Strang

Please find the results of the exam on October 6 here!

Final mark

There is a written exam on the lecture content at the end of the semester. We offer exams at three different dates for students to choose. Students are not required to attend the lecture, but they must show up in the exam.

Lecturer

Thomas Strang
thomas.strang@deri.org

Tutors

Reto Krummenacher
Martin Mössner
Livia Predoiu
Hannes Sailer
Josef Strasser-Leitner

Coordinator

Livia Predoiu
livia.predoiu@deri.org

Time

Thursdays, 2:00 to 4:00 pm, HS E

Language

German