• Keine Ergebnisse gefunden

Studienverlaufsplan M.Sc. Data Science (ab Wintersemester 2019/20) (englisch)

N/A
N/A
Protected

Academic year: 2022

Aktie "Studienverlaufsplan M.Sc. Data Science (ab Wintersemester 2019/20) (englisch)"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

1st semester 2nd semester 3rd semester 4th semester

Module MD 5:

Big Data

Big Data Analytics (4+2); 9 ECTS;

Graded module exam

Module MD 4:

Project Work Case Studies (4P) or External Internship; 8 ECTS;

Graded partial work

Seminar(2S); 4 ECTS;

Graded partial work

Module MD 6:

Master Thesis

Prerequisites: Modules MD 1 and MD 4

30 ECTS;

Course achievement: Advanced Seminar („Oberseminar“);

Graded module exam: Master Thesis Module MD 2:

Statistical Theory

Statistical Theory (4+2); 9 ECTS;

Graded module exam

Module MD 1:

Advanced Statistical Learning Advanced Statistical Learning (4+2); 9 ECTS;

Graded module exam

Graded module exams or accumulated graded exams

(at least 24 ECTS in total)

(In the entire elective area – Methods and Applications – modules with a total of 45 ECTS are to be chosen.)

Elective courses:

Methods

Elective modules from catalogue Module MD 3:

Data Science in Practice

Programming course (2 to 4 P); 3 ECTS;

Data Science in Context (2); 3 ECTS;

Accumulated graded exams

Elective courses:

Applications

Elective modules from catalogue

Graded module exams or accumulated graded exams

(at least 16 ECTS in total)

Total: 30 ECTS Total: 30 ECTS Total: 30 ECTS Total: 30 ECTS

blue:courses at the Faculty of Statistics Denoted hours:

green: courses at the Faculty of Computer Science S: Seminar brown:(joint) courses at this or other faculties P: Practical course

else: Lecture + Tutorial or Lecture only

Data Science Master Program

Regulations of 2020

Recommended Course of Study

when starting in winter semester

(2)

1st semester 2nd semester 3rd semester 4th semester

Module MD 1:

Advanced Statistical Learning Advanced Statistical Learning (4+2); 9 ECTS;

Graded module exam

Module MD 4:

Project Work Seminar(2S);4 ECTS;

Case Studies (4P) or External Internship;8 ECTS;

Accumulated graded exams

Module MD 6:

Master Thesis

Prerequisites: Modules MD 1 and MD 4

30 ECTS;

Course achievement: Advanced Seminar („Oberseminar“);

Graded module exam: Master Thesis Elective courses:

Methods

Elective modules from catalogue

Module MD 5:

Big Data

Big Data Analytics (4+2); 9 ECTS;

Graded module exam

Graded module exams or accumulated graded exams

(at least 24 ECTS in total)

(In the entire elective area – Methods and Applications – modules with a total of 45 ECTS are to be chosen.)

Module MD 2:

Statistical Theory

Statistical Theory (4+2);9 ECTS;

Graded module exam

Module MD 3:

Data Science in Practice

Programming course (2 to 4 P); 3 ECTS;

Accumulated graded exams

Elective courses:

Applications Elective modules from catalogue

Graded module exams or accumulated graded exams

(at least 16 ECTS in total) Data Science in Context (2);3 ECTS;

Total: 30 ECTS Total: 30 ECTS Total: 30 ECTS Total: 30 ECTS

Data Science Master Program

Regulations of 2020

Recommended Course of Study

when starting in summer semester

blue:courses at the Faculty of Statistics Denoted hours:

green: courses at the Faculty of Computer Science S: Seminar brown:(joint) courses at this or other faculties P: Practical course

else: Lecture + Tutorial or Lecture only

Referenzen

ÄHNLICHE DOKUMENTE

At first, we decided to divide the experimental arena into 4 blocks and apply classification algorithms to predict in which particular block the rat was in a given time based on

The scaling mechanisms of Mesosphere, regarding scaling up the number of instances of applications and scaling up the available resources of an application, within the meaning

Especially in applied computer science, which is supposed to support human activities by designing technical artifacts, the integration of the perspectives of diverse users is

How to use Chan’s randomized technique and the decision algorithm for the geometric dilation of a polygonal chain to develop an optimization algorithm?. Abstract

How to use Chan’s randomized technique and the decision algorithm for the geometric dilation of a polygonal chain to develop an optimization algorithm3. Abstract

Present the idea of how the crossing number Theorem is used for the upper bound on I(m,n) in the Szemeredi-Trotter Theorem?. Well-separated

As a contribution of this thesis, the SmartPM engine and the designer application were updated and a web server part and an Android task list handler with Arduino sensors were

Investigations were short term and applied in their approach, orientated towards the solution of specific queries, in contrast to some (but not all) of the more free- ranging