Please be advised that nothing found here is guaranteed to be complete, correct or anything else.

If not otherwise noted all documents are provided under Creative Commons Attribution-Share Alike 3.0 Unported

Handwritten documents may be hard to read because of my handwriting. Well, I still hope it helps you ;-)

You can contact me over i@gregorwegberg.com

**Computational Intelligence Lab (SS 2015)**- Summary I (and at least 5 more people) took to the exam: LaTeX and latest PDF on GitHub
- Summary written to make sure I read the slides, would surprise me if it's useful to anyone: LaTeX and latest PDF on GitHub

**Network Security (AS 2014)**A not so useful summary of the whole lecture can be found here (MDwiki). Much more interesting might be the summary I used at the exam.

**Algorithms Lab (AS 2014)**My solutions for nearly all Algorithm Lab exercises can be found in my GitHub repository. Inside this repository is a PDF including my friend's solutions and mine.

**System Security (AS 2014)**A not so useful summary of the whole lecture can be found here (MDwiki).

**Visual Computing (AS 2013)**My handwritten and especially hard to read summary can be found here: PDF (15.7 MByte).

Exam content, 3 hours, 180 points in total:

- Filters + Segmentation: 25 points
- Fourier Transoform: 20 points
- PCA: 12 points
- Optical Flow: 25 points
- Hough Transform: 8 points
- Light + Colors: 28 points
- Transformations: 23 points
- Rendering and Geometry: 31 points
- Animation and Physics: 8 points

Stuff I clearly missed to add to my summary:

- Animation and Physics formulae
- Color calculations and experiment information
- more PCA information
- more optical flow information
- Rigid transformations missing completely
- Quaternions missing
- OpenGL example code

**Compiler Design (AS 2013)**Another handwritten and especially hard to read summary can be found here: PDF (7.1 MByte).

What may be of more use are the topics of the exam (as far as I remember, in no particular order):

- Create SLR table for a grammar
- Find out which statements will be removed by using the live variable analysis
- Explain how you would implement
`loop { someStmts; } until(condition);`

in Javali - Do a left most derivation for a given grammar
- Find out of a grammar is ambiguous
- Draw an IR tree for a given Javali function
- Explain which methods are called for a given code example where no dynamic dispatching is available (the static type of the target specifies which method is called).

**(german only) Theoretische Informatik (SS 2014)**Zusammenfassung zu Theoretische Informatik als PDF. Nicht besonders interessant, lohnt sich selber eine zu schreiben beim Lesen des Buchs

**BSc Software Engineering Seminar (AS 2013)**I presented «Terra: A Multi-Stage Language for High-Performance Computing, PLDI 2013» that can be found here (terralang.org). My presentation is available as a PDF (5 MByte).

**Analysis 1&2 (German)**The PDF (730 KByte) may be out of date, check GitHub for latest source code (LaTeX).

**Digitaltechnik (German)****Linear Algebra (German)****Parallel Programming (German)**

I don't recommend you to use the following summaries. They are pretty bad. Anyway, maybe they can be still useful to someone

**Digitaltechnik (German)****Linear Algebra (German)****Parallel Programming (German)**