Algorithms & Data Structures 2

Transcription

1 Algorithms & Data Structures 2 Introduction WS2017 B. Anzengruber-Tanase (Institute for Pervasive Computing, JKU Linz) (Institute for Pervasive Computing, JKU Linz)

2 CONTACT Vorlesung DI Bernhard Anzengruber, Univ.-Prof. Dr. Alois Ferscha, Übung DI Bernhard Anzengruber, Institut für Pervasive Computing JKU Linz, Altenberger Straße 66b, 4040 Linz Science Park 3, Informatikgebäude, 6. Stock Administration Ms Mayr, +43 (732) Algorithms and Datastructures 2 // 2017W // 2

3 COURSE DETAILS Course VL Algorithms & Data Structures 2 (Algorithmen & Datenstrukturen 2), Workload 3 ECTS, 2 SWS Studies Bachelor's programme Computer Science 2013W (K 033/521) Bachelor's programme Information Electronics (K 033/289) Audience B2 - Bachelor 2. Jahr URL Winter term 2017/18: Time Mo 13:45 15:15 Place HS 18 Introduction Mo, October 09, 2017 Exam Mo, January 29, Algorithms and Datastructures 2 // 2017W // 3

4 COURSE DETAILS Objectives The course focuses on advanced algorithms, data structures, dynamic data structures, and their applications in particular. Subject Dynamic data structures (lists, tree structures, graphs, stacks, queues, quantities), Heaps, skip lists, splay trees, advanced sorting algorithms (merge sort, heap sort, radix sort), balanced tree structures, hashing, graph algorithms, geometric algorithms, multimedia algorithms, parallel algorithms, distributed algorithms, heuristic algorithms. Criteria for evaluation Examination Algorithms and Datastructures 2 // 2017W // 4

5 LITERATURE Primärliteratur Ottmann, Thomas; Widmayer, Peter: Algorithmen und Datenstrukturen. Heidelberg: Springer Spektrum, 5. Auflage, Behandelt sehr fachkundig und leicht verständlich den klassischen Themenkern einer Standardvorlesung Algorithmen und Datenstrukturen" (vom Suchen und Sortieren über Adressberechnungsmethoden und Listenstrukturen (Bäume aller Art) bis zu Geometrischen Algorithmen und Graphenalgorithmen. Auch in elektronischer Form verfügbar: ISBN Weiss, Mark Allen: Data Structures and Algorithm Analysis in Java, Harlow: Pearson, 3. Auflage, ISBN: Goodrich, Michael T.; Tamassia, Roberto; Goldwasser Michael H.: Data Structures and Algorithms in Java, Hoboken, N.J. [u.a.] : Wiley, 6. Auflage, ISBN Zwei Werke, die insbesondere für die praktischen Übungen von Bedeutung sein werden, da sie klassische A&D auf die Zielprogrammiersprache Java abbilden: G. Tel: Introduction to Distributed Algorithms, Cambridge University Press, 2. Auflage, Standardwerk im Bereich Algorithmen für Distributed Computing. Algorithms and Datastructures 2 // 2017W // 5

6 LITERATURE Sekundärliteratur (1/2) R. Sedgewick: Algorithms in Java, Addison Wesley Professional, T. Cormen, C. Leiserson, R. Rivest, C: Stein: Introduction to Algorithms, MIT Press, 3. Auflage, N. Wirth: Algorithmen und Datenstrukturen, Stuttgart, Teubner, 3. Auflage, A.V. Aho, J.E. Hopcroft, J.D. Ullman: Data Structures and Algorithms, Addison Wesley, Donald E. Knuth: The Art of Computer Programming. Volume 1 / Fundamental Algorithms. The Art of Computer Programming. Volume 2 / Seminumerical Algorithms. Reading, Mass.: Addison Wesley Longman, Frühe Standardwerke in der Informatik Grundausbildung. Algorithms and Datastructures 2 // 2017W // 6

7 LITERATURE Sekundärliteratur (2/2) J. JaJa: An Introduction to Parallel Algorithms, Addison Wesley, N. A. Lynch: Distributed Algorithms, Morgan Kaufmann Publishers, San Francisco, H. Attiya, J. Welch: Distributed Computing, Wiley-Interscience, 2. Auflage, 2004 M. Quinn: Parallel Computing, McGraw-Hill, 1994 Algorithms and Datastructures 2 // 2017W // 7

8 LITERATURE Online Referenzen zu Algorithmen Computational Geometry, David Eppstein, UC Irvine A compendium of NP optimization problems Algorithms and Datastructures 2 // 2017W // 8

9 ALGORITHMS AND DATA STRUCTURES 2 :: SCHEDULE Algorithms and Datastructures 2 // 2017W // 9

10 ALGORITHMS AND DATA STRUCTURES 2 :: EXAMINATION An- und Abmeldezeitraum beachten! Algorithms and Datastructures 2 // 2017W // 10

11 COURSE MATERIAL AND REQUIREMENTS Slides to each lecture will be published on the department homepage. Some parts will be done exclusively in the lecture. independent rework independent research on the web investigate primary and secondary literature participate in the lecture content will be broadened in the exercises hands-on-experience! Algorithms and Datastructures 2 // 2017W // 11

12 ALGORITHMS AND DATA STRUCTURES 2 :: EXERCISES Exercises start on Tuesday October 10th Tuesday 12:00-12:45 Tuesday 12:45-13:30 Tuesday 13:45-14:30 Tuesday 14:30-15:15 Algorithms and Datastructures 2 // 2017W // 12

13 Algorithms & Data Structures 2 Introduction WS2017 B. Anzengruber-Tanase (Institute for Pervasive Computing, JKU Linz) (Institute for Pervasive Computing, JKU Linz)