Modules

12 results

Elective Modules Informatics: Games Engineering12

Elective Modules Informatics12

Algorithms12

Advanced AlgorithmsNo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou will learn fundamental techniques for the development and analysis of efficient algorithms (e.g., Divide-and-Conquer, dynamic programming, randomization, Greedy methods, amortized analysis) and apply them to central problems such as sorting, graph problems, string and sequence algorithms, as well as data structures. In the end you will be able to understand, analyze, and use classical algorithmic procedures to solve fundamental tasks.8 ECTSruns this semesterCIT323004Advanced Network and Graph AlgorithmsNo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou deepen knowledge of graph and network algorithms: the focus is on centrality measures, density measurement algorithms in (sub)graphs, connectivity problems, and the assignment problem (Hungarian method). At the end you can analyze complex network problems, assess their complexity, and develop or apply suitable efficient algorithms.8 ECTSno date this semesterIN2158Complexity TheoryNo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou learn formal computational models (in particular Turing machines and circuits) as well as the most important complexity classes (e.g. L, NL, P, NP, PSPACE, EXP, NEXP, PH). By the end you will be able to analyze problems with respect to time and space complexity, apply reductions and completeness proofs, and classify advanced concepts such as alternation, randomized methods, and interactive proof systems.8 ECTSno date this semesterIN2007Efficient Algorithms and Data StructuresNo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou will learn the fundamentals of analyzing algorithms as well as central data structures and fundamental algorithmic problems. The focus is on runtime and space analysis, various search trees, hashing methods, priority queues, union-find structures, as well as maxflow/mincut and matching algorithms. In the end you will be able to analyze algorithms, assess the efficiency of data structures, and design new solutions for problems.8 ECTSruns this semesterIN2003Efficient Algorithms and Data Structures IINo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou will learn advanced algorithmic methods focusing on linear optimization and techniques for solving combinatorial problems. In the end you will be able to formulate linear models, apply classical solution methods such as the Simplex method and advanced methods like Ellipsoid and Karmarkar methods, and use approximation and rounding approaches for NP-complete problems.8 ECTSno date this semesterIN2004
7 more in AlgorithmsElective 1 AlgorithmsNo ratings for this module yet.Elective Modules Informatics › Algorithmsno date this semesterIN99540Elective 2 AlgorithmsNo ratings for this module yet.Elective Modules Informatics › Algorithmsno date this semesterIN99541Online and Approximation AlgorithmsNo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou will learn fundamentals and advanced techniques of online and approximation algorithms. In the end you will know classical online problems (e.g., scheduling, paging, k-server), analysis tools such as amortized analysis and randomized algorithms, as well as design techniques for approximation algorithms including LP-relaxation and randomized rounding.8 ECTSno date this semesterIN2304Parallel AlgorithmsNo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou deal with models of parallel computation and develop fundamental parallel algorithms. In the end you know various machine models, master basic knowledge of parallel complexity theory, and can design and evaluate parallel algorithms.8 ECTSno date this semesterIN2011Randomized AlgorithmsNo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou learn fundamentals and techniques of randomized algorithms and how to estimate their running time and correctness with probabilistic methods. In the end you will be able to understand and analyze classical randomized algorithms (e.g., randomized Quicksort, Min-Cut, Treaps) and apply tools such as Markov, Chebyshev and Chernoff inequalities.8 ECTSno date this semesterIN2160Selected Topics in AlgorithmsNo ratings for this module yet.Elective Modules Informatics › Algorithms5 ECTSno date this semesterIN3410Topics in Computational Social ChoiceNo ratings for this module yet.Elective Modules Informatics › AlgorithmsYou study models and methods of collective decision making from social choice theory, in particular those that find application in computer science. Key topics are probabilistic social choice, fair division, and the allocation of public goods; the contents are treated mathematically precisely and with a focus on proofs. In the end you will be able to apply such models, axiomatically analyze properties of aggregation procedures, and work on relevant algorithms and complexity questions.5 ECTSno date this semesterCIT423011
1 more module matches, but it is taught in German. Show itOperations ResearchNo ratings for this module yet.Elective Modules Informatics › AlgorithmsDu lernst Methoden der Entscheidungsanalyse sowie Techniken der linearen und ganzzahligen Optimierung kennen. Du kannst betriebliche Planungs- und Entscheidungsprobleme (z. B. Transport- oder Netzflussprobleme) modellieren und die grundlegenden Algorithmen zu deren Lösung verstehen und anwenden.6 ECTSno date this semesterIN0024