User Tools

Site Tools


2ilc0

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
2ilc0 [2016/04/18 11:13]
bmpjansen [News]
2ilc0 [2016/11/16 18:08]
bmpjansen [News]
Line 1: Line 1:
-====== Algorithms (2ILC0), 2nd Quartile, ​2015/2016 ======+====== Algorithms (2ILC0), 2nd Quartile, 2016/2017 ======
  
 This is the course website for the Algorithms course 2ILC0. This is the course website for the Algorithms course 2ILC0.
Line 5: Line 5:
 ===== News ===== ===== News =====
  
-18 April **Last-minute update** Due to a dental emergency I cannot be present during the exam inspection. You can look at your exams today between 12:00 and 13:00 in MF 4.103, but the tutor present there was not involved with grading the exam and so he cannot answer any questions about the exam. If you want to discuss aspects of your exam with me, email me at b.m.p.jansen@tue.nl to make an appointment. Note that, by the bachelor college regulations,​ I am not allowed to change your homework grade at this point because it has the status of a midterm evaluation.  +16 Nov All course administration moved to [[https://canvas.tue.nl/​courses/​406||Canvas]] and this page has become obsoletePlease visit the page in Canvas at https://canvas.tue.nl/​courses/​406. | 
-^ 14 April | The re-take exam has been graded and the scores are available ​[[http://www.win.tue.nl/~bjansen/courses/2ILC0/​RetakeScores.html|here]]. The grade for the retake exam replaces the grade for the previous exam. Afterwards, the new final score is calculated as explained below. (This means that your homework grade still affects 50% of the new grade.) You can inspect your exam next Monday (April 18) in my office (MF 4.104A) between 12:00 and 13:00. The scores are posted here unofficially,​ "for your convenience";​ errors made here do not grant you any rights. Only the final grades as they will be registered by the administration are official. | +16 Nov Handout ​for backtracking available ​from the link in the schedule. | 
-^ 26 Jan | The exam has been graded and the scores are available [[http://www.win.tue.nl/~bjansen/courses/2ILC0/​Scores.html|here]]. The document includes all homework scores and a calculation of your final grade according to the rules explained below. Note that the homework score and exam score are both rounded to 1 decimal before they are combined into your final score which is rounded to the nearest integer; this works in your favor. You still have the opportunity to inspect your exam next Monday. The scores are posted here unofficially,​ "for your convenience";​ errors made here do not grant you any rights. Only the final grades as they will be registered by the administration are official. | +Nov | First version of the 2016-2017 ​website ​online. ​|
-21 Jan The exam will be graded next week. Scores ​for the exam and for A6 will be posted here when we are done. You can inspect your exam, and your grades for assignment A6, on Monday the 1st of February ​from 12:30 - 13:30 in room MF 6.131 | +
-^ 16 Dec | By popular request I have decided to extend ​the deadline for homework assignment 5. The new deadline is Sunday, January the 3rd. However, I recommend that you finish your assignment this week to ensure you have a carefree Christmas vacation. Keep in mind that only your first hand-in will be graded, so double-check your answers before submitting! | +
-^ 14 Dec | Changed ​the runtime bound for A.5-6 (iii) to O(n log n + (n+m) log m). | +
-^ 4 Dec | Some students were worried they scored less points than they deserve for Part (v) of Exercise A.2-4, on account of having given pseudocode while you were not asked to give pseudocode. This should not be the case; the only reason for not scoring full points is to have mistakes or unreadable pseudocode. If you believe your solution to part (v) is correct but did not score full points, send an exact PDF copy of your original submission to b.m.p.jansen@tue.nl . As a general guideline, when the exercise does not ask for pseudocode or to make "an algorithm",​ this means that you can give a correct answer without resorting to pseudocode and an answer in text is less likely to contain unintentional mistakes. | +
-^ 2 Dec | Uploaded PowerPoint versions of all lectures | +
-^ 2 Dec | Starting immediately,​ the Friday room for tutorial group 1 (supervised by Ali & Henk) has been moved from Flux 1.09 to Matrix 1.50. This puts all Friday groups close together in Matrix and makes it easier to ask other instructors for feedback on your graded assignments. | +
-^ 23 Nov | **Important notice regarding homework assignments.** Submit your solutions to the //tutor// that is responsible for the group that you have been assigned to, //not// to the student assistant. Submit to the TU/e email address listed below. You should submit exactly once. To enforce this policy, only your //first// submission is graded; follow-up emails with corrections will be disregarded. You should therefore wait with submitting until you verified that everything is correct. Please include your name, student number, and //group number// on the first page. | +
-^ 23 Nov | Updated text for exercise A2-2 (v) of homework assignment 2 | +
-^ 20 Nov | Homework assignment 2 posted, see schedule ​+
-^ 11 Nov | Assignment of students to tutorial groups has been made according to registration during the first lecture, see [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​GroupAssignment.txt|here]]. Please attend the tutorial of the group that you have been assigned to, and submit your homework solutions to your group'​s tutor. | +
-04 Nov | First version of the course ​website |+
  
 ===== Instructors and contact information ===== ===== Instructors and contact information =====
  
-  * Bart M. P. Jansen, MF 4.104A, [[b.m.p.jansen@tue.nl|b.m.p.jansen@tue.nl]],​ lecturer+  * Bart M. P. Jansen, MF 4.099, [[b.m.p.jansen@tue.nl|b.m.p.jansen@tue.nl]],​ lecturer
   * Aleksandar Markovic, MF 4.100, [[a.markovic@tue.nl|a.markovic@tue.nl]],​ tutor   * Aleksandar Markovic, MF 4.100, [[a.markovic@tue.nl|a.markovic@tue.nl]],​ tutor
-  * Ali Mehrabi Davoodabadi, MF 4.103, [[amehrabi@win.tue.nl|amehrabi@win.tue.nl]], tutor +  * Mehran Mehr, MF 4.100, [[m.mehr@tue.nl|m.mehr@tue.nl]], tutor 
-  * Max Konzack, MF 4.103, [[m.p.konzack@tue.nl|m.p.konzack@tue.nl]], tutor +  * Astrid Pieterse, MF 4.100, [[a.pieterse@tue.nl|a.pieterse@tue.nl]], tutor 
-  * Henk Alkema ​[[h.y.alkema@student.tue.nl|h.y.alkema@student.tue.nl]],​ student assistant +  * Olav Bunte [[o.bunte@student.tue.nl|o.bunte@student.tue.nl]],​ student assistant 
-  * Jeffrey Aben [[j.h.t.aben@student.tue.nl|j.h.t.aben@student.tue.nl]],​ student assistant +  * Jari de Kroon [[j.j.h.d.kroon@student.tue.nl|j.j.h.d.kroon@student.tue.nl]],​ student assistant 
-  * Jules Wulms [[j.j.h.m.wulms@student.tue.nl|j.j.h.m.wulms@student.tue.nl]],​ student assistant+  * Martijn Struijs ​[[m.a.c.struijs@student.tue.nl|m.a.c.struijs@student.tue.nl]],​ student assistant 
 +  * Bart van der Vecht [[b.v.d.vecht@student.tue.nl|b.v.d.vecht@student.tue.nl]],​ student assistant 
 +  * Wouter Verlaek [[w.m.w.r.verlaek@student.tue.nl|w.m.w.r.verlaek@student.tue.nl]],​ student assistant
  
 ===== Contents ===== ===== Contents =====
Line 63: Line 54:
 The weekly schedule for this course is: The weekly schedule for this course is:
  
-  *  Wednesday 5+6 (13:45 - 15:​30), ​lecture ​in IPO 0.98; **except on January 6when we are in HELIX 1** +  * Wednesday 5+6 (13:45 - 15:​30), ​tutorial ​in FLUX 1.05FLUX 1.09, METAFORUM 13, METAFORUM 15 
-  *  Wednesday 7+8 (15:45 - 17:​30), ​tutorial ​in AUDITORIUM 1, MATRIX 1.44, and MATRIX 1.60; +  * Wednesday 7+8 (15:45 - 17:​30), ​lecture ​in Paviljoen U46 
-  *  Friday 1+2 (8:45 - 10:30), tutorial in MATRIX 1.44MATRIX 1.46and <​del>​FLUX 1.09</​del>​ MATRIX 1.50; +  * Friday 1+2 (8:45 - 10:30), tutorial in MATRIX 1.50METAFORUM 14METAFORUM 13, METAFORUM 15 
-  *  Friday 3+4 (10:45 - 12:30), lecture in AUDITORIUM 2.+  * Friday 3+4 (10:45 - 12:30), lecture in Paviljoen B2
  
 During the lectures hours, the basic theory will be taught and plenary feedback on the homework exercises may be given. During the lectures hours, the basic theory will be taught and plenary feedback on the homework exercises may be given.
  
-The tutorial hours are used either for working on and asking questions about the homework assignments,​ for discussion of the solutions to the homework exercises, and for individual feedback. ​There are three tutorial ​groups. An assignment of students to group was made during the first lecture. Use [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​GroupAssignment.txt|this text file]] to determine what group you are in. Please attend the tutorial ​of the group that you have been assigned to, and submit your homework solutions to your group'​s tutor.+The tutorial hours are used either for working on and asking questions about the homework assignments,​ for discussion of the solutions to the homework exercises, and for individual feedback. ​Tutorial ​groups ​will be made during the first week of classes.
  
 The assignment of groups to rooms is as follows: The assignment of groups to rooms is as follows:
  
-  * Tutorial group 1 (Ali Henk): Auditorium 1 on Wednesdays and <​del>​Flux 1.09</​del>​ Matrix 1.50 on Fridays +  * Tutorial group 1 (Aleks ?): MF 15 on Wednesdays and MF 15 on Fridays 
-  * Tutorial group 2 (Aleksandar ​Jeffrey): Matrix ​1.44 on Wednesdays and Matrix 1.44 on Fridays +  * Tutorial group 2 (Astrid ​?): Flux 1.09 on Wednesdays and MF 14 on Fridays 
-  * Tutorial group 3 (Max Jules): Matrix ​1.60 on Wednesdays and Matrix ​1.46 on Fridays+  * Tutorial group 3 (Mehran ​?): Flux 1.05 on Wednesdays and MATRIX ​1.50 on Fridays 
 +  * Tutorial group 4 (? & ?): MF 13 on Wednesdays and MF 13 on Fridays
  
 ===== Grading scheme ===== ===== Grading scheme =====
Line 84: Line 76:
 There are six sets of homework exercises. The deadlines for these homework sets can be found in the schedule. For each set you can get up to 10 points. Your final score for the homework assignment is calculated as follows: There are six sets of homework exercises. The deadlines for these homework sets can be found in the schedule. For each set you can get up to 10 points. Your final score for the homework assignment is calculated as follows:
  
-  * take the sum of the 6 homework scores, subtract the lowest score among sets 1-5, and divide the result by 5.+  * take the sum of the 6 homework scores, subtract the lowest score among the 5 sets that do not deal with NP-completeness, and divide the result by 5.
  
-In other words, the worst-scoring ​homework out of the first 5 sets does not count.+In other words, ​the grade for the set on NP-completeness always counts, but the worst-scoring ​grade for the remaining ​5 sets does not count.
  
 On the exam you can score up to 10 points. On the exam you can score up to 10 points.
Line 105: Line 97:
 ===== Schedule ===== ===== Schedule =====
  
-Please note the schedule below is tentative and may be adapted during the course.+The schedule below is tentative and may be adapted during the course. Note that, for your convenience,​ the dates are not completely in chronological order: the deadline for the homework is listed after the last tutorial dedicated to that homework.
  
 ^Date^ From^ thru^ Location^ Event^ Topic and material^ Homework^ ^Date^ From^ thru^ Location^ Event^ Topic and material^ Homework^
-|Wed 11-11| 13:​45| 15:​30| IPO 0.98| lecture ​1A backtracking| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​backtracking.pdf|handout]], ​[[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L1-Backtracking.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L1-Backtracking.pptx|slides pptx]]| ​Homework 1 [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A1-15.pdf|pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A1-15.zip|zip]] The zip file with the LaTeX source also includes a file with the LaTeX source of the pseudocode in the handout. +|wed 16-11-2016| 13:​45| 15:​30| FLUX 1.05, FLUX 1.09, MF  13, MF  15| **no tutorial** | Homework set 1 | 
-|Wed 11-11| 15:45| 17:30|  MATRIX ​ 1.44MATRIX ​ 1.60  AUD 1 | no tutorial| | ::: | +|wed 16-11-2016| 15:​45| 17:​30| PAVILJOEN U46| Lecture ​1A: Backtracking| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​backtracking.pdf|handout]],​ [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L1-Backtracking.pptx|slides pptx]] | ::|  
-|Fri  13-11| 08:​45| 10:​30| MATRIX ​ 1.44MATRIX ​ 1.46, FLUX 1.09 | tutorial ​1A| First half of homework 1 along with all the exercises in the handout | ::: | +|fri 18-11-2016| 08:45| 10:30| MATRIX 1.50MF  13, MF  14MF  15| Tutorial ​1A|  | ::: |  
-|Fri  13-11| 10:​45| 12:​30| AUD 2| lecture ​1B greedy algorithms| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L2-Greedy.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L2-Greedy.pptx|slides pptx]] ​CLRS Sections 16.1-16.3.The chapter refers several times to dynamic programming (Chapter 15), which we will discuss later. Upon first reading, you may skip the parts referring to dynamic programming. ​| ::: | +|fri 18-11-2016| 10:​45| 12:​30| PAVILJOEN B2| Lecture ​1B: Greedy ​algorithms| CLRS Sections 16.1-16.3| ::: |  
-|||||| :::| +|wed 23-11-2016| 13:​45| 15:​30| FLUX 1.05FLUX 1.09MF  13MF  15| Tutorial 1B| |::: | 
-|Wed 18-11| 13:​45| 15:​30| IPO 0.98| no lecture| | ::: | +|thu 24-11-2016| 17:​59| | | Deadline homework set 1| |::: |
-|Wed 18-11| 15:​45| 17:​30| MATRIX  ​1.44MATRIX  ​1.60  AUD 1| tutorial 1B| Second half of homework 1and the [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-E2-15.pdf|practice exercises for lecture 2A]] | ::: | +
-|Fri  20-11| 08:​45| 10:​30| MATRIX ​ 1.44MATRIX ​ 1.46, FLUX 1.09| no tutorial| | ::: | +
-|Fri  20-11| 10:​45| 12:​30| AUD 2| lecture 2A dynamic programming I| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L3-DynamicProgramming.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L3-DynamicProgramming.pptx|slides pptx]] CLRS Sections 15.1-15.2| :::​| +
-|Sun 22-11| 23:59| | By email| Deadline homework set 1| |  :::|+
 ^ ||||||| ^ |||||||
-|Wed 25-11| 13:45| 15:30| IPO 0.98| lecture 2B dynamic programming II|[[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L4-DynamicProgramming2.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L4-DynamicProgramming2.pptx|slides pptx]] ​CLRS Sections 15.3-15.5| Homework 2 [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A2-15.pdf|pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A2-15.zip|zip]] ​+|wed 23-11-2016| 15:45| 17:30| PAVILJOEN U46| Lecture 2ADynamic Programming I| CLRS Sections 15.1-15.2| Homework ​set 2 |  
-|Wed 25-11| 15:45| 17:​30| MATRIX ​ 1.44MATRIX ​ 1.60  AUD 1| tutorial ​2A| First half of homework 2, together with the [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-E3-15.pdf|practice exercises on dynamic programming]] | :::| +|fri 25-11-2016| 08:45| 10:30| MATRIX 1.50MF  13, MF  14, MF  15| Tutorial ​2A: Dynamic Programming| |::: |  
-|Fri  27-11| 08:45| 10:30| MATRIX ​ 1.44, MATRIX ​ 1.46, FLUX 1.09| tutorial ​2B| Second half of homework 2, together with the [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-E3-15.pdf|practice exercises on dynamic programming]] | :::| +|fri 25-11-2016| 10:45| 12:30| PAVILJOEN B2| Lecture ​2B: Dynamic Programming II| CLRS Sections 15.3-15.5|::: |  
-|Fri  27-11| 10:45| 12:30| AUD 2| lecture 3A single-source shortest paths| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L5-SingleSourceShortestPaths.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L5-SingleSourceShortestPaths.pptx|slides pptx]] CLRS Chapter 24 (except Section 24.4)| ::: | +|wed 30-11-2016| 13:45| 15:30| FLUX 1.05, FLUX 1.09, MF  13, MF  15| Tutorial 2BDynamic programming| |::: |  
-|Sun 29-11| 23:59| | By email| Deadline homework set 2 | | ::: |+|thu 1-12-2016| 17:​59| | | Deadline homework set 2| |::: |
 ^ ||||||| ^ |||||||
-|Wed 2-12| 13:45| 15:30| IPO 0.98| lecture 3B all-pairs shortest paths| ​[[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L6-AllPairsShortestPaths.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L6-AllPairsShortestPaths.pptx|slides pptx]] ​CLRS Chapter ​25 (except Section ​25.2)| Homework 3 [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A3-15.pdf|pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A3-15.zip|zip]]  ​+|wed 30-11-2016| 15:45| 17:30| PAVILJOEN U46| Lecture 3A: Single-source ​shortest paths| CLRS Chapter ​24 (except Section ​24.4)| Homework ​set 3 |  
-|Wed 2-12| 15:45| 17:​30| MATRIX ​ 1.44MATRIX ​ 1.60  AUD 1| tutorial ​3A| First half of homework 3, together with the [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-E4-15.pdf|practice exercises on shortest ​paths]] | :::| +|fri 2-12-2016| 08:45| 10:30| MATRIX 1.50MF  13, MF  14, MF  15| Tutorial ​3A: Shortest ​paths| |::: |  
-|Fri  4-12| 08:45| 10:30| MATRIX ​ 1.44, MATRIX ​ 1.46, FLUX 1.09| tutorial ​3B| Second half of homework 3, together with the **updated** [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-E4-15.pdf|practice exercises on shortest paths]] | :::| +|fri 2-12-2016| 10:45| 12:30| PAVILJOEN B2| Lecture ​3B: All-pairs shortest paths| CLRS Chapter 25 (except Section 25.2)|::: |  
-|Fri  4-12| 10:45| 12:30| AUD 2| lecture 4A maximum flow| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L7-MaxFlow.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L7-MaxFlow.pptx|slides pptx]] CLRS Chapter 26 until (and excluding) “Analysis of Ford-Fulkerson”| :::| +|wed 7-12-2016| 13:45| 15:30| FLUX 1.05, FLUX 1.09, MF  13, MF  15| Tutorial 3BShortest paths| |::: |  
-|Sun 6-12| 23:59| | By email| Deadline homework set 3 | | :::|+|thu 8-12-2016| 17:​59| | | Deadline homework set 3| |::: |
 ^ ||||||| ^ |||||||
-|Wed 9-12| 13:45| 15:30| IPO 0.98| lecture ​4B applications of max flow[[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L8-MaxFlow2.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L8-MaxFlow2.pptx|slides pptx]] CLRS Sections 26.2 and 26.3| Homework 4 [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A4-15.pdf|pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A4-15.zip|zip]] ​+|wed 7-12-2016| 15:45| 17:30| PAVILJOEN U46| **no lecture**| | Homework ​set 4 |  
-|Wed 9-12| 15:45| 17:​30| MATRIX ​ 1.44MATRIX ​ 1.60  AUD 1| tutorial 4A| First half of homework 4 | :::| +|fri 9-12-2016| 08:45| 10:30| MATRIX 1.50MF  13, MF  14, MF  15| tutorial 4A| |::: |  
-|Fri  11-12| 08:45| 10:30| MATRIX ​ 1.44, MATRIX ​ 1.46, FLUX 1.09| tutorial 4BSecond half of homework 4 | :::| +|fri 9-12-2016| 10:45| 12:30| PAVILJOEN B2| Invited guest lecture: Bas den Heijer @ ORTEC| |::: |  
-|Fri  11-12| 10:45| 12:30| AUD 2| lecture 5A linear programming| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L9-LinearProgramming.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L9-LinearProgramming.pptx|slides pptx]] CLRS Sections 29.1 and 29.2| :::| +|wed 14-12-2016| 13:45| 15:30| FLUX 1.05, FLUX 1.09, MF  13, MF  15| tutorial 4B| |::: |  
-|Sun 13-12| 23:59| | By email| Deadline homework set 4 | | :::|+|thu 15-12-2016| 17:​59| | | Deadline homework set 4| |::: |
 ^ ||||||| ^ |||||||
-|Wed 16-12| 13:45| 15:30| IPO 0.98| surprise lecture by Bas den Heijer @ ORTECEngineering Highway Hierarchies ​[[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​EngineeringHNR.pptx|slides pptx]] ​(highway hierarchies are not part of the exam material) | Homework 5 [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A5-15.pdf|pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A5-15.zip|zip]]+|wed 14-12-2016| 15:45| 17:30| PAVILJOEN U46| Lecture 5AFlows| CLRS Chapter 26 until (and excluding) “Analysis ​of Ford-Fulkerson”| Homework ​set 5 |  
-|Wed 16-12| 15:45| 17:​30| MATRIX ​ 1.44MATRIX ​ 1.60  AUD 1| tutorial ​5A| First half of homework 5 | :::| +|fri 16-12-2016| 08:45| 10:30| MATRIX 1.50MF  13, MF  14, MF  15| Tutorial ​5A: Flows| |::: |  
-|Fri  18-12| 08:45| 10:30| MATRIX ​ 1.44, MATRIX ​ 1.46, FLUX 1.09| review tutorial| Second half of homework 5 | :::| +|fri 16-12-2016| 10:45| 12:30| PAVILJOEN B2| Lecture 5B: Applications of flows| CLRS Sections 26.2 and 26.3|::: |  
-|Fri  18-12| 10:45| 12:30| AUD 2| overview lecture| | :::| +|wed 21-12-2016| 13:45| 15:30| FLUX 1.05, FLUX 1.09, MF  13, MF  15| Tutorial 5B: Application of flows| |::: |  
-|Sun 3-1-2016| 23:​59| | ​By email | Deadline homework set 5 | | :::|+|thu 22-12-2016| 17:​59| | | Deadline homework set 5| |::: |
 ^ ||||||| ^ |||||||
-|Wed 6-1| 13:45| 15:30| ** HELIX 1 **| lecture ​6A NP-completeness| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L10-NPCompleteness.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L10-NPCompleteness.pptx|slides pptx]] ​CLRS Sections 34.1—34.4| Homework 6 [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A6-15.pdf|pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​2ILC0-A6-15.zip|zip]] ​+|wed 21-12-2016| 15:45| 17:30| PAVILJOEN U46| Lecture ​6ANP-completeness ​I| CLRS Sections 34.1—34.4| Homework ​set 6 |  
-|Wed 6-1| 15:45| 17:​30| MATRIX ​ 1.44MATRIX ​ 1.60  AUD 1| no tutorial| | :::| +|fri 23-12-2016| 08:45| 10:30| MATRIX 1.50MF  13, MF  14, MF  15| Tutorial 6A: NP-completeness| |::: |  
-|Fri  8-1| 08:45| 10:30| MATRIX ​ 1.44, MATRIX  ​1.46, FLUX 1.09| tutorial 6A| First half of homework 6 | :::| +|fri 23-12-2016| 10:45| 12:30| PAVILJOEN B2| Lecture 6B: NP-completeness II| CLRS Sections 34.1—34.4|::: |  
-|Fri  8-1| 10:45| 12:30| ** IPO 0.98 ** | lecture ​6B NP-completeness| ​[[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L11-NPCompleteness2.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L11-NPCompleteness2.pptx|slides pptx]] CLRS Sections 34.1—34.4| :::| +|wed 11-1-2017| 13:45| 15:30| FLUX 1.05, FLUX 1.09, MF  13, MF  15| Tutorial ​6BNP-completeness| |::: |  
-^ ||||||:::​| +|thu 12-1-2017| 17:59| | | Deadline homework set 6| |::: |  
-|Wed 13-1| 13:45| 15:30| IPO 0.98| what is expected on the exam| [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L12-ExamPreparation.pdf|slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L12-ExamPreparation.pptx|slides pptx]] | :::| +^ ||||||
-|Wed 13-1| 15:45| 17:30| MATRIX ​ 1.44, MATRIX ​ 1.60  AUD 1| tutorial 6BSecond half of homework 6 | :::| +|wed 11-1-2017| 15:45| 17:30| PAVILJOEN U46| Lecture 7To be determined| | Exam practice ​|  
-|Fri  15-1| 08:45| 10:30| MATRIX  ​1.44, MATRIX ​ 1.46, FLUX 1.09| exam practice ​tutorial| | :::| +|fri 13-1-2017| 08:45| 10:30| MATRIX 1.50, MF  13, MF  14, MF  15| Tutorialexam practice| |::: |  
-|Fri  15-1| 10:45| 12:30| AUD 2| programming contest puzzles & answering your questions about the exam material[[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L13-RecreationalAlgorithmics.pdf|puzzles slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L13-RecreationalAlgorithmics.pptx|puzzles slides pptx]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L13-WrapUp.pdf|follow-up courses slides pdf]] [[http://​www.win.tue.nl/​~bjansen/​courses/​2ILC0/​L13-WrapUp.pptx|follow-up courses slides pptx]] | :::| +|fri 13-1-2017| 10:45| 12:30| PAVILJOEN B2| Surprise lecture| |::: |  
-|Sun 17-1| 23:59| | By emailDeadline homework set 6 | | :::|+|wed 18-1-2017| 13:45| 15:30| FLUX 1.05, FLUX 1.09, MF  13, MF  15| Tutorial: ​exam practice| |:::​ |  
 +|wed 18-1-2017| 15:45| 17:30| PAVILJOEN U46| **no lecture**| |::: |  
 +|fri 20-1-2017| 08:45| 10:30| MATRIX 1.50, MF  13, MF  14, MF  15| **no tutorial**| |::: |  
 +|fri 20-1-2017| 10:45| 12:30| PAVILJOEN B2| Lecture: What you should know on the exam| |::: |
 ^ ||||||| ^ |||||||
2ilc0.txt · Last modified: 2016/11/17 11:57 by bmpjansen