https://wiki.mafiasi.de/index.php?action=history&feed=atom&title=AD-Repetitorium-2014 2026-10-17T05:18:28Z Versionsgeschichte dieser Seite in Fachschaft Informatik MediaWiki 1.46.2 https://wiki.mafiasi.de/index.php?title=AD-Repetitorium-2014&diff=19218&oldid=prev 2014-01-29T12:59:37Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw-interface=""> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="de"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Nächstältere Version</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Version vom 29. Januar 2014, 12:59 Uhr</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l7">Zeile 7:</td> <td colspan="2" class="diff-lineno">Zeile 7:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>Alle Teilnehmer sollten ab 11 Uhr anwesend sein!</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>Alle Teilnehmer sollten ab 11 Uhr anwesend sein!</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">Die </del>Themenblöcke <del style="font-weight: bold; text-decoration: none;">werden hier </del>noch <del style="font-weight: bold; text-decoration: none;">bekannt gegeben</del>.</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">Voraussichtliche </ins>Themenblöcke <ins style="font-weight: bold; text-decoration: none;">(kann sich </ins>noch <ins style="font-weight: bold; text-decoration: none;">ändern):</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div> </div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Tag 1: Komplexität und Laufzeitanalyse, Datenstrukturen (Arrays, Listen,</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">Bäume, Queue, Stack, Heap, </ins>.<ins style="font-weight: bold; text-decoration: none;">.), Sortieralgorithmen (Mergesort,</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">Bubblesort, Heapsort, Quicksort, ...)</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div> </div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Tag 2: Suchalgorithmen (Binärsuche,</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">AVL-Trees), Graphalgorithmen (Breitensuche, Tiefensuche, Shortest-Path,</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">Dijkstra, Bellman-Ford ...)</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div> </div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* Tag 3: Minimal-spannende Bäume, Dynamic Programming, Greedy Algorithms,</ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">Local search, Hard problems</ins></div></td></tr> </table>

1langbeh https://wiki.mafiasi.de/index.php?title=AD-Repetitorium-2014&diff=19201&oldid=prev 2014-01-27T13:30:14Z

<p>Die Seite wurde neu angelegt: „Das AD-Repetitorium im WS 2013/2014 wird an folgenden Tagen in &#039;&#039;&#039;Raum F-132&#039;&#039;&#039; stattfinden: * Do. 6. Februar 11-18 Uhr * Sa. 8. Februar 11-18 Uhr * Mo. 10. F…“</p> <p><b>Neue Seite</b></p><div>Das AD-Repetitorium im WS 2013/2014 wird an folgenden Tagen in &#039;&#039;&#039;Raum F-132&#039;&#039;&#039; stattfinden:<br /> <br /> * Do. 6. Februar 11-18 Uhr<br /> * Sa. 8. Februar 11-18 Uhr<br /> * Mo. 10. Februar 11-18 Uhr<br /> <br /> Alle Teilnehmer sollten ab 11 Uhr anwesend sein!<br /> <br /> Die Themenblöcke werden hier noch bekannt gegeben.</div>

1langbeh