Suchergebnis: Katalogdaten im Herbstsemester 2020
|263-0006-00L||Algorithms Lab |
Only for master students, otherwise a special permission by the student administration of D-INFK is required.
|O||8 KP||4P + 3A||E. Welzl|
|Kurzbeschreibung||Students learn how to solve algorithmic problems given by a textual description (understanding problem setting, finding appropriate modeling, choosing suitable algorithms, and implementing them). Knowledge of basic algorithms and data structures is assumed; more advanced material and usage of standard libraries for combinatorial algorithms are introduced in tutorials.|
|Lernziel||The objective of this course is to learn how to solve algorithmic problems given by a textual description. This includes appropriate problem modeling, choice of suitable (combinatorial) algorithms, and implementing them (using C/C++, STL, CGAL, and BGL).|
|Literatur||T. Cormen, C. Leiserson, R. Rivest: Introduction to Algorithms, MIT Press, 1990.|
J. Hromkovic, Teubner: Theoretische Informatik, Springer, 2004 (English: Theoretical Computer Science, Springer 2003).
J. Kleinberg, É. Tardos: Algorithm Design, Addison Wesley, 2006.
H. R. Lewis, C. H. Papadimitriou: Elements of the Theory of Computation, Prentice Hall, 1998.
T. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen, Spektrum, 2012.
R. Sedgewick: Algorithms in C++: Graph Algorithms, Addison-Wesley, 2001.
|263-0009-00L||Information Security Lab |
Only for master students, otherwise a special permission by the study administration of D-INFK is required.
Number of participants limited to 150.
|O||8 KP||2V + 1U + 3P + 1A||K. Paterson, D. Basin, S. Capkun, D. Hofheinz, A. Perrig|
|Kurzbeschreibung||This InterFocus Course will provide a broad, hands-on introduction to Information Security, introducing adversarial thinking and security by design as key approaches to building secure systems.|
|Lernziel||This course will introduce key concepts from Information Security, both from attack and defence perspectives. Students will gain an appreciation of the complexity and challenge of building secure systems.|
|Inhalt||The course is organised in two-week segments. In each segment, a new concept from Information Security will be introduced. The overall scope will be broad, including cryptography, protocol design, network security, system security.|
|Skript||Will be made available during the semester.|
|Literatur||Paul C. van Oorschot, Computer Security and the Internet: Tools and Jewels.|
Dan Boneh and Victor Shoup, A Graduate Course in Applied Cryptography.
|Voraussetzungen / Besonderes||Ideally, students will have taken the D-INFK Bachelors course “Information Security" or an equivalent course at Bachelors level.|
- Seite 1 von 1