CloseHelpPrint
Kies de Nederlandse taal
Course module: INFOMCTH
INFOMCTH
Computational thinking
Course infoSchedule
Course codeINFOMCTH
ECTS Credits7.5
Category / LevelM (Master)
Course typeCourse
Language of instructionEnglish
Offered byFaculty of Science; Graduate School of Natural Sciences;
Contact persondrs. J.D. Fokker
Telephone+31 30 2534118
E-mailJ.D.Fokker@uu.nl
Lecturers
Lecturer
dr. H.L. Bodlaender
Feedback and availability
Other courses by this lecturer
Teaching period
3-GSNS  (05/02/2018 to 20/04/2018)
Teaching period in which the course begins
3-GSNS
Time slotB: TUE-morning, THU-afternoon
Study mode
Full-time
Enrolment periodfrom 30/10/2017 up to and including 26/11/2017
Course application processOsiris
Enrolling through OSIRISYes
Enrolment open to students taking subsidiary coursesYes
Pre-enrolmentNo
Post-registrationYes
Post-registration openfrom 22/01/2018 up to and including 18/02/2018
Waiting listYes
Course placement processadministratie onderwijsinstituut
Course goals
After completing this course, the student will have...
  • Knowledge of important network algorithms
  • Knowledge of important algorithmic techniques and concepts
  • Ability to model problems from applications as an (algorithmic) network problem
  • Ability to apply algorithmic techniques, to solve algorithmic network problems
  • Ability to prove correctness of a network algorithm
  • Ability to formulate graph and network algorithms
  • Ability to analyse the running time of network algorithms
Content
In this course a number of advanced techniques for efficient algorithm design are studied, often at the hand of problems from networks and graphs. In many applications, networks and graphs are used as a model. Typical examples are networks of roads, or electronic networks. In other applications, the graph model may be less obvious, but appears to be very useful, like for scheduling problems. In this course, the translation of problem to network model is treated, and algorithmic problems and their solutions on networks and graphs are looked into. Some topics are: shortest paths, flow, matchings, triangulated graphs, treewidth, graph isomorphism, graph drawing, exact algorithms for fundamental graph problems, small world networks, facility location.
Entry requirements
You must have a valid study entrance permit
Required materials
-
Recommended materials
Handouts
Most literature will be handed out during the course.
Instructional formats (attendance required)
Lecture (Required)

Tests
Final result
Test weight100
Minimum grade-

CloseHelpPrint
Kies de Nederlandse taal