Search result: Catalogue data in Spring Semester 2018
Computer Science Bachelor | ||||||
Bachelor Studies (Programme Regulations 2016) | ||||||
First Year Examinations | ||||||
First Year Examination Block 2 | ||||||
Number | Title | Type | ECTS | Hours | Lecturers | |
---|---|---|---|---|---|---|
401-0212-16L | Analysis I | O | 7 credits | 4V + 2U | E. Kowalski | |
Abstract | Real and complex numbers, vectors, functions, limits, sequences, series, power series, differentiation and integration in one variable | |||||
Objective | Real and complex numbers, vectors, functions, limits, sequences, series, power series, differentiation and integration in one variable | |||||
Content | Real and complex numbers, vectors, functions, limits, sequences, series, power series, differentiation and integration in one variable | |||||
Literature | Michael Struwe: Analysis für Informatik Christian Blatter: Ingenieur-analysis Tom Apostol: Mathematical Analysis Teaching materials and further information is available through the course website (Link) | |||||
252-0028-00L | Design of Digital Circuits | O | 7 credits | 4V + 2U | O. Mutlu | |
Abstract | The class provides an introduction to the design of digital circuitry. The class covers the basics of the technical foundations of gates. An introduction to hardware description languages and their use in the design process follows. | |||||
Objective | The class provides an introduction to the design of digital circuitry. The class covers the basics of the technical foundations of gates. An introduction to hardware description languages and their use in the design process follows. | |||||
Content | The class provides an introduction to the design of digital circuitry. The class covers the basics of the technical foundations of gates. An introduction to hardware description languages and their use in the design process follows. | |||||
252-0029-00L | Parallel Programming | O | 7 credits | 4V + 2U | T. Hoefler, M. Vechev | |
Abstract | Introduction to parallel programming: deterministic and non-deterministic programs, models for parallel computation, synchronization, communication, and fairness. | |||||
Objective | The student should learn how to write a correct parallel program, how to measure its efficiency, and how to reason about a parallel program. Student should become familiar with issues, problems, pitfalls, and solutions related to the construction of parallel programs. Labs provide an opportunity to gain experience with threads, libraries for thread management in modern programming lanugages (e.g., Java, C#) and with the execution of parallel programs on multi-processor/multi-core computers. | |||||
252-0030-00L | Algorithms and Probability | O | 7 credits | 4V + 2U | A. Steger, E. Welzl | |
Abstract | Fortsetzung der Vorlesung Algorithmen und Datenstrukturen des ersten Semesters. Es werden klassische Algorithmen aus verschiedenen Anwendungsbereichen vorgestellt. In die diskrete Wahrscheinlichkeitstheorie wird eingeführt und das Konzept randomisierter Algorithmen an verschiedenen Beispielen vorgestellt. | |||||
Objective | Verständnis des Entwurfs und der Analyse von Algorithmen. Grundlagen der diskreten Wahrscheinlichkeitstheorie und ihrer Anwendung in der Algorithmik. |
- Page 1 of 1