252-0209-00L  Algorithms, Probability, and Computing

SemesterAutumn Semester 2017
LecturersE. Welzl, M. Ghaffari, A. Steger, D. Steurer, P. Widmayer
Periodicityyearly course
Language of instructionEnglish



Catalogue data

AbstractAdvanced design and analysis methods for algorithms and data structures: Random(ized) Search Trees, Point Location, Minimum Cut, Linear Programming, Randomized Algebraic Algorithms (matchings), Probabilistically Checkable Proofs (introduction).
ObjectiveStudying and understanding of fundamental advanced concepts in algorithms, data structures and complexity theory.
Lecture notesWill be handed out.
LiteratureIntroduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest;
Randomized Algorithms by R. Motwani und P. Raghavan;
Computational Geometry - Algorithms and Applications by M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf.

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
ECTS credits8 credits
ExaminersE. Welzl, M. Ghaffari, A. Steger, D. Steurer, P. Widmayer
Typesession examination
Language of examinationEnglish
Course attendance confirmation requiredNo
RepetitionThe performance assessment is only offered in the session after the course unit. Repetition only possible after re-enrolling.
Mode of examinationwritten 180 minutes
Additional information on mode of examinationThere will be a written midterm exam and a written final exam. Script or any other supplementary material for either exam is not permitted. The grade of the midterm exam amounts to 20% and the grade of the final exam to 60% of the final grade. Extra reading material will be distributed and two special graded assignments - related to this reading material - handed out during the course. The grade of the special assignments amounts to 20% of the final grade.
Written aidsKeine Hilfsmittel erlaubt.
This information can be updated until the beginning of the semester; information on the examination timetable is binding.

Learning materials

 
Main linkInformation
Only public learning materials are listed.

Courses

NumberTitleHoursLecturers
252-0209-00 VAlgorithms, Probability, and Computing4 hrs
Mon13-15CAB G 51 »
Tue14-16CAB G 51 »
E. Welzl, M. Ghaffari, A. Steger, D. Steurer, P. Widmayer
252-0209-00 UAlgorithms, Probability, and Computing2 hrs
Wed13-15CAB G 56 »
13-15CHN D 44 »
16-18CAB G 52 »
E. Welzl, M. Ghaffari, A. Steger, D. Steurer, P. Widmayer
252-0209-00 AAlgorithms, Probability, and Computing
Project Work, no fixed presence required.
1 hrsE. Welzl, M. Ghaffari, A. Steger, D. Steurer, P. Widmayer

Restrictions

There are no additional restrictions for the registration.

Offered in

ProgrammeSectionType
Computer Science BachelorMajor in Theoretical Computer ScienceOInformation
Computer Science BachelorMajor: Theoretical Computer ScienceOInformation
Computer Science Teaching DiplomaPart 2WInformation
Mathematics BachelorCore Courses: Applied Mathematics and Further Appl.-Oriented FieldsWInformation