Autumn Semester 2020 takes place in a mixed form of online and classroom teaching.
Please read the published information on the individual courses carefully.

252-0846-AAL  Computer Science II

SemesterSpring Semester 2018
LecturersF. O. Friedrich
Periodicityevery semester recurring course
Language of instructionEnglish
CommentEnrolment ONLY for MSc students with a decree declaring this course unit as an additional admission requirement.

Any other students (e.g. incoming exchange students, doctoral students) CANNOT enrol for this course unit.


AbstractTogether with the introductory course Informatics I this course provides the foundations of programming and databases. This course particularly covers algorithms and data structures and basics about design and implementation of databases. Programming language used in this course is Java.
ObjectiveBasing on the knowledge covered by lecture Informatics I, the primary educational objectives of this course are
- constructive knowledge of data structures and algorithms amd
- the knowledge of relational databases and
When successfully attended the course, students have a good command of the mechanisms to construct an object oriented program. They know the typically used control and data structures and understand how an algorithmic problem is mapped to a sufficiently efficient computer program. They have an idea of what happens "behind the secenes" when a program is translated and executed. The know how to write database queries and how to design simple databases.
Secondary goals are an algorithmic computational thinking, undestanding the possibilities and limits of programming and to impart the way of thinking of a computer scientist.
ContentWe discuss the paradigm of object oriented programming, typical data structures and algorithms and design principles for the design and usage of relational databases.
More generally, formal thinking and the need for abstraction and importance of appropriate modelling capabilities will be motivated. The course emphasizes applied computer science. Concrete topics are complexity of algorithms, divide and conquer-principles, recursion, sort- and search-algorithms, backtracking, data structures (lists, stacks, queues, trees) and data management in relational data bases.
Lecture notesThe slides will be available for download on the course home page.
LiteratureRobert Sedgewick, Kevin Wayne, Introduction to Programming in Java: An Interdisciplinary Approach, Addison-Wesley, 2008

T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms , 3rd ed., MIT Press, 2009
Prerequisites / NoticePrerequisites are knowledge and programming experience according to course 252-0845-00 Computer Science I (D-BAUG).