TU Wien:Algorithms in Graph Theory VU (Chen)
Jump to navigation
Jump to search
Similarly named LVAs (Resources):
- Algorithms in Graph Theory VU (Chen) (TU Wien, 0 Resources)
- Algorithms in Graph Theory VU (Nöllenburg) (TU Wien, 0 Resources)
Daten[edit | edit source]
| Lecturers | Jiehua Chen• Manuel Sorge• Stefan Szeider• Martin Nöllenburg |
|---|---|
| ECTS | 3 |
| Alias | Algorithms in Graph Theory (en) |
| When | summer semester |
| Last iteration | 2022SS |
| Language | English |
| Links | tiss:186181 |
| Master Logic and Computation | Wahlmodul Algorithmics and Complexity |
| Master Software Engineering & Internet Computing | Wahlmodul Algorithmik |
| Master Informatikdidaktik | Wahlmodul Algorithmik |
Inhalt[edit | edit source]
noch offen, bitte nicht von tiss oder Homepage kopieren, sondern aus Studierendensicht beschreiben.
Ablauf[edit | edit source]
noch offen
Benötigte/Empfehlenswerte Vorkenntnisse[edit | edit source]
noch offen
Vortrag[edit | edit source]
noch offen
Übungen[edit | edit source]
noch offen
Prüfung, Benotung[edit | edit source]
One can voluntarily take an oral exam about the lecture content which can influence the grade by +1,+0 or -1. In my case, two of the lecturers asked questions about the general lecture content 10 minutes each The questions were not too specific, but one should certainly know and understand the covered content as well as the proofs. The atmosphere is relatively relaxed and general understand is more important than knowing every little specific detail.
Dauer der Zeugnisausstellung[edit | edit source]
noch offen
Zeitaufwand[edit | edit source]
noch offen
Unterlagen[edit | edit source]
noch offen
Tipps[edit | edit source]
noch offen
Verbesserungsvorschläge / Kritik[edit | edit source]
noch offen