Module Catalogue - uni-wuerzburg.de · Advanced Topics of Didactic of Informatics 65 Practical Course in Didactics of Informatics 66 Advanced Practical Course in Didactics of Informatics

Module Cataloguefor the Subject

Computer Scienceas vertieft studiertes Fach (studied with a focus on the

scientific discipline)

with the degree "Erste Staatsprüfung für das Lehramt an

Gymnasien"

Examination regulations version: 2009Responsible: Institute of Computer Science

JMU Würzburg • generated 17-Sep-2019 • exam. reg. data record L5|079|-|-|H|2009

Module Catalogue for the SubjectComputer Science

LA Gymnasien

Contents

The subject is divided into 4Abbreviations used, Conventions, Notes, In accordance with 5

Scientific Discipline 6Compulsory Courses 7

Algorithm and data structures 8Software Technology 9Databases 10Object-Oriented Programming 11Practical Course in Programming 12Practical course in software 13Theoretical informatics 14Technical Informatics 1 15Technical Informatics 2 16

Compulsory Electives 17Digital computer systems 18Information Transmission 19Logic for informatics 20Practical Course in Hardware 21Algorithmic Graph Theory 22Knowledge-based Systems 23Data Mining 24Theory of Complexity 25Automation and Control Technology 26Computer Networks and Communication Systems 27Seminar 1 28Seminar 2 29Review Course in Informatics for the Staatsexamen (Gymnasium) 30Databases II 31Data Compression 32Programming of Distributed Systems 33Information Retrieval 34Natural Language Processing and Text Mining 35Artificial Intelligence 36Embedded Systems 37E-Learning 38Robotics 39Robotics II: Networked Robots 40Deductive Databases 41Analytical Performance Evaluation of Distributed Systems 42Simulation Techniques for Performance Evaluation 43Automata Theory 44Computability Theory 45Mathematical Logic 46Advanced Topics in Computational Complexity 47Cryptography and Data Security 48Computational Geometry 49Approximation Algorithms 50Visualization of Graphs 51Algorithms for Geographic Information Systems 52Compiler Construction 53Program Design and Analysis 54Computer Arithmetic 55Computer Science in Media 1 56

LA Gymnasien Computer Science (2009) JMU Würzburg • generated 17-Sep-2019 • exam. reg.data record Lehramt Gymnasien Informatik - 2009

page 2 / 69


LA Gymnasien

Computer Science in Media 2 57

Teaching 58Didactics of Informatics 1 59Didactics of Informatics 2 60Practical Course in the Application of Informatics Systems from a Didactical Point of View 61

Freier Bereich (general as well as subject-specific electives) 62Computer Science 63

Seminar Didactics of Informatics 64Advanced Topics of Didactic of Informatics 65Practical Course in Didactics of Informatics 66Advanced Practical Course in Didactics of Informatics 67

Thesis 68Thesis Informatics (Gymnasium) 69


page 3 / 69


LA Gymnasien

The subject is divided into

section / sub-section ECTS creditsstarting

pageScientific Discipline 92 6Compulsory Courses 70 7Compulsory Electives 22 17

Teaching 10 58Freier Bereich (general as well as subject-specific electives) 0-15 62Computer Science 63Thesis 10 68


page 4 / 69


LA Gymnasien

Abbreviations used

Course types: E = field trip, K = colloquium, O = conversatorium, P = placement/lab course, R = pro-ject, S = seminar, T = tutorial, Ü = exercise, V = lecture

Term: SS = summer semester, WS = winter semester

Methods of grading: NUM = numerical grade, B/NB = (not) successfully completed

Regulations: (L)ASPO = general academic and examination regulations (for teaching-degree program-mes), FSB = subject-specific provisions, SFB = list of modules

Other: A = thesis, LV = course(s), PL = assessment(s), TN = participants, VL = prerequisite(s)

Conventions

Unless otherwise stated, courses and assessments will be held in German, assessments will be offeredevery semester and modules are not creditable for bonus.

Notes

Should there be the option to choose between several methods of assessment, the lecturer will agreewith the module coordinator on the method of assessment to be used in the current semester by twoweeks after the start of the course at the latest and will communicate this in the customary manner.

Should the module comprise more than one graded assessment, all assessments will be equallyweighted, unless otherwise stated below.

Should the assessment comprise several individual assessments, successful completion of the modulewill require successful completion of all individual assessments.

In accordance with

the general regulations governing the degree subject described in this module catalogue:

LASPO2009

associated official publications (FSB (subject-specific provisions)/SFB (list of modules)):

27-Feb-2013 (2013-31)

This module handbook seeks to render, as accurately as possible, the data that is of statutory relevan-ce according to the examination regulations of the degree subject. However, only the FSB (subject-spe-cific provisions) and SFB (list of modules) in their officially published versions shall be legally binding.In the case of doubt, the provisions on, in particular, module assessments specified in the FSB/SFBshall prevail.


page 5 / 69

http://www.uni-wuerzburg.de/amtl_veroeffentlichungen/


LA Gymnasien

Scientific Discipline(92 ECTS credits)


page 6 / 69


LA Gymnasien

Compulsory Courses(70 ECTS credits)


page 7 / 69


LA Gymnasien

Module title Abbreviation

Algorithm and data structures 10-I-ADS-102-m01

Module coordinator Module offered by

Dean of Studies Informatik (Computer Science) Institute of Computer Science

ECTS Method of grading Only after succ. compl. of module(s)

10 numerical grade --

Duration Module level Other prerequisites

1 semester undergraduate Admission prerequisite to assessment: exercises (type and scope to beannounced by the lecturer at the beginning of the course).

Contents

Design and analysis of algorithms, recursion vs. iteration, sort and search methods, data structures, abstract da-ta types, lists, trees, graphs, basic graph algorithms, programming in Java.

Intended learning outcomes

The students are able to independently design algorithms as well as to precisely describe and analyse them. Thestudents are familiar with the basic paradigms of the design of algorithms and are able to apply them in practicalprograms. The students are able to estimate the run-time behaviour of algorithms and to prove their correctness.

Courses (type, number of weekly contact hours, language — if other than German)

V + Ü (no information on SWS (weekly contact hours) and course language available)

Method of assessment (type, scope, language — if other than German, examination offered — if not every semester, information on whether

module is creditable for bonus)

written examination (approx. 80 to 90 minutes). If announced by the lecturer by four weeks prior to the examina-tion date, the written examination can be replaced by an oral examination of one candidate each or an oral ex-amination in groups. A 80 to 90 minute written examination is equivalent to a 20 minute (approx.) oral examina-tion of one candidate each, a 30 minute (approx.) oral examination in groups of 2 and a 40 minute (approx.) oralexamination in groups of 3.

Allocation of places

--

Additional information

--

Referred to in LPO I (examination regulations for teaching-degree programmes)

§ 49 (1) 1. a) Informatik Theoretische Informatik, Algorithmen und Datenstrukturen§ 69 (1) 1. a) Informatik Theoretische Informatik, Algorithmen und Datenstrukturen


page 8 / 69


LA Gymnasien


Software Technology 10-I-ST-102-m01







Contents

Object-oriented software development with UML, development of graphical user interfaces, foundations of data-bases and object-relational mapping, foundations of web programming (HTML, XML), software development pro-cesses, unified process, agile software development, project management, quality assurance.


The students possess a fundamental theoretical and practical knowledge on the design and development ofsoftware systems.







--


--


§ 49 (1) 1. b) Datenbanksysteme und Softwaretechnologie§ 69 (1) 1. b) Datenbanksysteme und Softwaretechnologie


page 9 / 69


LA Gymnasien


Databases 10-I-DB-102-m01







Contents

Relational algebra and complex SQL statements; database planning and normal forms; transaction manage-ment.


The students possess knowledge about database modelling and queries in SQL as well as transactions.





written examination (approx. 50 to 60 minutes); if announced by the lecturer by four weeks prior to the examina-tion date, the written examination can be replaced by an oral examination of one candidate each or an oral ex-amination in groups (one candidate each: 15 minutes, groups of 2: 20 minutes, groups of 3: 25 minutes)Language of assessment: German, English if agreed upon with the examiner


--


--


§ 49 (1) 1. b) Datenbanksysteme und Softwaretechnologie§ 69 (1) 1. b) Datenbanksysteme und Softwaretechnologie


page 10 / 69


LA Gymnasien


Object-Oriented Programming 10-I-OOP-GY-102-m01







Contents

Polymorphism, generic programming, meta programming, web programming, templates, document manage-ment.


The students are proficient in the different paradigms of object-oriented programming and have experience intheir practical use.







--


--


§ 69 (1) 1. b) Datenbanksysteme und Softwaretechnologie


page 11 / 69


LA Gymnasien


Practical Course in Programming 10-I-PP-102-m01




10 (not) successfully completed --



Contents

The programming language Java. Independent creation of small to middle-sized, high-quality Java programs.


The students are able to independently develop small to middle-sized, high-quality Java programs.


P (no information on SWS (weekly contact hours) and course language available)





--


Additional information on module duration: 1 to 2 semesters.


§ 49 (1) 1. c) Informatik Praktische Softwareentwicklung§ 69 (1) 1. d) Informatik Praktische Softwareentwicklung


page 12 / 69


LA Gymnasien


Practical course in software 10-I-SWP-102-m01






1 semester undergraduate --

Contents

Completion of a project assignment in groups, problem analysis, creation of requirements specifications, specifi-cation of solution components (e. g. UML) and milestones, user manual, programming documentation, presenta-tion and delivery of the runnable software product in a colloquium.


The students possess the practical skills for the design, development and execution of a software project insmall teams.





completion of project assignments, presentation


--


--


§ 49 (1) 1. c) Informatik Praktische Softwareentwicklung§ 69 (1) 1. d) Informatik Praktische Softwareentwicklung


page 13 / 69


LA Gymnasien


Theoretical informatics 10-I-TI-102-m01







Contents

Computability, decidability, countability, complexity of calculations, Boolean functions and circuits, finite auto-mata and regular sets, generative grammars, context-free languages, context-sensitive languages.


The students possess fundamental and applicable knowledge in the area of computability, decidability, coun-tability, complexity of calculations, Boolean functions and circuits, finite automata and regular sets, generativegrammars, context free languages, context sensitive languages.







--


--


§ 49 (1) 1. a) Informatik Theoretische Informatik, Algorithmen und Datenstrukturen§ 69 (1) 1. a) Informatik Theoretische Informatik, Algorithmen und Datenstrukturen


page 14 / 69


LA Gymnasien


Technical Informatics 1 10-I-TEI1-102-m01






1 semester undergraduate TGL: §69 I Nr. 1 c). Admission prerequisite to assessment: exercises; typeand scope to be announced by the lecturer at the beginning of the cour-se.

Contents

This course teaches the foundations of technical computer science.


The students master the fundamentals of technical computer science.







--


--


§ 69 (1) 1. c) Informatik Technische Informatik


page 15 / 69


LA Gymnasien


Technical Informatics 2 10-I-TEI2-102-m01






1 semester undergraduate TGL: §69 I Nr. 1 c). Admission prerequisite to assessment: exercises; typeand scope to be announced by the lecturer at the beginning of the cour-se.

Contents

This course teaches the foundations of technical computer science.


The students master the fundamentals of technical computer science.







--


--




page 16 / 69


LA Gymnasien

Compulsory Electives(22 ECTS credits)


page 17 / 69


LA Gymnasien


Digital computer systems 10-I-RAL-102-m01


holder of the Chair of Computer Science V Institute of Computer Science





Contents

Introduction to digital technologies, Boolean algebras, combinatory circuits, synchronous and asynchronous cir-cuits, hardware description languages, structure of a simple processor, machine programming, memory hierar-chy.


The students possess a knowledge of the fundamentals of digital technologies up to the design and program-ming of easy microprocessors as well as knowledge for the application of hardware description languages for thedesign of digital systems.







--


--




page 18 / 69


LA Gymnasien


Information Transmission 10-I-IÜ-102-m01


holder of the Chair of Computer Science III Institute of Computer Science





Contents

Introduction to probability calculus, coding theory, coding for fault detection and fault correction, informationtheory, spectrum and Fourier transform, modulation technique, structure of digital transmission systems, intro-duction to the structure of computer networks, communication protocols.


The students possess a technical, theoretical and practical knowledge of the structure of systems for informationtransmission, a knowledge that is necessary to understand these systems.







--


--




page 19 / 69


LA Gymnasien


Logic for informatics 10-I-LOG-102-m01







Contents

Syntax and semantics of propositional logic, equivalence and normal forms, Horn formulas, SAT, resolution, infi-nite formula sets, syntax and semantics of predicate logic.


The students are proficient in the following areas: syntax and semantics of propositional logic, equivalence andnormal forms, Horn formulas, SAT, resolution, infinite formula sets, syntax and semantics of predicate logic.





written examination (approx. 50 to 60 minutes); if announced by the lecturer by four weeks prior to the examina-tion date, the written examination can be replaced by an oral examination of one candidate each or an oral ex-amination in groups (one candidate each: 15 minutes, groups of 2: 20 minutes, groups of 3: 25 minutes)


--


--


--


page 20 / 69


LA Gymnasien


Practical Course in Hardware 10-I-HWP-102-m01







Contents

Practical experiments on hardware aspects, for example in communication technology, robots or the structure ofa complete microprocessor.


The students are able to independently review, prepare and perform experiments with the help of experiment de-scriptions, to independently search for additional information as well as to document and evaluate experimentresults.





completion of project assignments, presentation (type and expenditure of time to be specified by the lecturer atthe beginning of the course)


--


--


--


page 21 / 69


LA Gymnasien


Algorithmic Graph Theory 10-I-GT-102-m01







Contents

We discuss typical graph problems: We solve round trip problems, calculate maximal flows, find matchings andcolourings, work with planar graphs and find out how the ranking algorithm of Google works. Using the examplesof graph problems, we also become familiar with new concepts, for example how we model problems as linearprograms or how we show that they are fixed parameter computable.


The students are able to model typical problems in computer science as graph problems. In addition, the parti-cipants are able to decide which tool from the course helps solve a given graph problem algorithmically. In thiscourse, students learn in detail how to estimate the run time of given graph algorithms.







--


--


--


page 22 / 69


LA Gymnasien


Knowledge-based Systems 10-I-WBS-102-m01


holder of the Chair of Computer Science VI Institute of Computer Science





Contents

Foundations in the following areas: knowledge management systems, knowledge representation, solving me-thods, knowledge acquisition, learning, guidance dialogue, semantic web.


The students possess theoretical and practical knowledge for the understanding and design of knowledge-basedsystems including knowledge formalisation and have acquired experience in a small project.







--


--


--


page 23 / 69


LA Gymnasien


Data Mining 10-I-DM-102-m01







Contents

Foundations in the following areas: definition of data mining and knowledge, discovery in databases, processmodel, relationship to data warehouse and OLAP, data preprocessing, data visualisation, unsupervised learningmethods (cluster and association methods), supervised learning (e. g. Bayes classification, KNN, decision trees,SVM), learning methods for special data types, other learning paradigms.


The students possess a theoretical and practical knowledge of typical methods and algorithms in the area of da-ta mining and machine learning. They are able to solve practical knowledge discovery problems with the help ofthe knowledge acquired in this course and by using the KDD process. They have acquired experience in the useor implementation of data mining algorithms.







--


--


--


page 24 / 69


LA Gymnasien


Theory of Complexity 10-I-KT-102-m01







Contents

Complexity measurements and classes, general relationships between space and time classes, memory con-sumption versus computation time, determinism versus indeterminism, hierarchical theorems, translation me-thods, P-NP problem, completeness problems, Turing reduction, interactive proof systems.


The students possess a fundamental and applicable knowledge in the areas of complexity measurements andclasses, general relationships between space and time classes, memory consumption versus computation time,determinism versus indeterminism, hierarchical theorems, translation methods, P-NP problem, completenessproblems, Turing reduction, interactive proof systems.







--


--


--


page 25 / 69


LA Gymnasien


Automation and Control Technology 10-I-AR-102-m01


holder of the Chair of Computer Science VII Institute of Computer Science





Contents

Overview of automation systems, fundamental principles of control technology, Laplace transformation, transferfunction, plant, controller types, basic feedback loop, fundamental principles of control engineering, automata,structure of Petri nets, Petri nets for automisation, machine-related structure of processing computation machi-nes, communication between process computers and periphery devices, software for automation systems, pro-cess synchronisation, process communication, real-time operating systems, real-time planning.


The students master the fundamentals of automation and control.





written examination (approx. 80 to 90 minutes). If announced by the lecturer by four weeks prior to the examina-tion date, the written examination can be replaced by an oral examination of one candidate each or an oral ex-amination in groups. A 80 to 90 minute written examination is equivalent to a 20 minute (approx.) oral examina-tion of one candidate each, a 30 minute (approx.) oral examination in groups of 2 and a 40 minute (approx.) oralexamination in groups of 3.Language of assessment: German, English if agreed upon with the examiner


--


--


--


page 26 / 69


LA Gymnasien


Computer Networks and Communication Systems 10-I-RK-102-m01







Contents

Properties of computer and communication systems: data traffic in distributed systems. Performance analysisof computer networks and communication systems: problem statement and introduction to method architectureand structure of computer networks: network structure, network access, access methods, digital transfer hierar-chies, dataflow control and traffic control, transfer network. Communication protocols: fundamental principlesand ISO architecture models. Internet: structure and basic mechanism, TCP/IP, routing, network management.Mobile communication networks: fundamental concepts, GSM, UMTS. Future communication systems and net-works.


The students possess an intricate knowledge of the structure of computer networks and communication systemsas well as fundamental principles to rate these systems.







--


--


--


page 27 / 69


LA Gymnasien


Seminar 1 10-I-SEM1-072-m01







Contents

Independent review of a current topic in computer science on the basis of literature and, where applicable, soft-ware with written and oral presentation. The topics in modules 10-I-SEM1 and 10-I-SEM2 must come from diffe-rent areas (this usually means that they are assigned by different lecturers).


The students are able to independently review a current topic in computer science, to summarise the mainaspects in written form and to orally present these in an appropriate way.


S (no information on SWS (weekly contact hours) and course language available)



written elaboration and oral presentation with subsequent discussion on a topic from the field of computerscience (type and length to be specified by the lecturer at the beginning of the course)Language of assessment: German, English if required by the examination candidate


--


--


--


page 28 / 69


LA Gymnasien


Seminar 2 10-I-SEM2-072-m01







Contents

Independent review of a current topic in computer science on the basis of literature and, where applicable, soft-ware with written and oral presentation. The topics in modules 10-I-SEM1 and 10-I-SEM2 must come from diffe-rent areas (this usually means that they are assigned by different lecturers).


The students are able to independently review a current topic in computer science, to summarise the mainaspects in written form and to orally present these in an appropriate way.





written elaboration and oral presentation with subsequent discussion on a topic from the field of computerscience (type and length to be specified by the lecturer at the beginning of the course)Language of assessment: German, English if required by the examination candidate


--


--


--


page 29 / 69


LA Gymnasien


Review Course in Informatics for the Staatsexamen (Gymnasium) 10-I-REP-GY-092-m01







Contents

Revision of contents of modules covering the subject as well as the subject didactics of computer science.


The students have refreshed their skills for the solution of the type of problems asked in the written state exami-nation.


Ü (no information on SWS (weekly contact hours) and course language available)





--


--


--


page 30 / 69


LA Gymnasien


Databases II 10-I=DB2-102-m01






1 semester graduate Where applicable, prerequisites as specified by the lecturer at the begin-ning of the course (e. g. completion of exercises).

Contents

Data warehouses and data mining; XML databases; web databases;introduction to Datalog.


The students have advanced knowledge about relational databases, XML and data mining.







--


--


--


page 31 / 69


LA Gymnasien


Data Compression 10-I=DK-102-m01


holder of the Chair of Computer Science II Institute of Computer Science





Contents

Entropy coding, text compression, dictionary methods, block transformations, image compression, human visualsystem, bitplane techniques, predicative methods, hierarchical transformations, discrete cosine transform, wa-velets, JPEG baseline, JPEG 200, subband coding, fractal compression, vector quantisation, video compression,MPEG standards, audio compression.


The students possess the methodic knowledge and practical skills for the development and use of compressionmethods for text, image, video and audio data.







--


--


--


page 32 / 69


LA Gymnasien


Programming of Distributed Systems 10-I=PVS-102-m01







Contents

Design and development of parallely and distributedly executed programs.


The students possess the methodic knowledge and practical skills for the design and development of parallelyand distributedly running programs.







--


--


--


page 33 / 69


LA Gymnasien


Information Retrieval 10-I=IR-102-m01







Contents

IR models (e. g. Boolean and vector space model, evaluation), processing of text (tokenising, text properties),data structures (e. g. inverted index), query elements (e. g. query operations, relevance feedback, query langua-ges and paradigms, structured queries), search engine (e. g. architecture, crawling, interfaces, link analysis), me-thods to support IR (e. g. recommendation systems, text clustering and classification, information extraction).


The students possess theoretical and practical knowledge in the area of information retrieval and have acquiredthe technical know-how to create a search engine.







--


--


--


page 34 / 69


LA Gymnasien


Natural Language Processing and Text Mining 10-I=STM-102-m01






1 semester undergraduate Where applicable, prerequisites as specified by the lecturer at the begin-ning of the course (e. g. completion of exercises).

Contents

Foundations in the following areas: definition of NLP and text mining, properties of text, sentence boundary de-tection, tokenisation, collocation, N-gram models, morphology, hidden Markov models for tagging, probabili-stic parsing, word sense disambiguation, term extraction methods, information extraction, sentiment analysis.The students possess theoretical and practical knowledge about typical methods and algorithms in the area oftext mining and language processing mostly for English. They are able to solve problems through the methodstaught. They have gained experience in the application of text mining algorithms.


The students possess theoretical and practical knowledge about typical methods and algorithms in the area oftext mining and language processing. They are able to solve practical problems with the methods acquired inclass. They have gained experience in the application of text mining algorithms.







--


--


--


page 35 / 69


LA Gymnasien


Artificial Intelligence 10-I=KI-102-m01







Contents

Intelligent agents, uninformed and heuristic search, constraint problem solving, search with partial information,propositional and predicate logic and inference, knowledge representation, planning, probabilistic closure andBayesian networks, utility theory and decidability problems, learning from observations, knowledge while lear-ning, neural networks and statistical learning methods, reinforcement learning.


The students possess theoretical and practical knowledge about artificial intelligence and are able to assesspossibilities for its application.







--


--


--


page 36 / 69


LA Gymnasien


Embedded Systems 10-I=ES-102-m01


holder of the Chair of Computer Science V Institute of Computer Science





Contents

Models of embedded systems, implementation methods (ASIC, AISIP, micro controller), verification of embeddedsystems, implementation planning static, periodic and dynamic, binding problems, hardware synthesis, softwa-re synthesis.


The students are familiar with the technical possibilities for the design of embedded systems and master themost important techniques for the modelling, verification and optimisation of such systems in hardware andsoftware.







--


--


--


page 37 / 69


LA Gymnasien


E-Learning 10-I=EL-102-m01







Contents

Learning paradigms, learning system types, author systems, learning platforms, standards for learning systems,intelligent tutoring systems, student models, didactics, problem-oriented learning and case-based training sy-stems, adaptive tutoring systems, computer-supported cooperative learning, evaluation of learning systems.


The students possess a theoretical and practical knowledge about eLearning and are able to assess possible ap-plications.







--


--


--


page 38 / 69


LA Gymnasien


Robotics 10-I=RO-102-m01







Contents

History, applications and properties of robots, direct kinematics of manipulators: coordinate systems, rotations,homogenous coordinates, axis coordinates, arm equation. Inverse kinematics: solution properties, end effec-tor configuration, numerical and analytical approaches, examples of different robots for analytical approaches.Workspace analysis and trajectory planning, dynamics of manipulators: Lagrange-Euler model, direct and inver-se dynamics. Mobile robots: direct and inverse kinematics, propulsion system, tricycle, Ackermann steering, ho-lonomes and non-holonome restrictions, kinematic classification of mobile robots, posture kinematic model.Movement control and path planning: roadmap methods, cell decomposition methods, potential field methods.Sensors: position sensors, speed sensors, distance sensors.


The students master the fundamentals of robot manipulators and vehicles and are, in particular, familiar withtheir kinematics and dynamics as well as the planning of paths and task execution.







--


--


--


page 39 / 69


LA Gymnasien


Robotics II: Networked Robots 10-I=RO2-102-m01







Contents

Foundations of dynamic systems, controllability and observability, controller design through pole assignment:feedback and feed-forward, state observer, feedback with state observer, time discrete systems, stochastic sy-stems: foundations of stochastics, random processes, stochastic dynamic systems, Kalman filter: derivation, in-itialising, application examples, problems of Kalman filters, extended Kalman filter.


The students master all fundamentals that are necessary to understand Kalman filters and their use in applica-tions of robotics. The students possess a knowledge of advanced controller and observer methods and recogni-se the connections between the dual pairs controllability - observability as well as controller design and observerdesign. They also recognise the relationship between the Kalman filter as a state estimator and an observer.







--


--


--


page 40 / 69


LA Gymnasien


Deductive Databases 10-I=DDB-102-m01







Contents

Syntax and semantics of logic programs; data structures, program structures and applications for Prolog; analyti-cal methods for Datalog; negation and stratification; disjunctive logic programs.


The students possess expertise in working with Prolog and Datalog (including negation and disjunction).







--


--


--


page 41 / 69


LA Gymnasien


Analytical Performance Evaluation of Distributed Systems 10-I=LVS-102-m01







Contents

Traffic theoretic models, fundamental concepts of theory of probability, transformation techniques, stochasticprocesses, methods for performance analysis of technical systems, queue-/traffic theory, analysis of Markov,non-Markov and time critical systems, matrix analytical method, practical examples for performance analysis ofcomputer systems and networks: throughput and goodput analysis and other characteristics.


The students possess the methodic knowledge and the practical skills necessary to model technical systems bymeans of the theory of probability and mathematical statistics.







--


--


--


page 42 / 69


LA Gymnasien


Simulation Techniques for Performance Evaluation 10-I=ST-102-m01







Contents

Introduction to simulation techniques, statistical groundwork, creation of random numbers and random varia-bles, random sample theory and estimation techniques, statistical analysis of simulation values, inspection ofmeasured data, planning and evaluation of simulation experiments, special random processes, possibilities andlimits of model creation and simulation, advanced concepts and techniques, practical execution of simulationprojects.


The students possess the methodic knowledge and the practical skills necessary for the stochastic simulation of(technical) systems, the evaluation of results and the correct assessment of the possibilities and limits of simu-lation methods.







--


--


--


page 43 / 69


LA Gymnasien


Automata Theory 10-I=AUT-102-m01






1 semester graduate Admission prerequisite to assessment: exercises (type and scope to beannounced by the lecturer at the beginning of the course).

Contents

Finite automata, regular languages, star-free languages, natural equivalence relations, predicate logic withwords, language acceptance through monoids, syntactic monoid, predicate logical and algebraic characterisati-on of regular languages and star-free languages, two-way automata.


The students possess a fundamental and applicable knowledge in the areas of finite automata, regular langua-ges, star-free languages, natural equivalence relations, predicate logic with words, language acceptance throughmonoids, syntactic monoid, predicate logical and algebraic characterisation of regular and star-free languages,two-way automata.







--


--


--


page 44 / 69


LA Gymnasien


Computability Theory 10-I=BER-102-m01







Contents

Gödel numbering, computable functions, decidable and countable sets, halting problem, m-reducibility, creativeand productive sets, relative computability, Turing reduction, countable degrees, arithmetic hierarchy.


The students possess a fundamental and applicable knowledge in the areas of Gödel numbers, countable functi-ons, decidable and countable sets, halting problem, m-reducibility, creative and productive sets, relative compu-tability, Turing reduction, countable degrees, arithmetic hierarchy.







--


--


--


page 45 / 69


LA Gymnasien


Mathematical Logic 10-I=ML-102-m01







Contents

Propositional logic, first-order predicate logic, proof and deduction, Gödel's completeness theorem, Tarski theo-rem, Gödel's incompleteness theorem, undecidability and nonaxiomatisability of elemental arithmetic.


The students possess a fundamental and applicable knowledge in the areas of propositional logic, first-orderpredicate logic, proof and deduction, Gödel's completeness theorem, Tarski theorem, Gödel's incompletenesstheorem, undecidability and nonaxiomatisability of elemental arithmetic.







--


--


--


page 46 / 69


LA Gymnasien


Advanced Topics in Computational Complexity 10-I=KT2-122-m01







Contents

Properties of NP-complete sets, autoreducibility, interactive proof systems, polynomial time hierarchy, complexi-ty of probabilistic algorithms.


The students possess a fundamental and applicable knowledge in the areas of properties of NP-complete sets,autoreducibility, interactive proof systems, polynomial time hierarchies, complexity of probabilistic algorithms.







--


--


--


page 47 / 69


LA Gymnasien


Cryptography and Data Security 10-I=KD-102-m01







Contents

Private key cryptography systems, Vernam one-time pad, AES, perfect security, public key cryptography systems,RSA, Diffie-Hellman, Elgamal, Goldwasser-Micali, digital signature, challenge-response methods, secret sharing,millionaire problem, secure circuit evaluation, homomorphous encryption.


The students possess a fundamental and applicable knowledge in the areas of private key cryptography sy-stems, Vernam one-time pad, AES, perfect security, public key cryptography, RSA, Diffie-Hellman, Elgamal, Gold-wasser-Micali, digital signature, challenge-response method, secret sharing, millionaire problem, secure circuitevaluation, homomorphous encryption







--


--


--


page 48 / 69


LA Gymnasien


Computational Geometry 10-I=AG-102-m01


holder of the Chair of Computer Science I Institute of Computer Science





Contents

In many areas of computer science -- for example robotics, computer graphics, virtual reality and geographic in-formation systems -- it is necessary to store, analyse, create or manipulate spatial data. This class is about thealgorithmic aspects of these tasks: We will acquire techniques that are needed to plan and analyse geometric al-gorithms and data structures. Every technique will be illustrated with a problem in the practical areas listed abo-ve.


The students are able to decide which algorithms or data structures are suitable for the solution of a given geo-metric problem. The students are able to analyse new problems and to come up with their own efficient solutionsbased on the concepts and techniques acquired in the lecture.







--


--


--


page 49 / 69


LA Gymnasien


Approximation Algorithms 10-I=APA-102-m01







Contents

The task of finding the optimal solution for a given problem is omnipresent in computer science. Unfortunately,there are many problems without an efficient algorithm for an optimal solution. As a result, in practice, methodsare used which do not always give the optimal solution but always give good solutions. This lecture will discussdrafting and analysing techniques for algorithms which have a proven approximation quality. With the help ofpractical optimisation problems, the lecture will introduce students to important drafting techniques such asgreedy, local search, scaling as well as methods based on linear programming.


The students are able to analyse easy approximation methods in terms of their quality. They understand fun-damental drafting techniques such as greedy, local search and scaling as well as methods based on linear pro-gramming and are able to apply these to new problems.







--


--


--


page 50 / 69


LA Gymnasien


Visualization of Graphs 10-I=VG-102-m01







Contents

This course covers the most important algorithms to draw graphs. Methods from the course Algorithmische Gra-phentheorie (Algorithmic Graph Theory) such as divide and conquer, flow networks, integer programming andthe planar separator theorem will be used. We will become familiar with measures of quality of a graph drawingas well as algorithms to optimise these measures.


The participants get an overview of graph visualisation and become familiar with typical tools. They consolidatetheir knowledge about the modelling and solving of problems with the help of graphs and graph algorithms.







--


--


--


page 51 / 69


LA Gymnasien


Algorithms for Geographic Information Systems 10-I=AGIS-102-m01







Contents

Algorithmic foundations of geographic information systems and their application in selected problems of acqui-sition, processing, analysis and presentation of spatial information. Processes of discrete and continuous opti-misation. Applications such as the creation of digital height models, working with GPS trajectories, tasks of spa-tial planning as well as cartographic generalisation.


The students are able to formalise algorithmic problems in the field of geographic information systems as well asto select and improve suitable approaches to solving these problems.







--


--


--


page 52 / 69


LA Gymnasien


Compiler Construction 10-I=CB-102-m01







Contents

Lexical analysis, syntactic analysis, semantics, compiler generators, code generators, code optimisation.


The students possess knowledge in the formal description of programming languages and their compilation.They are able to perform transformations between them with the help of finite automata, push-down automataand compiler generators.







--


--


--


page 53 / 69


LA Gymnasien


Program Design and Analysis 10-I=PA-102-m01







Contents

Program analysis, model creation in software engineering, program quality, test of programs, process models.


The students are able to analyse programs, to use testing frameworks and metrics as well as to judge programquality.







--


--


--


page 54 / 69


LA Gymnasien


Computer Arithmetic 10-I=RAM-102-m01







Contents

Spaces of numerical computation, raster and rounding, definition and implementation of computational arithme-tic and interval calculation.


The students possess knowledge about the spaces of numerical computation, raster and roundings, definitionand implementation of computational arithmetic and interval calculation. They master the application of algo-rithms.







--


--


--


page 55 / 69


LA Gymnasien


Computer Science in Media 1 06-MK-MedInf1-102-m01


holder of the Professorship of Media Informatics Institute of Human Computer Media





Contents

Media computer science is an interdisciplinary field of teaching and research, dealing with various aspects of in-formation processing in the context of digital media. The module Medieninformatik 1 (Computer Science for Me-dia 1) provides students with a fundamental knowledge and a practical overview of current digital media types.


Students are familiar with the central concepts of media informatics. They have a basic knowledge of informationprocessing with a special focus on digital media.


V + T (no information on SWS (weekly contact hours) and course language available)



a) written examination (approx. 60 minutes) or b) written examination (approx. 40 minutes) with exercises (40hours), weighted 5:1 or c) oral examination of one candidate each (approx. 30 minutes) or d) presentation (15 to30 minutes) with written elaboration (10 to 15 pages) or e) term paper (15 to 20 pages) or f) portfolio (maximum20 pages)Language of assessment: German, English


Digital Humanities Master's (120 ECTS): maximum 10 places. Places will be allocated according to the numberof subject semesters. Among applicants with the same number of subject semesters, places will be allocated bylot.


--


--


page 56 / 69


LA Gymnasien


Computer Science in Media 2 06-MK-MedInf2-102-m01


holder of the Professorship of Media Informatics Institute of Human Computer Media





Contents

The module Medieninformatik 2 (Computer Science for Media 2) provides deeper knowledge of digital media ty-pes and the fundamentals of digital media development and design.


Students have gained a deeper insight into selected concepts of media computer science. In addition, they areable to develop digital media based on various processes. Thus, a basis is provided for academic work as wellas for acquiring practically relevant media skills.





a) written examination (approx. 60 minutes) or b) written examination (approx. 40 minutes) with exercises (40hours), weighted 5:1 or c) oral examination of one candidate each (approx. 30 minutes) or d) presentation (15 to30 minutes) with written elaboration (10 to 15 pages) or e) term paper (15 to 20 pages) or f) portfolio (maximum20 pages)Language of assessment: German, English


Digital Humanities Master's (120 ECTS): maximum 10 places. Places will be allocated according to the numberof subject semesters. Among applicants with the same number of subject semesters, places will be allocated bylot.


--


--


page 57 / 69


LA Gymnasien

Teaching(10 ECTS credits)


page 58 / 69


LA Gymnasien


Didactics of Informatics 1 10-I-DDI1-092-m01







Contents

The module gives an overview of computer science didactics. It demonstrates and discusses possibilities for apractical application in the classroom.


Students are familiar (in particular in the area of computer science in Sekundarstufe I) with methods, techniquesand media for teaching topics in computer science. They are able to didactically analyse and prepare practicaltopics. Students are familiar with both historical and current teaching approaches, typical teaching methods aswell as guidelines and standards for teaching computer science. They are able to plan, organise and deliver clas-ses.







--


--


§ 69 (1) 2. Informatik Didaktik


page 59 / 69


LA Gymnasien


Didactics of Informatics 2 10-I-DDI2-092-m01







Contents

This course discusses different topics in computer science didactics in more detail. It demonstrates and discus-ses possibilities for a practical application in the classroom.


The students are able to plan, execute and assess projects, are familiar with important aspects of the planningand analysis of computer science classes, master fundamental teaching and learning strategies and are able toassess these.







--


--




page 60 / 69


LA Gymnasien


Practical Course in the Application of Informatics Systems from a DidacticalPoint of View

10-I-DPAI-092-m01







Contents

Using the example of computer science systems, the module teaches students practical skills for use in schoolsand, more specifically, in computer science classes. The module demonstrates and discusses possibilities for apractical application in the classroom.


The students possess practical skills in working with selected computer science systems and are able to applythese skills in the classroom.







--


--




page 61 / 69


LA Gymnasien

Freier Bereich (general as well as subject-specific electives)(0-15 ECTS credits)

Teaching degree students must take modules worth a total of 15 ECTS credits in the area Freier Bereich(general as well as subject-specific electives) (Section 9 LASPO (general academic and examination re-gulations for teaching-degree programmes)). To achieve the required number of ECTS credits, studentsmay take any modules from the areas below.Freier Bereich -- interdisciplinary: The interdisciplinary additional offer for a teaching degree can befound in the respective Annex "Ergänzende Bestimmungen für den "Freien Bereich" im Rahmen desStudiums für ein Lehramt".


page 62 / 69


LA Gymnasien

Computer Science( ECTS credits)

(Freier Bereich (general as well as subject-specific electives) -- subject specific)


page 63 / 69


LA Gymnasien


Seminar Didactics of Informatics 10-I-DS-092-m01







Contents

Selected topics in computer science didactics.


The students gain initial experience in the area of independent scientific work. They are able to acquaint them-selves with and structure a given topic, using selected literature, as well as to prepare a talk on the respectivesubject. They are also able to actively participate in a scientific discussion.





written elaboration (approx. 20 to 25 pages) and oral presentation (approx. 60 minutes) with subsequent discus-sion (approx. 15 minutes) on a topic from the field of computer science didacticsAssessment offered: usually only in the semester in which the course is offered


--


--


--


page 64 / 69


LA Gymnasien


Advanced Topics of Didactic of Informatics 10-I-DV-092-m01







Contents

Discussion of topics in teaching computer science in Gymnasium that takes into account different aspects, inparticular subject-specific foundations, didactic analyses, the contemporary debate in computer science didac-tics as well as possible approaches in the classroom.


The students are able to discuss central topics and issues on teaching computer science in a Gymnasium, takinginto account subject-specific, didactic and methodical aspects.





written elaboration (approx. 20 to 25 pages) and oral presentation (approx. 60 minutes) with subsequent discus-sion (approx. 15 minutes) on a topic from the field of computer science didacticsAssessment offered: usually only in the semester in which the course is offered


--


--


--


page 65 / 69


LA Gymnasien


Practical Course in Didactics of Informatics 10-I-DP-092-m01







Contents

This course covers practical topics in teaching computer science such as "functional programming in theclassroom" or "robotics in the classroom". In particular, the course discusses subject-specific foundations, di-dactic analyses, the contemporary debate in computer science didactics as well as possible approaches in theclassroom.


The students possess practical skills in working with the selected computer science systems discussed in thecourse and are able to use these in the classroom, taking into account subject didactic as well as methodicalaspects.





completion of project assignments, presentation (type and expenditure of time to be specified by the lecturer atthe beginning of the course)Assessment offered: usually only in the semester in which the course is offered


--


--


--


page 66 / 69


LA Gymnasien


Advanced Practical Course in Didactics of Informatics 10-I-DPP-092-m01







Contents

Design and implementation of a school project on a topic in computer science, e. g. for project days, school termpapers (Facharbeiten), Pluskurse (additional courses for the in-depth study of areas of special interest), work-shops. In the theoretical phase, the students formulate the subject-specific and didactic requirements of thetopic, search for a suitable topic, elaborate this topic for the project and draw up a project plan. This is donein groups with students providing each other with advice as well as challenging and reflecting on each other'swork. In the practical phase, the students prepare the implementation of the project, implement the project withpupils and afterwards reflect the planning and implementation.


The students are able to select a topic from the area of computer science that is suitable for a school project andare able to elaborate it. They are familiar with different aspects of project planning and management and are ab-le to critically reflect the process.


P + S (no information on SWS (weekly contact hours) and course language available)



project and implementation thereof: drawing up a project plan (approx. 10 pages) and practical implementationwith pupilsAssessment offered: usually only in the semester in which the course is offered


--


--


--


page 67 / 69


LA Gymnasien

Thesis(10 ECTS credits)

Preparation of a written Hausarbeit (thesis) in accordance with the provisions of Section 29 LPO I (ex-amination regulations for teaching-degree programmes) is a prerequisite for teaching degree studentsto be admitted to the Erste Staatsprüfung (First State Examination). In accordance with the provisionsof Section 29 LPO I, students studying for a teaching degree Gymnasium may write this thesis in one ofthe subjects they selected as vertieft studiertes Fach (subject studied with a focus on the scientific dis-cipline) or in the subject Erziehungswissenschaften (Educational Science). Pursuant to Section 29 Sub-section 1 Sentence 2 LPO I, students may also choose to write an interdisciplinary thesis.


page 68 / 69


LA Gymnasien


Thesis Informatics (Gymnasium) 10-I-HA-GY-092-m01




10 numerical grade Where applicable, specific modules/module components as specified bysupervisor.



Contents

Largely independently researching and writing on a scientific topic in computer science or computer science di-dactics.


The students are able to largely independently research and write on a scientific topic in computer science orcomputer science didactics, using known methods.


no courses assigned



written thesis (approx. 250 to 300 hours total)Language of assessment: German, English if agreed upon with the examiner


--


Additional information on module duration: 1 to 2 semesters.


--


page 69 / 69

Documents

Module Catalogue - uni-wuerzburg.de · Advanced Topics of Didactic of Informatics 65 Practical Course in Didactics of Informatics 66 Advanced Practical Course in Didactics of Informatics