Stochastics for Computer ScienceModule description #20217 / Version 5
- 9 CP
- Written exam
- Graded
- Summer semester
- German
| Module / Version | #20217 / #5 |
|---|---|
| Validity | Since WS 2019/20 |
| Available language(s) | English, German |
| Credit points | 9 |
| Person responsible for the module | Hammer, Matthias |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät II |
|---|---|
| Institute | Institut für Mathematik |
| Academic chair | Not specified |
Contact
| Office | Not specified |
|---|---|
| Contact person | Not specified |
| E-mail address | mathe-service@math.tu-berlin.de |
| Website | https://www.math.tu-berlin.de/mathematik_service/ |
Learning outcomes
Mastery of stochastic modeling as a foundation for applications. Acquisition of basic statistical skills and the fundamentals of discrete probability theory as well as stochastic algorithms.
Content
- Events, probability spaces, discrete random variables, important discrete distributions
- Conditional probability, Bayes’ theorem, independence, joint distribution, conditional distribution
- Expectation, variance, covariance, correlation
- Random variables with density functions, important examples
- Law of large numbers, Central Limit Theorem, Chebyshev’s inequality (overview, without proofs)
- Parameter estimation, maximum likelihood
- Correlation, regression
- Confidence intervals
- Hypothesis testing
- Markov chains, stationary distributions
- Queues
- Branching processes, random (binary) trees
- Markov Chain Monte Carlo
- Randomized algorithms
- Conditional probability, Bayes’ theorem, independence, joint distribution, conditional distribution
- Expectation, variance, covariance, correlation
- Random variables with density functions, important examples
- Law of large numbers, Central Limit Theorem, Chebyshev’s inequality (overview, without proofs)
- Parameter estimation, maximum likelihood
- Correlation, regression
- Confidence intervals
- Hypothesis testing
- Markov chains, stationary distributions
- Queues
- Branching processes, random (binary) trees
- Markov Chain Monte Carlo
- Randomized algorithms
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Stochastik für Informatiker (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 4 h | 60 h |
| Pre/post processing | 15 | 4 h | 60 h |
| 120 h | |||
Stochastik für Informatiker (Tutorial)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Pre/post processing | 15 | 6 h | 90 h |
| 120 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Exam preparation | 1 | 30 h | 30 h |
| 30 h | |||
The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.
Description of teaching and learning methods
Lecture, using multimedia tools to the extent technically feasible. Weekly homework assignments. Small-group exercises.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Strongly recommended: Calculus I and Linear Algebra for Engineering
Mandatory requirements for the module examination registration:
The examination requirements could not be retrieved.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | German |
Exam description
[Contains machine generated translations 2026-07-07 11:17, only the German version is legally binding]
Written exam. Prerequisite: Proof of achievement based on homework assignments.
Written exam. Prerequisite: Proof of achievement based on homework assignments.
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Registration for the tutorials is done electronically. For more information, visit: www.moses.tu-berlin.de/tutorien/anmeldung/.
Recommended reading, lecture notes
Lecture notes
available
Electronic lecture notes
available – https://www.math.tu-berlin.de/mathematik_service/literatur/skripte/
Recommended literature
- H.O. Georgii: Stochastik. De Gruyter 2015
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Computational Engineering Science (Informationstechnik im Maschinenwesen) StuPO 2018 (17.01.2018) | SS 2025 | 1. Kernbereich 1: Informatik und Mathematik |
| WS 2025/26 | 1. Kernbereich 1: Informatik und Mathematik | |
| SS 2026 | 1. Kernbereich 1: Informatik und Mathematik | |
| WS 2026/27 | 1. Kernbereich 1: Informatik und Mathematik | |
| Computer Science Computer Science (B. Sc.) - StuPO 2015 | SS 2025 | Pflichtbereich |
| WS 2025/26 | Pflichtbereich | |
| SS 2026 | Pflichtbereich | |
| WS 2026/27 | Pflichtbereich › Grundlagen der Mathematik | |
| Engineering Science StuPO 2007 (19.12.2007) | SS 2025 | 1. Mathematische Methoden |
| WS 2025/26 | 1. Mathematische Methoden | |
| SS 2026 | 1. Mathematische Methoden | |
| Engineering Science StuPO 2020 | SS 2025 | 1. Mathematische Methoden |
| WS 2025/26 | 1. Mathematische Methoden | |
| SS 2026 | 1. Mathematische Methoden | |
| WS 2026/27 | 1. Mathematische Methoden | |
| Natural Sciences in the Information Society StuPO 2018 | SS 2025 | Wahlpflichtbereich › Informatik › Weiterführende Module |
| WS 2025/26 | Wahlpflichtbereich › Informatik › Weiterführende Module | |
| SS 2026 | Wahlpflichtbereich › Informatik › Weiterführende Module | |
| WS 2026/27 | Wahlpflichtbereich › Informatik › Weiterführende Module | |
| Natural Sciences in the Information Society Natural Sciences in the Information Society (B. Sc.) - StuPO 2025 | WS 2025/26 | Wahlpflichtbereich › Wahlpflichtbereich Informatik › Weiterführende Module Informatik |
| SS 2026 | Wahlpflichtbereich › Wahlpflichtbereich Informatik › Weiterführende Module Informatik | |
| WS 2026/27 | Wahlpflichtbereich › Wahlpflichtbereich Informatik › Weiterführende Module Informatik |
Miscellaneous
[Contains machine generated translations 2026-07-07 11:17, only the German version is legally binding]