Suchergebnis: Katalogdaten im Herbstsemester 2019

Rechnergestützte Wissenschaften Bachelor Information
Bachelor-Studium (Studienreglement 2012 und 2016)
Grundlagenfächer
Block G2 (Studienreglement 2012 und 2016)
252-0834-00L Information Systems for Engineers wird neu im Frühjahrssemester angeboten.
NummerTitelTypECTSUmfangDozierende
401-0603-00LStochastik Information Belegung eingeschränkt - Details anzeigen O4 KP2V + 1UC. Czichowsky
KurzbeschreibungDie Vorlesung deckt folgende Themenbereiche ab: Zufallsvariablen, Wahrscheinlichkeit und Wahrscheinlichkeitsverteilungen, gemeinsame und bedingte Wahrscheinlichkeiten und Verteilungen, das Gesetz der Grossen Zahlen, der zentrale Grenzwertsatz, deskriptive Statistik, schliessende Statistik, Statistik bei normalverteilten Daten, Punktschätzungen, und Vergleich zweier Stichproben.
LernzielKenntnis der Grundlagen der Wahrscheinlichkeitstheorie und Statistik.
InhaltEinführung in die Wahrscheinlichkeitstheorie, einige Grundbegriffe der mathematischen Statistik und Methoden der angewandten Statistik.
SkriptVorlesungsskript
LiteraturVorlesungsskript
252-0834-00LInformation Systems for Engineers Information
Findet dieses Semester nicht statt.
O4 KP2V + 1UNoch nicht bekannt
KurzbeschreibungThis course provides the basics of relational databases from the perspective of the user.

We will discover why tables are so incredibly powerful to express relations, learn the SQL query language, and how to make the most of it. The course also covers support for data cubes (analytics).

After this course, you will be ready for Big Data for Engineers.
LernzielAfter visiting this course, you will be capable to:

1. Explain, in the big picture, how a relational database works and what it can do in your own words.

2. Explain the relational data model (tables, rows, attributes, primary keys, foreign keys), formally and informally, including the relational algebra operators (select, project, rename, all kinds of joins, division, cartesian product, union, intersection, etc).

3. Perform non-trivial reading SQL queries on existing relational databases, as well as insert new data, update and delete existing data.

4. Design new schemas to store data in accordance to the real world's constraints, such as relationship cardinality

5. Explain what bad design is and why it matters.

6. Adapt and improve an existing schema to make it more robust against anomalies, thanks to a very good theoretical knowledge of what is called "normal forms".

7. Understand how indices work (hash indices, B-trees), how they are implemented, and how to use them to make queries faster.

8. Access an existing relational database from a host language such as Java, using bridges such as JDBC.

9. Explain what data independence is all about and didn't age a bit since the 1970s.

10. Explain, in the big picture, how a relational database is physically implemented.

11. Know and deal with the natural syntax for relational data, CSV.

12. Explain the data cube model including slicing and dicing.

13. Store data cubes in a relational database.

14. Map cube queries to SQL.

15. Slice and dice cubes in a UI.

And of course, you will think that tables are the most wonderful object in the world.
InhaltUsing a relational database
=================
1. Introduction
2. The relational model
3. Data definition with SQL
4. The relational algebra
5. Queries with SQL

Taking a relational database to the next level
=================
6. Database design theory
7. Databases and host languages
8. Databases and host languages
9. Indices and optimization
10. Database architecture and storage

Analytics on top of a relational database
=================
12. Data cubes

Outlook
=================
13. Outlook
Literatur- Lecture material (slides).

- Book: "Database Systems: The Complete Book", H. Garcia-Molina, J.D. Ullman, J. Widom
(It is not required to buy the book, as the library has it)
Voraussetzungen / BesonderesFor non-CS/DS students only, BSc and MSc
Elementary knowledge of set theory and logics
Knowledge as well as basic experience with a programming language such as Pascal, C, C++, Java, Haskell, Python
401-0647-00LIntroduction to Mathematical Optimization Information O5 KP2V + 1UD. Adjiashvili
KurzbeschreibungIntroduction to basic techniques and problems in mathematical optimization, and their applications to a variety of problems in engineering.
LernzielThe goal of the course is to obtain a good understanding of some of the most fundamental mathematical optimization techniques used to solve linear programs and basic combinatorial optimization problems. The students will also practice applying the learned models to problems in engineering.
InhaltTopics covered in this course include:
- Linear programming (simplex method, duality theory, shadow prices, ...).
- Basic combinatorial optimization problems (spanning trees, shortest paths, network flows, ...).
- Modelling with mathematical optimization: applications of mathematical programming in engineering.
LiteraturInformation about relevant literature will be given in the lecture.
Voraussetzungen / BesonderesThis course is meant for students who did not already attend the course "Mathematical Optimization", which is a more advance lecture covering similar topics. Compared to "Mathematical Optimization", this course has a stronger focus on modeling and applications.
  •  Seite  1  von  1