392007 Algorithmen der Informatik (V) (SoSe 2021)
Contents, comment
-
Da das aktuelle Semester ein reines Online Semester ist, wird diese Vorlesung durch Videos/Material realisiert und im ekvv Lernraum im "Videos" Ordner jeweils gegen Anfang/Mitte der Woche bereitgestellt. Dies ist ein asynchrones Format, d.h. Sie können sich die Materialen zu einem beliebigen Zeitpunkt in der Woche ansehen.
Im ersten Video werden weitere organisatorische Informationen besprochen.Inhalt der Vorlesung:
Suchen, Sortieren, NP-harte Algorithmen, und was dann?
Es gibt heute in der Informatik eine Fülle von Entwurfsparadigmen für komplexe Algorithmen für alltägliche Probleme. Die Vorlesung startet von klassischen Graphenalgorithmen bis hin zu approximativen und randomisierten Algorithmen für NP-harte Probleme. Behandelte Topics sind im einzelnen:
- Graphtraversierung
- kuerzeste Wege
- Spannbaeume
- Flussprobleme
- Simplexverfahren
- Approximationsverfahren
- nichtlineare OptimierungGrundlage stellt das Buch
Introductions to Algorithms, Cormen, Leserson, Rivest, Stein
dar
Requirements for participation, required level
-
A und D
Pogrammierkenntnisse
Bibliography
-
Cormen, Leserson, Rivest, Stein, Introductions to Algorithms
Vazirani, Approximation algorithms
Motwani/Raghavan, Randomized algorithms
Papadimitriou, Steiglitz, Combinatorial Optimization
Turau, Algorithmische Graphentheorie
Beer et al., Die .net Technologie
Teaching staff
Dates ( Calendar view )
| Frequency | Weekday | Time | Format / Place | Period |
|---|
Subject assignments
| Module | Course | Requirements | |
|---|---|---|---|
| 39-Inf-7 Algorithmen der Informatik | Algorithmen der Informatik | Ungraded examination
Graded examination |
Student information |
The binding module descriptions contain further information, including specifications on the "types of assignments" students need to complete. In cases where a module description mentions more than one kind of assignment, the respective member of the teaching staff will decide which task(s) they assign the students.
| Degree programme/academic programme | Validity | Variant | Subdivision | Status | Semester | LP | |
|---|---|---|---|---|---|---|---|
| Studieren ab 50 | |||||||
| Veranstaltungen für Schülerinnen und Schüler | Bei Gruppen ab drei Personen ist eine vorherige Anmeldung in der ZSB erforderlich. |
- E-Learning Space
- E-Learning Space
- E-Prüfung
- E-Prüfung
- Registered number: 190
- This is the number of students having stored the course in their timetable. In brackets, you see the number of users registered via guest accounts.
- Address:
- SS2021_392007@ekvv.uni-bielefeld.de
- This address can be used by teaching staff, their secretary's offices as well as the individuals in charge of course data maintenance to send emails to the course participants. IMPORTANT: All sent emails must be activated. Wait for the activation email and follow the instructions given there.
- If the reference number is used for several courses in the course of the semester, use the following alternative address to reach the participants of exactly this: VST_257649111@ekvv.uni-bielefeld.de
- Coverage:
- 109 Students to be reached directly via email
- Notes:
- Additional notes on the electronic mailing lists
- Email archive
- Number of entries 0
- Open email archive
- Last update basic details/teaching staff:
- Wednesday, January 6, 2021
- Last update times:
- Monday, June 28, 2021
- Last update rooms:
- Monday, June 28, 2021
- Type(s) / SWS (hours per week per semester)
- lecture (V) / 2
- Department
- Faculty of Technology
- Questions or corrections?
- Questions or correction requests for this course?
- Planning support
- Clashing dates for this course
- Links to this course
- If you want to set links to this course page, please use one of the following links. Do not use the link shown in your browser!
- The following link includes the course ID and is always unique:
- https://ekvv.uni-bielefeld.de/kvv_publ/publ/vd?id=257649111
- Send page to mobile
-
Click to open QR code
Scan QR code:
- ID
- 257649111