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 | ||
|
pruefungen:bachelor:aud:inhaltszusammenfassung [20.08.2017 18:00] dom added professor names |
pruefungen:bachelor:aud:inhaltszusammenfassung [18.10.2019 14:01] (aktuell) dom Klausur 08.08.19 hinzugefuegt. |
||
|---|---|---|---|
| Zeile 1: | Zeile 1: | ||
| - | <note important>Work in progress. Stand 20.08.2017</note> | + | <note important>Stand 18.10.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 ====== | ||
| - | | ^ 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 | | + | ^ 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 | | + | ^ 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 | | + | ^ 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 | | + | ^ 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 | | + | ^ 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 | | + | ^ ADTs | X | X | X | X | | X | X | | X | | X | X | X | | X | | X | | X | | X | |
| - | ^ Listen | | | X | | | X | | | | | | | | | | | | | | + | ^ Listen | | | | X | | X | | | X | | | | | | | | | | | | | |
| - | ^ Backtracking | | | X | | | | X | X | | | | | | | | | | | | + | ^ Backtracking | | X | X | | | X | | X | | X | X | | | | | | | | | | | |
| - | ^ Suche | | | 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 | | | | | | | | | | | | | | | | | | | | | | ||
| - | ===== 10.08.2017 ===== | + | (1) ohne Mini-Klausur, (2) mit Mini-Klausur |
| + | |||
| + | |||
| + | |||
| + | ===== 08.08.2019 - Schroeder===== | ||
| + | * MC [14 P] | ||
| + | * Dynamische Programmierung [10 P] | ||
| + | * Bäume (Theorie) [20 P] | ||
| + | * Listen [18 P] | ||
| + | * Graph [21 P] | ||
| + | * ADT [17 P] | ||
| + | * Backtracking [20 P] | ||
| + | |||
| + | ===== 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] | ||
| + | |||
| + | |||
| + | |||
| + | ===== 26.03.2018 - Philippsen===== | ||
| + | * MC [12 P] | ||
| + | * Baeume und Halden [12 P] | ||
| + | * Iteration, Rekursion, O-Kalkuel [26 P] | ||
| + | * Backtracking [19 P] | ||
| + | * Union-Find [17 P] | ||
| + | * ADT (Theorie) [20 P] | ||
| + | * Vererbung und Polymorphie [14 P] | ||
| + | |||
| + | |||
| + | |||
| + | ===== 10.08.2017 - Pflaum===== | ||
| + | * MC [18 P] | ||
| + | * Suchen und O-Kalkuel [20 P] | ||
| + | * Baeume (pre-/in-/post-order + Programmierung) [20 P] | ||
| + | * Listen [20 P] | ||
| + | * ADT (Theorie) [22 P] | ||
| + | * Graphen [20 P] | ||
| Zeile 29: | Zeile 101: | ||
| * Graphen (Dijkstra, Kruskal) [23 P] | * Graphen (Dijkstra, Kruskal) [23 P] | ||
| * Rekursion [21 P] | * Rekursion [21 P] | ||
| - | |||
| - | |||
| - | |||
| ===== 28.07.2016 - Stamminger===== | ===== 28.07.2016 - Stamminger===== | ||
| Zeile 41: | Zeile 110: | ||
| * Binaere Suche [10 P] | * Binaere Suche [10 P] | ||
| * Backtracking [15 P] | * Backtracking [15 P] | ||
| - | |||
| - | |||
| ===== 30.03.2016 - Stamminger===== | ===== 30.03.2016 - Stamminger===== | ||
| Zeile 53: | Zeile 120: | ||
| * Graphen (nur Programmierung) [20 P] | * Graphen (nur Programmierung) [20 P] | ||
| * ADT (nur Theorie) [16 P] | * ADT (nur Theorie) [16 P] | ||
| - | |||
| - | |||
| ===== 30.07.2015 - Riehle===== | ===== 30.07.2015 - Riehle===== | ||
| Zeile 65: | Zeile 130: | ||
| * Sortieren (MergeSort - nur Programmierung) [16 P] | * Sortieren (MergeSort - nur Programmierung) [16 P] | ||
| * Backtracking [18 P] | * Backtracking [18 P] | ||
| - | |||
| - | |||
| ===== 30.03.2015 - Riehle===== | ===== 30.03.2015 - Riehle===== | ||
| Zeile 76: | Zeile 139: | ||
| * ADT [15 P] | * ADT [15 P] | ||
| * Listen (doppelt verkettet + Prioritaet/Comparable) [29 P] | * Listen (doppelt verkettet + Prioritaet/Comparable) [29 P] | ||
| - | |||
| ===== 24.07.2014 - Philippsen===== | ===== 24.07.2014 - Philippsen===== | ||
| * MC [17 P] | * MC [17 P] | ||
| - | * Baeume (AVL/binaer/linksvollstaendig, [pre-/in-/post-order) [19 P] | + | * Baeume (AVL/binaer/linksvollstaendig, pre-/in-/post-order) [19 P] |
| * Graphen (Dijkstra, Floyd) [20 P] | * Graphen (Dijkstra, Floyd) [20 P] | ||
| * Backtracking [21 P] | * Backtracking [21 P] | ||
| * Haldensortierung (Theorie + Programmierung) [20 P] | * Haldensortierung (Theorie + Programmierung) [20 P] | ||
| * Baeume und Rekursion (nur Programmierung) [23 P] | * Baeume und Rekursion (nur Programmierung) [23 P] | ||
| - | |||
| ===== 26.03.2014 - Philippsen===== | ===== 26.03.2014 - Philippsen===== | ||
| * MC [12 P] | * MC [12 P] | ||
| * Streuspeicherung (Theorie + Programmierung) [13 P] | * Streuspeicherung (Theorie + Programmierung) [13 P] | ||
| - | * Graphen (Adjazenliste, Dijkstra, Prim) [17 P] | + | * Graphen (Adjazenzliste, Dijkstra, Prim) [17 P] |
| * Baeume (nur Programmierung, rekursiv + iterativ) [13 P] | * Baeume (nur Programmierung, rekursiv + iterativ) [13 P] | ||
| * Dynamische Programmierung (Rucksackproblem, iterativ) [19 P] | * Dynamische Programmierung (Rucksackproblem, iterativ) [19 P] | ||
| Zeile 96: | Zeile 157: | ||
| * Backtracking [19 P] | * Backtracking [19 P] | ||
| * Schreibtischlauf (Fehler im Code finden) [11 P] | * Schreibtischlauf (Fehler im Code finden) [11 P] | ||
| - | |||
| ===== 01.08.2013 ===== | ===== 01.08.2013 ===== | ||
| Zeile 106: | Zeile 166: | ||
| * Graphen (Dijkstra, Kruskal) [15 P] | * Graphen (Dijkstra, Kruskal) [15 P] | ||
| * Sortierverfahren (Comparator<T>, MergeSort) [22 P] | * Sortierverfahren (Comparator<T>, MergeSort) [22 P] | ||
| - | |||
| ===== 21.02.2013 - Pflaum===== | ===== 21.02.2013 - Pflaum===== | ||
| Zeile 244: | Zeile 303: | ||
| + | ====== Inhaltszusammenfassung der AuD-Miniklausuren ====== | ||
| + | | ^ WS13 ^ WS14 ^ WS15 ^ WS16 ^ WS17 ^ WS18 ^ | ||
| + | ^ MultipleChoice | 6 | 6 | 7 | 7 | 6 | 6 | | ||
| + | ^ Bäume | | 17 | | 18 | | | | ||
| + | ^ Graphen | | | | | | | | ||
| + | ^ Rekursion | | | 8 | 18 | | | | ||
| + | ^ Dyn. Prog. | | | 10 | | | 15 | | ||
| + | ^ Sortieren | | | | | | | | ||
| + | ^ HashMaps | | 4 | 13 | | | | | ||
| + | ^ ADTs | 9 | | 7 | 7 | 14 | 12 | | ||
| + | ^ Listen | 11 | | | | | | | ||
| + | ^ Backtracking | 19 | 18 | | | 25 | 12 | | ||
| + | ^ Suche | | | | | | | | ||
| + | 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===== | ||
| + | *MC [6 P] | ||
| + | *Backtracking[25 P] | ||
| + | *ADT [14 P] | ||
| + | ===== 10.01.2017 - Philippsen===== | ||
| + | *MC [7 P] | ||
| + | *Rekursion [18 P] | ||
| + | *Baeume (Programmierung, iterativ + rekursiv) [18 P] | ||
| + | *ADT [7 P] | ||
| + | ===== 13.01.2016 - Stamminger===== | ||
| + | *MC [7 P] | ||
| + | *Rekursion [8 P] | ||
| + | *ADT [7 P] | ||
| + | *Dynamische Programmierung [10 P] | ||
| + | *Streuspeicherung (Theorie + Programmierung) [13 P] | ||
| + | ===== 12.01.2015 - Riehle ===== | ||
| + | *MC [6 P] | ||
| + | *Backtracking [18 P] | ||
| + | *Streutabellen [4 P] | ||
| + | *Baeume (Programmierung) [17 P] | ||
| - | + | ===== 13.01.2014 - Philippsen===== | |
| - | + | *MC [6 P] | |
| - | + | *Backtracking [19 P] | |
| - | + | *Listen (einfach verkettet) [11 P] | |
| - | + | *ADT [9 P] | |
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||