Welcome to Master Program Computing Science Study advisors: Ad Feelders and Wishnu Prasetya Room {BBL-563,BBL-566} September 3, 2012

Computing Science Staff Hans Bodlaender Program Leader Wishnu Prasetya Study Advisor Programming Technology Ad Feelders Study Advisor

Research Groups Involved in Computing Science Dr Hans Bodlaender: Algorithmic Systems Dr Hans Bodlaender: 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 Hans BodlaenderLinda 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 Generic Programming (1C) Generic Programming (1C) Advanced Functional Programming (2B) Advanced Functional Programming (2B) Program Verification (3C4-7) Program Verification (3C4-7) Compiler Construction (3A) Compiler Construction (3A) Automatic Program Analysis (4B) Automatic Program Analysis (4B) Between brackets: time period and timeslot.

Study Line: Algorithm Design and Complexity Algorithms and Networks (1A) Algorithms and Networks (1A) Simulation (3C) Simulation (3C) Geometric Algorithms (3B) Geometric Algorithms (3B) Scheduling and Timetabling (4D) Scheduling and Timetabling (4D) Computational Sustainability (4C) Computational Sustainability (4C)

Study Line: Algorithmic Data Analysis Multimedia Retrieval (1C) Multimedia Retrieval (1C) Data Mining (1B) Data Mining (1B) Queries and Retrieval (2A) Queries and Retrieval (2A) Pattern Recognition (2C) Pattern Recognition (2C) Experimentation Project ADA (Any Period) Experimentation Project ADA (Any Period)

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

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. Attend at least 30 colloquia, give a talk. 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).

Examples of non-CS courses Parallel Algorithms (Mathematics) Parallel Algorithms (Mathematics) Continuous optimization Continuous optimization See for more information about mathematics courses. See for more information about mathematics courses. Computational biology (dept. of Biology) (2) Computational biology (dept. of Biology) (2) Models of Computation (CAI) (4) Models of Computation (CAI) (4) Learning in Computational Linguistics (CAI) (4) Learning in Computational Linguistics (CAI) (4)

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. Can also be performed at a company. Can also be performed at a company.

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. Prediction of stock price movements from tweets (external). Prediction of stock price movements from tweets (external). 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: This year: –Social Simulation (1C) –Dependently Typed Programming (4C)

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.

Advanced Functional Progr. (S) Queries and Retrieval (E) Example Program Functioneel Programmeren (D) Probabilistic Reasoning (E) Program Verification (S) Compiler Construction (S) Automatic Program Analysis (S) Seminar DTP (E) Experimentation Project (E) Generic Programming (S) Master Thesis First YearSecond Year Study Line: Programming Technology D = Deficiency E = Elective S = Study Line

Example Algorithms and Networks (S) Probabilistic Reasoning (S) Evolutionary Computing (S) Pattern Recognition (E) Geometric Algorithms (S) Simulation (S) Scheduling and Timetabling (S) Computational Sustainability (S) Data Mining (E) Experimentation Project (E) Master Thesis First YearSecond Year Study Lines: Algorithm Design and Complexity and Advanced Planning and Decision Making

Study plan Your study plan must be approved by Wishnu Prasetya for the study line PT or Ad Feelders for the other study lines. Your study plan must be approved by Wishnu Prasetya for the study line PT or Ad Feelders for the other study lines. Template for study plan can be found at: Template for study plan can be found at: Fill in the template and mail to Wishnu or Ad. Make an appointment if you need advice. Fill in the template and mail to Wishnu or Ad. Make an appointment if you need advice. Practical Information on Master CS: 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”. 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. On you can find information about courses, times, rooms, etc. To register for courses, go to To register for courses, go to Tomorrow you can register at the student desk in BBL 184 B. Tomorrow you can register at the student desk in BBL 184 B.

Student Desk BBL 184 Minnaert Building Student Desk First floor BBL

Questions?