\f0\fs24 \cf0 <H1>Schedule</H1>\
\
This is a preliminary form. There could be small changes during the course.\
\
<P>\
<TABLE border=1>\
<TBODY>\
<TR>\
<TH>Week\
<TH>Date\
<TH>Time\
<TH>Place\
<TH>Activity\
<TH>Topic\
<TH>Reading instructions\
<TR>\
<TD>4<TD>20/1<TD>13-15<TD>E32<TD>Lecture 1<TD>Introduction. Graph Algorithms\
<TD>Ch. 1-3\
\
\
<TR>\
<TD><TD>21/1<TD>13-15<TD>D34<TD>Lecture 2<TD>Greedy Algorithms\
<TD>Ch. 4 (Except 4.4)\
\
<TR>\
<TD><TD>22/1<TD>15-17<TD>E52<TD>Exercise 1<TD>Algorithm Analysis\
\
\
<TR>\
<TD>5<TD>26/1<TD>13-15<TD>D34<TD>Lecture 3<TD>Flow Algorithms. More about graph algorithms.\
<TD>Ch 7.1-7.3, 7.5, 4.4, 6.8-6.10\
\
<TR>\
<TD><TD>27/1<TD>13-15<TD>D34<TD>Lecture 4<TD>Divide and Conquer Algorithms.\
<TD>Ch 5\
\
\
<TR>\
<TD><TD>29/1<TD>15-17<TD>E31<TD>Exercise 2<TD>Divide and Conquer Algorithms\
\
<TR>\
<TD>6<TD>2/2<TD>13-15<TD>E31<TD>Lecture 5<TD>Dynamic Programming\
<TD>Ch 6\
\
<TR>\
<TD><TD>5/2<TD>13-15<TD>E31<TD>Lecture 6<TD>Dynamic Programming cont.\
<TD>Ch 6\
\
\
<TR>\
<TD><TD>6/2<TD>15-17<TD>E32<TD>Exercise 3<TD>Dynamic Programming\
\
\
<TR>\
<TD>7<TD>9/2<TD>13-15<TD>Q17<TD>Lecture 7<TD>Introduction to Linear Programming\
<TD>Lecture notes. Extra material on Linear Programming. Can be found on Kurswebben.\
\
\
<TR>\
<TD><TD>11/2<TD>13-15<TD>D34<TD>Lecture 8<TD>Probabilistic Algorithms and other algorithms\
<TD>Lecture notes\
\
<TR>\
<TD><TD>12/2<TD>15-17<TD>D41<TD>Exercise 4<TD>Dynamic Programming cont.\
\
<TR>\
<TD><TD>13/2<TD>10-12<TD>Orange<TD>Lab 1<TD>Reporting of theory problems. Help session.\
\
\
\
<TR>\
<TD>8<TD>16/2<TD>13-15<TD>D34<TD>Lecture 9<TD>Complexity. NP-problems.\
<TD>Ch 8\
\
<TR>\
<TD><TD>18/2<TD>13-15<TD>Q31<TD>Lecture 10<TD>NP-problems cont.\
<TD>Ch 8\
\
\
\
<TR>\
<TD><TD>19/2<TD>15-17<TD>Q17<TD>Exercise 5<TD>Flow Algorithms and Linear Programming.\
\
<TR>\
<TD><TD>20/2<TD>10-12<TD>Orange<TD>Lab 1<TD>Lab reporting\
\
<TR>\
<TD>9<TD>23/2<TD>13-15<TD>D34<TD>Lecture 11<TD>Uncomputability.\
<TD>Lecture notes. Extra material on Uncomputability. Can be found on Kurswebben.\
\
<TR>\
<TD><TD>24/2<TD>13-15<TD>E31<TD>Lecture 12<TD>Turing Machines. Computability.\
<TD>Lecture notes. Extra material on Turing Machines. Can be found on Kurswebben. (You must login.)\
\
<TR>\
<TD><TD>26/2<TD>15-17<TD>E32<TD>Exercise 6<TD>NP-problems.\
\
\
\
\
<TR>\
<TD>14<TD>30/3<TD>8-10<TD>D41<TD>Lecture 13<TD>Approximation Algorithms\
<TD>Ch 11\
\
<TR>\
<TD><TD>31/3<TD>13-15<TD>E36<TD>Exercise 7<TD>NP-problems. Uncomputability.\
\
\
\
\
\
<TR>\
<TD>16<TD>13/4<TD>13-15<TD>D34<TD>Lecture 14<TD>Approximation Algorithms cont.\
<TD>CH 13.1-13.5\
<TR>\
<TD><TD>14/4<TD>8-10<TD>D41<TD>Exercise 8<TD>Approximation Algorithms.\
\
<TR>\
<TD><TD>16/4<TD>15-17<TD>Spel<TD>Lab 2<TD>Reporting of theory problems. Help session.\
\
\
\
\
\
<TR>\
<TD>17<TD>20/4<TD>13-15<TD>D34<TD>Lecture 15<TD>Probabilistic Algorithms. PSPACE-problems.\
<TD>Ch 9\
<TR>\
<TD><TD>21/4<TD>13-15<TD>E52<TD>Exercise 9<TD>Repetition.\
\
<TR>\
<TD><TD>23/4<TD>10-12<TD>Spel<TD>Lab 2<TD>Lab reporting.\
\
<TR>\
<TD>23<TD>1/6<TD>9-12<TD>V33,V35<TD>Exam<TD>\
\
\
\
\
</TBODY>\
</TABLE>}