Technical Foundations of Computer Science
Lecturer /contact:
Prof. Dr.-Ing. habil. R. G. Spallek, Dr.-Ing. M. Zabel
Component of the following modules:
INF-B-390, INF-D-420, INF-LE-EUI, INF-LE-MA, IST-05-PF-GS, MATH-BA-INFE, MATH-BA-INFF, MATH-MA-INFTGL
Frequency:
The course takes place in winter semester.
Time and place:
Please take time and place from the teaching offer catalogue of the faculty informatics.
Please register with the help of jExam.
Contents and qualification aims:
The goal of the course is representation and use of electronic devices and electronic circuits of information technology in informatics and computer engineering. Beginning with an introduction to digital electronics and integration technology basic qualities, realization and areas of application for lectronic binary gates are shown. Subsequently the treatment of complex digital combinatorial circuit occurs on the base of gates. It includes their Boolean description, simplification methods, analysis and synthesis. Afterwards storage elements , also composed of gates, are introduced as a precondition for the realisation of sequential circuit and their functional principles are described. Simple sequential circuits, their components and methods of analysis and synthesis finish the course.
Table of contents:
- Introduction
- Electronic components
- Integration technology
- Digital gates
- Combinational logic
- Storage elements
- Sequential circuit
References:
- R. G. Spallek: Vorlesungsskript zur Lehrveranstaltung
- E. Konrad: Aufgabensammlung GTI
- H. Bäring: Mikrorechnersysteme. Springer-Verlag, Berlin u.a., 1994.
- A. Bode: Technische Grundlagen der Informatik. BI Wissenschaftsverlag, Mannheim, 1994.
- Th. Flik und H. Liebig: Mikroprozessortechnik. Springer-Verlag, Berlin u.a., 1990.
- R. Paul: Elektrotechnik und Elektronik für Informatiker. Bd. 1-Bd. 2. Teubner-Verlag, Stuttgart, 1994.
- W. Schiffmann und R. Schmitz: Technische Informatik. Bd.1-Bd.3, Springer-Verlag, Berlin u.a., 1992.
Type of course:
required course
Temporal extend:
3 SWS (1 SWS = 45 minutes per week) lecture,
2 SWS recitation section
Basic knowledge desired:
in particular confident handling with Boolean algebra and Boolean functions
Final achievement:
written exam, 120 min
Sequel to course:
laboratory course in hardware