Explanation:
Below you will find a tabular overview of the topics for the entrance exam for the study programs
[Link]. Artificial Intelligence and Machine Learning, [Link]. Computer Science and [Link]. IT Security
for the admission to the winter term 2024/25 as well as book recommendations for the
preparation for the same.
Topic of the entrance exam Short overview of the content Book recommendations
Algorithms and Data Structures ● Data structures: array, list, Introduction to Algorithms
binary search tree, B-tree, graph (3rd ed.); Cormen,
representation, hash table, heaps Leiserson, Rivest, Stein;
● Algorithms: sorting algorithms, MIT Press
string matching, graph traversal,
insertion, search, and deletion
for data structures, shortest path
search, minimal spanning trees
● Asymptotic complexity: run
times, Big O notation,
complexity classes P and NP, NP
completeness
● Algorithmic strategies. for
example: Divide-and-Conquer,
dynamic programming, brute-
force, greedy, backtracking,
meta heuristics
Parallel Programming ● Foundations of parallel systems Using MPI
● Parallel architectures William Gropp, Ewing
● Programming models for parallel Lusk, Anthony Skjellum,
computing 3rd edition, MIT Press
● Parallel algorithms
Parallel Programming in
● Significant practical OpenMP
programming exercises covering R. Chandra, L. Dagum, D.
the above topics Kohr, D. Maydan, J.
● If necessary introduction to base McDonald, R. Meno,
programming languages Morgan Kaufmann
Programming Massively
Parallel Processors David
B. Kirk, Wen-mei W. Hwu,
2nd edition, Morgan
Kaufmann
Introduction to Compiler ● Structure of compilers Programming Language
Construction ● Context-free grammars for the Processors in Java;
description of language syntax Watt/Brown
● Lexing and parsing techniques
● Intermediate representations
Page 1 / 5
● Semantic analysis
● Run-time organisation
● Code generation
● Software tools for compiler
constructions
● Implementation techniques for
compilers
Automata, Formal Languages and ● Introduction: transition systems, Introduction to Automata
Decidability words, languages Theory, Languages, and
● Basic mathematical methods and Computation (3rd ed.);
proof patterns Hopcroft, John E.;
● Finite automata and regular Motwani, Rajeev; Ullman,
languages, determinism and Jeffrey D. (2013); Pearson.
nondeterminism, closure
properties and automata
constructions, Kleene Theorem,
Myhill-Nerode Theorem,
pumping lemma
● Grammars and the Chomsky
hierarchy, context-free
languages, pumping lemma, CYK
algorithm;
● Models of computation: PDA
and Turing machines
● Decidability and recursive
enumerability in the Chomsky
hierarchy
Computer Security Part I: Cryptography M. Bishop, Computer
Security: Art and Science,
● Background in mathematics for Addison Wesley, 2018
cryptography
[Link] Oorschot:
● Security objectives:
Computer Security and the
Confidentiality, Integrity,
Internet, Springer, 2021
Authenticity
● Symmetric and asymmetric J. Katz, Y. Lindell:
cryptography Introduction to Modern
● Hash functions and digital Cryptography, Chapman &
signatures Hall, 2020
● Protocols for key distribution
Part II: IT-Security and
Dependability
● Basic concepts of IT security
● Authentication
● Access control models and
mechanisms
● Basic concepts of network
security
Page 2 / 5
● Basic concepts of software
security
● Basic concepts of web security
● Dependable systems: error
tolerance, redundancy,
availability
Software Engineering ● Requirements Analysis Software Engineering; Ian
● Domain Modelling Sommerville; Pearson
● Object-oriented Analysis and
Design Design Patterns - Elements
of Reusable Object-
● Software Architecture
Oriented Software; E.
● Software Quality, in particular: Gamma, R.
o Verification (among Helm, R. Johnson, J.
others, testing and static Vlissides; Prentice Hall
analysis)
o Software Metrics Writing Effective Use
● Design Patterns Cases; A. Cockburn;
● Refactoring Pearson
● Software Evolution and
Software Variability
Visual Computing ● Basics of perception R. Szeliski, “Computer
● Basic Fourier transformation Vision: Algorithms and
● Images, filtering, compression & Applications”, Springer
processing 2011
● Basic object recognition
B. Blundell, “An
● Geometric transformations Introduction to Computer
● Basic 3D reconstruction Graphics and Creative 3D
● Surface and scene Environments”,
representations Springer 2008
● Rendering algorithms
● Color: Perception, spaces &
models
● Basic visualization
Introduction to Artificial Intelligence Foundations: Artificial Intelligence: A
● Introduction, History of AI Modern Approach,;Stuart
● Intelligent Agents Russell, Peter Norvig;
Pearson
Search:
● Uninformed Search
● Heuristic Search
● Local Search
● Constraint Satisfaction Problems
● Games: Adversarial Search
Page 3 / 5
Planning:
● Planning in State Space
● Planning in Plan Space
Decisions under Uncertainty:
● Uncertainty and Probabilities
● Bayesian Networks
● Decision Making
Machine Learning:
● Neural Networks
● Reinforcement Learning
Philosophical Foundations
Probabilistic methods in computer ● Basics from probability theory, M. Mitzenbacher, E.
science: statistics and information theory. Upfahl: Probability and
● Probabilistic approaches to Computing, Cambridge
University Press
graph-based modeling in
computer science S.H. Chan: Probability for
● Basic probabilistic problems and Data Science, Michigan
use of probabilistic methods University Press
o in practical computer K. P. Murphy: Probabilistic
science (e.g. run-time Machine Learning, MIT
analysis of programs, data Press
compression),
D.J.C. MacKay:
o in technical computer Information Theory,
science (e.g., reliability of Inference, and Learning
hardware, caching), and Algorithms, Cambridge
o in applied computer science University
(e.g., simulation of Press
stochastic systems,
probabilistic robotics).
● Selected randomized algorithms,
their analysis by 'The
Probabilistic Method', algorithms
for automated decision making
and optimization
● Application of probabilistic
methods in artificial intelligence
(e.g. learning methods, neural
networks) and data science
● Implementation of probabilistic
methods by means of practical
programming examples
Page 4 / 5
Computer Networks and Distributed ● Overview of networked and J. Kurose, K. Ross:
Systems distributed systems, which are a Computer Networks,
fundamental building block of Pearson Education 2021
(also in german)
modern computer science. The
course covers fundamental M. van Steen, A.
concepts of designing, modelling, Tanenbaum: Distributed
planning and evaluating Systems, distributed-
networked and distributed [Link], 2017.
systems.
● Foundations: Services, protocols, Selected chapters of
connection, layer model
G. Coulouris, J. Dollimore,
● Role of link layer, network layer, T. Kindberg: Distributed
transport layer, application layer Systems – Concept and
● Basic mechanisms (algorithms, Design, Pearson Studium
protocols) for multiplexing,
broadcast, multicast, routing and A. Tanenbaum, D.
forwarding Wetherall: Computer
Networks, Pearson
● Quality of service and reliability:
Education 2012 (also in
definition and mechanisms german)
● Coordination in distributed
systems: from primitives to W.R. Stevens: Unix
applications Network Programming,
● Selected internet protocols and Volume 1: The Sockets
Networking API (Addison
technology
Wesley)
Page 5 / 5