Welcome to Master Program Computing Science Study advisor: Wishnu Prasetya Room BBG-566 September 2, 2013

Computing Science Staff Hans Bodlaender Program Leader Wishnu Prasetya Study Advisor

Research Groups Involved in Computing Science Dr Hans Bodlaender: Algorithmic Systems Prof D. Swierstra: Software Technology Prof L. van der Gaag: Decision Support Systems Prof A. Siebes: Algorithmic Data Analysis Hans BodlaenderLinda van der GaagArno SiebesDoaitse Swierstra

Overview 2 Courses Master Thesis First YearSecond Year Courses: courses/projects/seminars computing science colloquium

Study Lines / Tracks Programming TechnologyAlgorithm Design and AnalysisAlgorithmic Data AnalysisAdvanced Planning and Decision Making A Study Line is a coherent set of courses providing knowledge and skills for specific areas of Computing Science.

Study Line: Programming Technology Advanced Functional Programming (1A)Compiler Construction (2B)Theory of Programming and Types (3A)Program Verification (3D)Automatic Program Analysis (4B) Between brackets: time period and timeslot

Study Line: Algorithm Design and Analysis Algorithms and Networks (2B)Simulation (3C)Geometric Algorithms (3B)Scheduling and Timetabling (4D)

Study Line: Algorithmic Data Analysis Multimedia Retrieval (1C)Data Mining (1B)Queries and Retrieval (2A)Pattern Recognition (2C)Pattern Set Mining (4C)

Study Line: Advanced Planning and Decision Making Probabilistic Reasoning (1D)Algorithms and Networks (2B)Evolutionary Computing (2C)Simulation (3C)Scheduling and Timetabling (4D)

Colloquium Computing Science Mandatory. Research talks by staff members, guests, and students. Attend at least 30 colloquia, and give a talk. Counts for 5 ECTS.

Electives Experimentation Project (max. 15 ECTS) Courses and seminars from the Computing Science master program. Courses from other Computer Science master programs (AI, GMT). Maximum of two relevant courses (15 ECTS) from other (non-CS) master programs. Independent study under supervision of a staff member (Capita Selecta).

Examples of non-CS courses Parallel Algorithms (Mathematics) Continuous optimization See for more information about mathematics courses. Computational biology (dept. of Biology) (2) Models of Computation (CAI) (4) Learning in Computational Linguistics (CAI) (4) ICT Enterpreneurship (1, to take in your 2 nd year)

Experimentation Project Application of theory studied in one or more of the Computing Science courses. Typically involves the implementation of algorithms and the analysis of their performance through experiments. Performed under supervision of a CS staff member. Can also be performed at a company  avoid a “build feature-X” project!

Examples: Exact algorithms for the maximum independent set problem. Learning distance functions for k nearest neighbour classifiers. Prediction of stock price movements from tweets (external). Implementing a high performance parser for language-X Implementing verification algorithms for (Java) bytecode

Seminar We offer one or more research oriented seminar courses for Computing Science students. This year: – None!

Deficiency Courses Two courses maximum. Depend on selection of study line. Examples: -Functional Programming is required for Advanced Functional Programming, Generic Programming, Compiler Construction, Program Verification.  ok if you did the Summer School FP -Languages and Compilers is needed for Compiler Construction and Automatic Program Analysis. -Algorithmics is required for Algorithms and Networks. Since these are Bachelor courses, they are taught in Dutch, but study material is in English.

Overview of Requirements Select one (or more) study lines. You can also propose your own study line. Electives. Deficiency Courses (Max 2). Colloquium (Mandatory, 5 ECTS). 40 ECTS Master Thesis Project.

Compiler Construction (S) Queries and Retrieval (E) Example Program Advanced Functional Progr. (S) Data Mining (E) Program Verification (S) Theory of Progr. And Types (S) Automatic Program Analysis (S) Pattern Set Mining(E) Experimentation Project (E) + Multimedia Retrieval (E) or ICT Enterpreneurship (E) Master Thesis First YearSecond Year Study Line: Programming Technology D = Deficiency E = Elective S = Study Line computing science colloquium

Example Data Mining (E) Probabilistic Reasoning (S) Evolutionary Computing (S) Algorithms and Networks (S) Geometric Algorithms (S) Simulation (S) Scheduling and Timetabling (S) Logic and Computation (E) Master Thesis First YearSecond Year Study Lines: Algorithm Design and Analysis and Advanced Planning and Decision Making Experimentation Project 15 EC computing science colloquium

Study plan Your study plan must be approved by Wishnu Prasetya. Template for study plan can be found at: Fill in the template and mail to Wishnu. Make an appointment if you need advice. Practical Information on Master CS: General Information on Master CS (study lines, etc.): go to the education page and click on COSC in the “blue bar”.

Other Practical Stuff On you can find information about courses, times, rooms, etc. To register for courses, go to Tomorrow you can register at the student desk in BBL 184 B ?

Questions?

Compiler Construction (S) Logic & Language (E) Example Program Advanced Functional Progr. (S) Probabilistic Reasoning (E) Program Verification (S) Theory of Progr. And Types (S) Automatic Program Analysis (S) Logic & Computation (E) Experimentation Project (E) Parallel Algorithms (E) Master Thesis First YearSecond Year Study Line: Programming Technology D = Deficiency E = Elective S = Study Line computing science colloquium