    Course module   NWIIBC027  Category   BA (Bachelor)  Language of instruction   Dutch  Offered by   Radboud University; Faculty of Science; Informatica en Informatiekunde;  Lecturer(s)     Academic year   2017   Period   KW1KW2  (04/09/2017 to 04/02/2018) 
 Starting block   KW1  
 Course mode   fulltime  
 Remarks     Registration using OSIRIS   Yes  Course open to students from other faculties   Yes  Preregistration   No  Waiting list   No  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, redblack trees), divideandconquer, dynamic programming, greedy algorithms, network flows, and randomized algorithms. A significant part of the course will be devoted to a discussion of various graph algorithms (BFS, DFS, shortest paths, spanning trees, tree isomorphism).




Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein Introduction to Algorithms, third edition, The MIT Press 2009. A standard monograph on algorithms, including their complexity. 
• 32 hours of lectures • 32 hours of problem classes • 104 hours self studying
Further information: There will be lectures, problem sessions with penpaper exercises and a practical assignment. 
List of topics includes:  models of computation;  basic Onotation to analyze algorithms;  divide and conquer; greedy algorithms;  data structures: heaps, AVL trees, redblack trees, ...;  graph algorithms;  dynamic programming;  linear programming; 
0.6 * T + 0.4 * P, where T is the result of the test and P the result of the practical assignment. 
Basic programming experience and basic math knowledge (induction, sets, logic, proofs). 
   Required materialsBookThomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein Introduction to Algorithms, third edition, The MIT Press 2009. A standard monograph on algorithms, including their complexity. 


Instructional modesCourseAttendance Mandatory   Yes 
 Lecture
 Tutorial
 Zelfstudie GeneralParticipants are expected to invest 168h (=6ec) in this course. Altogether there will be 14 lectures and 14 problem sessions. Each week you will need 2 hours to attend a lecture, 2 hours to attend the problem sessions, and an additional 2 hours to study the lecture material and work on the weekly problems. For each of the two large practical assignments you will need approximately 32 hours. This leaves you with 20 hours to prepare for and make the exam: 168 = 14*(2+2+2) + 2*32 + 20. RemarkAltogether you have 112 hours for self study, which is 7h per week for 16 weeks.

 TestsTentamenTest weight   1 
Opportunities   Block KW2, Block KW4, Block KW4 


  
 
 