FSI-Zimmer: geschlossen
Sie befinden sich hier: Termine » Prüfungsfragen und Altklausuren » Prüfungen im Bachelor-Studium (1. - 5. Semester) » aud » Notenschluessel (Übersicht)
Unterschiede
Hier werden die Unterschiede zwischen zwei Versionen gezeigt.
| Both sides previous revision Vorhergehende Überarbeitung Nächste Überarbeitung | Vorhergehende Überarbeitung Letzte Überarbeitung Both sides next revision | ||
|
pruefungen:bachelor:aud:inhaltszusammenfassung [04.05.2018 09:24] dom Klausur WS2018 added. |
pruefungen:bachelor:aud:inhaltszusammenfassung [31.07.2019 15:42] dom kleiner Fehler beim Backtracking (SS 15) in der Tabelle korrigiert |
||
|---|---|---|---|
| Zeile 1: | Zeile 1: | ||
| - | <note important>Work in progress. Stand 01.03.2018</note> | + | <note important>Stand 31.07.2019</note> |
| + | |||
| + | ====== Notenschluessel ====== | ||
| + | Der Notenschluessel vom WS18/19. | ||
| + | |||
| + | ^ Note ^ Punkte ^ | ||
| + | | 1,0| 106 | | ||
| + | | 1,3| 101 | | ||
| + | | 1,7| 95 | | ||
| + | | 2,0| 90 | | ||
| + | | 2,3| 85 | | ||
| + | | 2,7| 79 | | ||
| + | | 3,0| 74 | | ||
| + | | 3,3| 69 | | ||
| + | | 3,7| 63 | | ||
| + | | **4,0**| **58** | | ||
| + | | 4,3| 53 | | ||
| + | | 4,7| 47 | | ||
| ====== Inhaltszusammenfassung der AuD-Klausuren ====== | ====== Inhaltszusammenfassung der AuD-Klausuren ====== | ||
| - | | ^ WS18 ^ SS17 ^ WS16 ^ SS16 ^ WS15 ^ SS15 ^ WS14 ^ SS14 ^ WS13 ^ SS13 ^ WS12 ^ SS12 ^ WS11 ^ SS11 ^ WS10 ^ SS10 ^ WS09 ^ SS09 ^ WS08 ^ | + | | ^ WS18 ^ SS18 ^ WS17 ^ SS17 ^ WS16 ^ SS16 ^ WS15 ^ SS15 ^ WS14 ^ SS14 ^ WS13 ^ SS13 ^ WS12 ^ SS12 ^ WS11 ^ SS11 ^ WS10 ^ SS10 ^ WS09 ^ SS09 ^ WS08 ^ |
| - | ^ MultipleChoice | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | | + | ^ MultipleChoice | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | X | |
| - | ^ Bäume | X | X | | X | | X | | X | X | | | X | | X | X | X | X | | X | | + | ^ Bäume | | X | X | X | | X | | X | | X | X | | | X | | X | X | X | X | | X | |
| - | ^ Graphen | X | X | X | X | X | X | | X | X | X | | X | X | X | | X | X | X | X | | + | ^ Graphen | X | X | X | X | X | X | X | X | | X | X | X | | X | X | X | | X | X | X | X | |
| - | ^ Rekursion | X | | X | | | X | | X | | X | X | X | | | X | X | X | X | X | | + | ^ Rekursion | | X | X | | X | | | X | | X | | X | X | X | | | X | X | X | X | X | |
| - | ^ Dyn. Prog. | | | X | | X | X | X | | X | | X | | | X | | | | | | | + | ^ Dyn. Prog. | X | X | | | X | | X | X | X | | X | | X | | | X | | | | | | |
| - | ^ Sortieren | | | X | | X | X | X | X | | X | X | | X | | X | X | | X | | | + | ^ Sortieren | X | | | | X | | X | X | X | X | | X | X | | X | | X | X | | X | | |
| - | ^ HashMaps | X | | X | | X | | X | | X | X | | X | | X | | X | X | X | X | | + | ^ HashMaps | X | | X | | X | | X | | X | | X | X | | X | | X | | X | X | X | X | |
| - | ^ ADTs | X | X | | X | X | | X | | X | X | X | | X | | X | | X | | X | | + | ^ ADTs | X | X | X | X | | X | X | | X | | X | X | X | | X | | X | | X | | X | |
| - | ^ Listen | | X | | X | | | X | | | | | | | | | | | | | | + | ^ Listen | | | | X | | X | | | X | | | | | | | | | | | | | |
| - | ^ Backtracking | X | | | X | | | | X | X | | | | | | | | | | | | + | ^ Backtracking | | X | X | | | X | | X | | X | X | | | | | | | | | | | |
| - | ^ Suche | | X | | X | | X | | | | | | X | | | | | | | | | + | ^ Suche | | | | X | | X | | X | | | | | | X | | | | | | | | |
| - | ^ wp-Kalkül/Ind. | | | | | | | | | | | X | | X | X | X | X | X | X | X | | + | ^ wp-Kalkül/Ind. | | | | | | | | | | | | | X | | X | X | X | X | X | X | X | |
| - | ^ Schreibtischlauf | | | | | | | | | X | | X | | X | | | X | | | X | | + | ^ Schreibtischlauf | | | | | | | | | | | X | | X | | X | | | X | | | X | |
| - | ^ UML/OOP | | | | | | | | | | X | X | | X | X | X | X | | X | | | + | ^ UML/OOP | | | | | | | | | | | | X | X | | X | X | X | X | | X | | |
| + | ^ Vererbung | | | X | | | | | | | | | | | | | | | | | | | | ||
| + | ^ ----------------------- | | | | | | | | | | | | | | | | | | | | | | | ||
| + | ^ Bestehensquote | 54,73 % | | | | | | | 27 % | | | | | 43 % | | | | | | | | | | ||
| + | ^ Notendurchschnitt (1) | 3,81 | | | | | | | 4,41 | | | | | 3,98 | | | | | | | | | | ||
| + | ^ Notendurchschnitt (2) | 3,73 | | | | | | | | | | | | | | | | | | | | | | ||
| + | |||
| + | |||
| + | (1) ohne Mini-Klausur, (2) mit Mini-Klausur | ||
| + | |||
| + | |||
| + | |||
| + | ===== 08.08.2019 - Schroeder===== | ||
| + | |||
| + | |||
| + | ===== 09.04.2019 - Schroeder===== | ||
| + | * MC [15 P] | ||
| + | * Dynamische Programmierung [20 P] | ||
| + | * Streuspeicherung (Theorie) [21 P] | ||
| + | * Graphalgorithmen (DFS) [24 P] | ||
| + | * ADT (Theorie) [20 P] | ||
| + | * Radix-Exchange-Sort [20 P] | ||
| + | |||
| + | |||
| + | ===== 26.07.2018 - Philippsen===== | ||
| + | * Dynamische Programmierung [21 P] | ||
| + | * Graphen (Dijkstra, Floyd) [20 P] | ||
| + | * Gierige Algorithmen [23 P] | ||
| + | * ADT (Theorie) [22 P] | ||
| + | * Backtracking [24 P] | ||
| + | * MC [10 P] | ||
| Zeile 27: | Zeile 74: | ||
| * Union-Find [17 P] | * Union-Find [17 P] | ||
| * ADT (Theorie) [20 P] | * ADT (Theorie) [20 P] | ||
| + | * Vererbung und Polymorphie [14 P] | ||
| Zeile 251: | Zeile 299: | ||
| ====== Inhaltszusammenfassung der AuD-Miniklausuren ====== | ====== Inhaltszusammenfassung der AuD-Miniklausuren ====== | ||
| - | | ^ WS13 ^ WS14 ^ WS15 ^ WS16 ^ WS17 ^ | + | | ^ WS13 ^ WS14 ^ WS15 ^ WS16 ^ WS17 ^ WS18 ^ |
| - | ^ MultipleChoice | 6 | 6 | 7 | 7 | 6 | | + | ^ MultipleChoice | 6 | 6 | 7 | 7 | 6 | 6 | |
| - | ^ Bäume | | 17 | | 18 | | | + | ^ Bäume | | 17 | | 18 | | | |
| - | ^ Graphen | | | | | | | + | ^ Graphen | | | | | | | |
| - | ^ Rekursion | | | 8 | 18 | | | + | ^ Rekursion | | | 8 | 18 | | | |
| - | ^ Dyn. Prog. | | | 10 | | | | + | ^ Dyn. Prog. | | | 10 | | | 15 | |
| - | ^ Sortieren | | | | | | | + | ^ Sortieren | | | | | | | |
| - | ^ HashMaps | | 4 | 13 | | | | + | ^ HashMaps | | 4 | 13 | | | | |
| - | ^ ADTs | 9 | | 7 | 7 | 14 | | + | ^ ADTs | 9 | | 7 | 7 | 14 | 12 | |
| - | ^ Listen | 11 | | | | | | + | ^ Listen | 11 | | | | | | |
| - | ^ Backtracking | 19 | 18 | | | 25 | | + | ^ Backtracking | 19 | 18 | | | 25 | 12 | |
| - | ^ Suche | | | | | | | + | ^ Suche | | | | | | | |
| Die Zahlen in der Tabelle entsprechen den jeweiligen Punktzahlen der Aufgabe. | Die Zahlen in der Tabelle entsprechen den jeweiligen Punktzahlen der Aufgabe. | ||
| + | |||
| + | ===== 09.01.2019 - Schroeder===== | ||
| + | *MC [6 P] | ||
| + | *Dynamische Programmierung [15 P] | ||
| + | *Backtracking [12 P] | ||
| + | *ADT [12 P] | ||
| ===== 11.01.2018 - Philippsen===== | ===== 11.01.2018 - Philippsen===== | ||