Algorithms and Data Structures
Course infoSchedule
Course moduleNWI-IBC027
Credits (ECTS)6
CategoryBA (Bachelor)
Language of instructionEnglish
Offered byRadboud University; Faculty of Science; Informatica en Informatiekunde;
PreviousNext 1
A. Midya
Other course modules lecturer
dr. J.C. Rot
Other course modules lecturer
prof. dr. F.W. Vaandrager
Other course modules lecturer
prof. dr. F.W. Vaandrager
Other course modules lecturer
prof. dr. F.W. Vaandrager
Other course modules lecturer
Academic year2020
KW1-KW2  (31/08/2020 to 24/01/2021)
Starting block
Course mode
Registration using OSIRISYes
Course open to students from other facultiesYes
Waiting listNo
Placement procedure-
To provide the intellectual tools for designing and analyzing algorithms.
This course is about the design and analysis of algorithms: how to design correct and efficient algorithms. The main goal of this course is to provide the intellectual tools for designing and analyzing your own algorithms for problems you need to solve in the future.
Some design tools that we will discuss are: data structures (e.g. hash tables,  red-black trees), divide-and-conquer, dynamic programming, and greedy algorithms. A significant part of the course will be devoted to a discussion of graph algorithms (BFS, DFS, shortest paths, spanning trees, network flow,..) and sorting algorithms.

Instructional Modes
  • Lecture
  • Tutorial
  • Self-study

Presumed foreknowledge
Programming experience and basic math knowledge (induction, sets, discrete math, logic, proofs) are essential prerequisites for this course.
Test information
- Grades will be awarded on the basis of an exam and two practical assignments. The final grade is 0.6 E + 0.2 P1 + 0.2 P2, where E is the result of the exam and P1 and P2 are the results of the two practical assignment, respectively. - The grade for the exam must be at least 5: if the grade for the exam is below 5 then the final grade of the course equals the grade for the exam. - You are only allowed to participate in the exam if you have submitted serious attempts for solutions for the two practical assignments and for 9 out of the 13 weekly assignments ('serious attempt' means grade is not NSI, niet serieus ingeleverd). - If you followed the course in a previous year, did not pas the course but nevertheless got an average grade of at least 7 for the practical assignments then you don't have to redo the practical assignments and your previous results will also count this year. Please contact the instructor if this applies to you. - For each weekly assignment with score V or G (sufficient or good) you earn 0.1 bonus point for the exam; the maximum bonus score you can earn is 1 point. - For the exam there will be a resit but there will not be a second chance for the practical assignments.

Required materials
A standard monograph on algorithms, including their complexity.
Title:Introduction to Algorithms, third edition
Author:Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Publisher:MIT Press Ltd

Instructional modes
Attendance MandatoryYes

Final grade (incl. bonus)
Test weight5
Test typeExam
OpportunitiesBlock KW2, Block KW3