|Published (Last):||25 July 2012|
|PDF File Size:||13.48 Mb|
|ePub File Size:||13.43 Mb|
|Price:||Free* [*Free Regsitration Required]|
Suche extern bei StartPage. The study program is structured into modules, classified into courses with or without recitations , seminars, and projects. Courses cover the coherent presentation and impartment of foundations, core knowledge, specialized knowledge, and concepts of selected areas of computer science.
Recitations have the purpose to apply and train the course material by solving related problems. In a seminar , the student familiarizes himself with a specialized computer science topic, by reading of original literature, by presenting the topic to an audience, and by producing a final paper. In a project , the student acquires the ability to work on a larger computer science problem in a small team, applying and training methods and techniques developed in courses.
Seminars and projects are course achievements and can be graded by the lecturers analogous to "benoteter Schein". Nevertheless, they are no examination results and therefore no module grades are assigned and they are not considered at the determination of the final grade. Modules are distinguished into basic modules, core modules, advanced modules, specialization modules, seminar modules, project modules, and minor subject modules.
Basic modules impart foundations of computer science. Core modules extend these foundations to a specific area of computer science.
Advanced modules broaden and deepen the knowledge of such a specific area. Often, advanced modules are specialization modules that are explicitly allowed for an advanced block of the bachelor programme.
Therefore, these modules are listed as specialization modules in the module handbook. Specialization modules impart deepened knowledge of a specific area of computer science. Minor subject modules serve the acquisition of foundations and core knowledge of an application area of computer science.
This module handbook is structured according to these module categories. The module assignments and, in particular, the choices are documented in the study plans of the bachelor and master programmes. Validity The module handbook will be updated regularly at least once every semester. Only the current verion shown at the websites of our department has to be considered valid.
Concerning modules provided by the Computer Science Department the current module handbook always takes precedence over possibly differing statements given in KIS. The specified "frequency" of our courses is only point of reference. Please concider the concrete scheduling of the Lectures.
Editorial remarks Below the Module Handbook is presented as a single, self-contained Webpage. The KIS-references are only valid if the course takes place in the current semester. It communicates the basic principles of programming as well as elementary abstraction mechanisms of software development.
The students learn how to design software modules, how to realize and verify them and how to determine their characteristics. Understanding of the fundamental ideas behind modelling and programming Knowledge of basic programming constructs and techniques; students know the most important constructs and library classes of Java.
Knowledge of elementary algorithms and data types Ability to specify and verify simple algorithms Contents Overview of software development and its importance Technical and formal foundations of programming, basic linguistic aspects syntax and semantics of programming languages Introduction to programming value, elementary data types, function, identifier binding, visibility of bindings, variable, condition, algorithm, control structures, statement, procedure Representation of algorithms Further basic elements of programming type classification, parameterisation, recursion, structured data types, in particular, e.
Band 1 und 2 M. Broy: Informatik. Poetzsch-Heffter: Konzepte objektorientierter Programmierung G. The students learn fundamental techniques that form the basis for modern software engineering.
Foundations of project planning Knowledge of interaction between software modules and larger, sequential software systems as well as frameworks Knowledge of important and fundamental terms in design patterns and elementary modelling techniques Contents Standard process models for software engineering Requirements specification Project planning techniques MPM networks, Gantt-Diagram, cost calculations Phases in software development analysis, design and implementation Modularisation of programs and software e.
Ottmann, P. Widmayer: Algorithmen und Datenstrukturen Mehlhorn K. Band 1 Sortieren und Suchen. Teubner, G. Gamma, R.
Helm, R. Johnson, J. Zuser, S. Biffl, T. Grechenig, M. Forms of examination prerequisites for final ex. Last modification Version 49 sub-modules No submodules assigned. Lindholm, F. Magee, J. Formalization of intuitions, quantitative and qualitative analysis of the models. The techniques of diagonalisation and reduction. The theorems of Rice. Formal languages: grammars, automata and Chomsky's classification.
Pumping lemmata. Abstraction and design methods for coping with complexity. Mechanisation of formal proofs. Contents Propositional logics: Syntax and semantics, calculii for propositional logics, deductive formalisations of propositional logics, natural calculii, algorithmic and equational approach for propositional logics: The method of tableaux, Davis-Putman-algorithms, the resolution method.
First order logics : Syntax, relations between properties of elements, Semantic: Interpretations, valuations, satisfiability, transformation of terms and formulas, undecidability results, deductive constructions of first order logics, main theorems of PL1, first order theories, models, enumeration methods for theorems in PL1, Tableaux- and resolution methods, logic programming and Prolog. Contents Theory of complexity, reductions, complexity classes, the classes P and NP, complete problems.
Fundamental concepts and methods for the analysis of algorithms. Concrete applications: String Matching Search strategies : Backtracking, Branch-and-Bound, LC-search Approximation methods and probabilistic algorithms Heuristic methods: Randomized Rounding, locale improvement strategies, simulated annealing, genetic algorithms and startegies Forms of examination prerequisites for final ex.
Literature M. Entwurf und Analyse von Algorithmen. Springer-Verlag, Cormen, C. Leiserson, R. Rivest, C. Oldenbourg Verlag, Ottmann and P. Algorithmen und Datenstrukturen. Sedgewick and P. An Introduction to the Analysis of Algorithms.
Literature Wird in der Veranstaltung bekannt gegeben. Skills to analyze the performance of computers. Basic knowledge of the functionality of single processor computers. Contents Propositional logic operators, normal forms, Boolean algebra, etc. Implementation of propositional logic by combinatorial circuits Logic minimization Finite state machines FSMs Implementation of FSMs by sequential circuits Coding numbers, symbols, etc. Computer arithmetic fixed point, floating point, logic operations Data path and controller Instruction set architecture v.
Hennessy, D. Meinel and T. Mueller and W. Paul, Computer Architecture: Complexity and Correctness, Springer Verlag, further literature: to be announced in the lecture Last modification Version 49 sub-modules No submodules assigned. Knowledge of managing processes by the operating system.
Usage of synchronization primitives. Contents Pipelining principle, conflicts, forwarding and other implementation techniques Memory hierarchy, organization of caches Bus hierarchy Assembler programming incl. DMA Working memory management virtual memory File management Protection mechanisms Forms of examination prerequisites for final ex. Tanenbaum, Moderne Betriebssysteme, Hanser-Verlag, 2. Es sind transaktionsverarbeitende Systeme, d. Elmasri, R.
Database Management Systems. Mcgraw-Hill Publ. Christopher D. Introduction to Information Retrieval. Cambridge University Press, Design alternatives, for example connection-oriented vs. Quantitative understanding of communication systems Contents Overview on communication systems: terminology, structure, architecture, market Application layer principles and mechanisms with examples like http, email, ftp, DNS Transport layer principles and mechanisms with examples like TCP and UDP Network layer principles and mechanisms with examples like IPv4 addressing, OSPF, BGP Link layer principles and mechanisms with examples like Ethernet, MPLS Physical layer principles as for example Nyquist's and Shannon's theorems Forms of examination prerequisites for final ex.
Kurose and K. Pearson, 2nd Edition, Computer Networks. Prentice Hall, 4th edition,
Forschung und Gutachten