Uni-Logo
Algorithms and Complexity
 


Graduate Course
"Theory I"
Summer term 2010
Junior-Prof. Dr. Robert Elsässer



Lectures

Tuesday, 16-18, SR 00-010/14, building 101, and Wednesday, 16-18 , SR 01-009/13, building 101.
The Wednesday lecture will be held every two weeks.

Course description
Central topics of this lecture include:

- Introduction to algorithm design and analysis
- Introduction to complexity theory
- Introduction to database algorithms

The goal of this course is to improve your knowledge on data structures and algorithms, as well as database systems. To achieve this goal, some basic knowledge of standard data structures and algorithms are required. Mathematical tools and methods, usually taught in the first two years of a bachelor program in computer science, are frequently used in this lecture.

Exercise courses
The exercise courses are supervised by Marco Muniz and take place every two weeks on Wednesday 16-18, SR 01-009/13, building 101 (alternating with the lectures, see above).

Exercise assignments

Your solutions should be delivered to the designated lockbox in building 051 floor 00


The assignments will follow the schedule:

Exercice Sheets Release Hand in by
Assignment 0 21.04. no points
Assignment 1 28.04. 06.05.
Assignment 2 12.05. 20.05.
Assignment 3 02.06. 10.06.
Assignment 4 16.06. 24.06.
Assignment 5 30.06. 08.07.
Assignment 6 14.07. 22.07.



Reading assignments

You are encouraged to work in groups of two.

* Assignment 1

- Read the following paper on Cuckoo Hashing and write a review in your own words with up to 4 pages.
- Submit your review before Wed. the 23th Jun. to the designated lockbox on building 051 floor 00

* Assignment 2

- Write to Marco Muñiz asking for the assignment details.
- Submit your review before Fri. the 23th Jul. to the designated lockbox on building 051 floor 00.


Schedule

Week 1 (18. - 24. April) Tue Lecture Wed Lecture
Week 2 (25. - 01. May) Tue Lecture
Tue 18:00 - 19:30 exercise session
(Sheet 0, no points)
Wed Lecture
Week 3 (02. - 08. May) Tue Lecture Wed Lecture
Week 4 (09. - 15. May) Tue Lecture exercise session (Sheet 1)
Week 5 (16. - 22. May) Tue Lecture Wed Lecture
Week 6 (23. - 29. May) Pentecost Holiday
Week 7 (30. - 05. June) Tue Lecture exercise session (Sheet 2)
Week 8 (06. - 12. June) Tue Lecture Wed Lecture
Week 9 (13. - 19. June) Tue Lecture exercise session (Sheet 3)
Week 10 (20. - 26. June) Tue Lecture Wed Lecture
Week 11 (27. - 03. July) Tue Lecture (moved to 106-00-007) exercise session (Sheet 4)
Week 12 (04. - 10. July) Tue No Lecture Wed No Lecture
Week 13 (11. - 17. July) Tue Lecture
Tue 18:00 - 19:30 exercise session
(Sheet 5)
Wed Lecture
Week 14 (18. - 24. July) Tue Lecture Wed Lecture
Week 15 (25. - 31. July) Mon 16:00 - 17:30 exercise session
(Sheet 6) Building 78 Room 00-014



Material
The slides and recordings are available on our Webserver.
The slides are developed in collaboration with Prof. Dr. Th. Ottman, Prof. Dr. P. Thiemann and Prof. Dr. G. Lausen.

Credit points
Successful participation gives 6 ECTS points (SWS 3).

Curriculum
Master of Science (Applied Computer Science)

Final exam
* On 01.09.2010 at 14:00 in Building-room 101-036.
* You may use during the exam an A4 page with handwritten notes.