Welcome to Master Program Computing Science Study advisors: Ad Feelders and Wishnu Prasetya Room {BBL-563,BBL-566} February 4, 2011

Study Advisors Wishnu Prasetya Wishnu Prasetya Ad Feelders Ad Feelders

Research Groups Involved in Computing Science Prof J. van Leeuwen: Algorithmic Systems Prof J. van Leeuwen: Algorithmic Systems Prof D. Swierstra: Software Technology Prof D. Swierstra: Software Technology Prof L. van der Gaag: Decision Support Systems Prof L. van der Gaag: Decision Support Systems Prof A. Siebes: Algorithmic Data Analysis Prof A. Siebes: Algorithmic Data Analysis Jan van Leeuwen (program leader) Linda van der GaagArno SiebesDoaitse Swierstra

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

Study Lines Programming Technology Programming Technology Algorithm Design and Complexity Algorithm Design and Complexity Algorithmic Data Analysis Algorithmic Data Analysis Advanced Planning and Decision Making Advanced 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 Compiler Construction (3, 2010) Compiler Construction (3, 2010) Automatic Program Analysis (4, 2010) Automatic Program Analysis (4, 2010) Generic Programming (1,2011) Generic Programming (1,2011) Advanced Functional Programming (2,2011) Advanced Functional Programming (2,2011) Program Verification (3,2011) Program Verification (3,2011) Between brackets: time period and academic year of first opportunity to do a course.

Study Line: Algorithm Design and Complexity Algorithms and Networks (3,2010) Algorithms and Networks (3,2010) Simulation (3,2010) Simulation (3,2010) Algorithms, Games and the Internet (4,2010) Algorithms, Games and the Internet (4,2010) Scheduling and Timetabling (4,2010) Scheduling and Timetabling (4,2010) Intelligent Agents (1,2011) Intelligent Agents (1,2011)

Study Line: Algorithmic Data Analysis Geographic Data Processing (4,2010) Geographic Data Processing (4,2010) Advanced Data Mining (1, 2011) Advanced Data Mining (1, 2011) Multimedia Retrieval (1, 2011) Multimedia Retrieval (1, 2011) Pattern Recognition (2, 2011) Pattern Recognition (2, 2011) Queries and Retrieval (2, 2011) Queries and Retrieval (2, 2011)

Study Line: Advanced Planning and Decision Making Algorithms and Networks (3, 2010) Algorithms and Networks (3, 2010) Simulation (3, 2010) Simulation (3, 2010) Scheduling and Timetabling (4, 2010) Scheduling and Timetabling (4, 2010) Probabilistic Reasoning (1, 2011) Probabilistic Reasoning (1, 2011) Evolutionary Computing (2, 2011) Evolutionary Computing (2, 2011)

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

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

Experimentation Project Application of theory studied in one or more of the Computing Science courses. 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. Typically involves the implementation of algorithms and the analysis of their performance through experiments. Performed under supervision of a CS staff member. Performed under supervision of a CS staff member.

Examples: Exact algorithms for the maximum independent set problem. Exact algorithms for the maximum independent set problem. Learning distance functions for k nearest neighbour classifiers. Learning distance functions for k nearest neighbour classifiers. Implementing a PHP parser in Haskell. Implementing a PHP parser in Haskell. Implementing a Java Bytecode utility. Implementing a Java Bytecode utility.

Seminar We offer one or more research oriented seminar courses for Computing Science students. We offer one or more research oriented seminar courses for Computing Science students. This year and next: This year and next: –Algorithms, Games and the Internet (4, 2010) –Functional Architectures (3, 2011) –PL Implementation / Type Checking (4, 2011)

Deficiency Courses Two courses maximum. Two courses maximum. Depend on selection of study line. Depend on selection of study line. Examples: Examples: -Functional Programming is required for Advanced Functional Programming, Generic Programming, Compiler Construction, Program Verification. -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. Select one or more study lines. You can also propose your own study line. You can also propose your own study line. Electives Electives Deficiency Courses (Max 2) Deficiency Courses (Max 2) Colloquium (Mandatory, 5 ECTS) Colloquium (Mandatory, 5 ECTS) 40 ECTS Master Thesis Project 40 ECTS Master Thesis Project –Academic –Industrial

Study plan Your study plan must be approved by a study-advisor (Ad Feelders or Wishnu Prasetya). Your study plan must be approved by a study-advisor (Ad Feelders or Wishnu Prasetya). Template for study plan: Template for study plan: General information on Master CS: General information on Master CS:

History Computing Science originated from the fusion of Software Technology and Applied Computing Science. Computing Science originated from the fusion of Software Technology and Applied Computing Science. On the “old” master programs are still listed. On the “old” master programs are still listed. Any course in the column ST or ACS can be regarded as a Computing Science course. Any course in the column ST or ACS can be regarded as a Computing Science course.

Example Compiler Construction (A) Algorithms and Networks (C) Automatic Program Analysis (D) Algorithms, Games & the Internet (A) Generic Programming Advanced Data Mining Advanced Functional Programming Experimentation Project Functional Architectures SEM Program Verification Master Thesis First YearSecond Year Study Line: Programming Technology Letters between brackets are timeslots

Example Simulation (B) Algorithms and Networks (C) Scheduling and Timetabling (D) Algorithms, Games & the Internet (A) Intelligent Agents Probabilistic Reasoning Evolutionary Computing Queries and Retrieval Experimentation Project Capita Selecta Master Thesis First YearSecond Year Study Lines: Algorithm Design and Complexity and Advanced Planning and Decision Making

Questions?