LEA
Department of Computer Science at the Technische Universität München
Chair for Efficient Algorithms
Postal address: 80290 München; Premises: Arcisstr.21, 80333 München
deutsch

Discrete Structures II (SS 98)


* Lecturer:
Prof. Dr. Angelika Steger

* Area:
3+1 lectures per week in undergraduate studies
compulsory course

* Time and Place:
Wed 9h c.t. - 10:00, lecture hall S1128
Fri 8:30 - 10:00, lecture hall S1128

* Exercises:
1 hours per week central exercises accompanying the lectures
Tue 12h c.t. - 13:00, lecture hall 2750
Teaching Assistant: Tom Friedetzky
Course Certificate: To get a course certificate students must pass the final exam.

* Results of the final exam.
* Audience:
undergraduate students of computer science

* Prerequisites:

* Recommended for:
Vordiplom

* Contents:
  • Finite probability spaces
    • Def. probability space, events, random variable
    • Some distributions
    • Markov and Chebychev inequalities
  • Infinite probability spaces
    • Normal distribution, exponential distribution
    • Central limit theorem
  • Stochastic processes
    • Markov chains
    • Queues
  • Statistics
    • Estimation variables
    • Confidence intervals
    • Checking of hypotheses
  • Further Highlights
    • Primality tests
    • Computing the median

* Related and Advanced Lectures:
Graduate courses

* Lecture Notes:
here (in german)

* References:
M. Greiner, G. Tinhofer:
Stochastik für Informatiker
Carl Hanser Verlag, 1996
H. Gordon:
Discrete Probability
Springer-Verlag, 1997
R. Motwani, P. Raghavan:
Randomized Algorithms
Cambridge University Press, 1995
L. Fahrmeir, R. Künstler, I. Pigeot, G. Tutz:
Statistik -- Der Weg zur Datenanalyse
Springer-Verlag, 1997

* Office Hours:
look here


steger@informatik.tu-muenchen.de