logo of the SSW institute ;)
Computer Science
System Software

Home

General
Staff
Contact
Partners
Alumni

Research
Areas
Projects
Papers
Books
Reports
Awards

Teaching
Lectures
Exams
B.Projects
M.Theses
PhD Theses
Go Abroad

Misc
Talks
Library
Gallery
Links
Search

Webmaster


Special Topics:

Algorithmic Discrete Mathematics

339.353 1KV Laszlo Block Beginn: 21.03.2017

The goal of this course is to introduce students to some ideas and techniques from discrete mathematics that are widely used in Computer Science. The course aims to present these ideas "in action"; they will be geared towards specific significant applications. Thus, students will see the purpose of the techniques at the same time as learning about them.

Lecturer

Dr. Laszló Szábó
Eötvös Lorand University Budapest
szabolaszlo@inf.elte.hu

Dates

Date Time Room
Tu 21.03.2017 15:30 - 18:00 S3 048
We 22.03.2017 15:30 - 18:00 K 223B
Th 23.03.2017 15:30 - 18:00 K 223B

Contents

  1. Invariant principle
    - The 15-puzzle
    - Die Hard
  2. Combinatorial games
    - Unstacking
    - Nim
    - Chomp
  3. Stable marriage
    - Gale-Shapley algorithm
    - Optimality

Handouts

The handouts including the project descriptionss can be downloaded from here.

Exam

Students will have to do a project and have to send it to the lecturer not later than May 15, 2017. The marks of this course will be based on the project.