Forelesningsplan

----------------





24/8    Kompendium 1

31/8    Kompendium 2

7/9     Kompendium 3



14/9    Random Graphs 1

21/9    Random Graphs 2

28/9    Second Moment Method



5/10    Networks for Sorting

12/10   Improved Sorting Networks



19/10   Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings 

26/10   IN 394 Notes 1

2/11	In 394 Notes 2

9/11	Expected Computation Time for Hamiltonian Path Problem



16/11   Egen Artikkel



23/11	Repetisjon

30/11	Repetisjon

7/12	Repetisjon



10/12   Eksamen (munntlig)