Computer Science for Engineers I

This two-semester course provides an overview of the models and methods that are used for the formal description and the systematic construction of modern computing systems. Equal emphasis is put on software and on hardware techniques, which are both presented from an engineering perspective.

Participation in the course Programming Methods in the first semester or equivalent practical programming experience.

• 2nd Semester Electrical Engineering
• 2nd. Semester Computer Science Engineering
• 2nd. Semester General Engineering

1. Introduction: Models and abstractions in computer scienc

• Computing systems: digital data, algorithms and processes
• Objectives and methods of computer science
• Mathematical fundamentals

2. Atomic data types and digital data representation

• Boolean values and Boolean algebra, Bit sequences and bit vectors
• Numeric data types and computer arithmetic
• Floating point numbers
• Character sets and alphabets

3. Data structures and data types

3.1 Basic concpets of the programming language Java

3.2 Software: Predefined and user-defined data types (typing, simple types and reference types)

4. Stateless digital systems

4.1 Hardware: Combinatory circuits (construction, adder, carry-bypass circuits, multiplexer, ...)

4.2 Software: Functional programming techniques

• Block.structures
• Function abstraction and application
• Recursion over natural numbers, linear data structures and tree structures
• Higher-order functions and iterators

5. Sequential stateful digital systems

5.1 Model: Automata and Grammars

• Motivation and examples
• Chomsky Hierarchy
• System description via languages: grammar, syntax tree, production system
• System description via automata (DFA, NFA, PDA)

5.2 Hardware: Synchronous sequential circuits (flip-flops, register, counter, memory)

5.3 Software: Imperative programming techniques

• Assignment, side-effect, aliasing
• Control structures, invariants, variants
• Arrays and matricesn
• Exception handling

5.4 Software: Object-oriented programming techniques

• Emcapsulation and data abstraction
• Late binding
• Inheritance
• Abstract classes and interfaces

6. Fundamentals of computer architectures

• Von-Neumann-Architecture
• A simple microprosessor architecture in detail
• The Intel 8086 architecture

• Uwe Schöning: Theoretische Informatik kurz gefaßt, BI, 1992.
• Walter Oberschelp, Gottfried Vossen: Rechneraufbau und Rechnerstrukturen, 5. Auflage, Oldenbourg Verlag, 1992.
• Klaus Waldschmidt: Schaltungen der Datenverarbeitung. Teubner, 1992.
• James Gosling, Bill Joy, Guy Steele: The Java Language Specification, Addison-Wesley, 1996.
• Thomas A. Standish: Data Structures in Java, Addison-Wesley, 1997.
• Hans-Jochen Schneider (Hrsg): Lexikon Informatik und Datenverarbeitung, Oldenbourg Verlag, 1997.
• W. Giloi, H. Liebig: Logischer Entwurf digitaler Systeme. Springer-Verlag, 1980.
• J.E. Hopcroft, J.D. Ullmann, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
• Alfred V. Aho, Jeffrey D. Ullmann: Foundations of Computer Science (C Edition), Computer Science Press, Freeman and Company, New York, Third Printing, 1997.

• Wolfgang Kowal: System, Modell, Programm: Vom GOTO zur objektorientierten Programmierung. Spektrum Akademischer Verlag 1996.
• Manfred Broy: Informatik - eine grundlegende Einführung, 3 Bände, Springer-Verlag, 1992-1994.
• Fritz Mayer-Lindenberg: Konstruktion digitaler Systeme: Eine kurze Einführung in die Informatik, Verlag Vieweg, Wiesbaden, 1998
• Peter Pepper: Grundlagen der Informatik, Oldenbourg, München, 1992.
• Goldschlager / Lister: Informatik, eine moderne Einführung, Hanser, München, 2. Aufl. 1986.
• Bergmann/Noll: Mathematische Logik mit Informatik-Anwendungen, Springer-Verlag.
• Peters: Einführung in mathematische Methoden der Informatik, BI.
• Sander/Stucky/Herschel: Automaten, Sprachen, Berechenbarkeit, Teubner 1992.
• Schöning: Logik für Informatiker, BI, 1989.
• Literaturtips und Tutorials für Java