# MA0301 Elementary discrete mathematics, spring 2016

## Lecture plan

Week | Date | Theme | Section | Notes | Remarks |
---|---|---|---|---|---|

02 | 11 Jan | Logic | 2.1-2.2 | ||

02 | 13 Jan | Logic | 2.2-2.3 | ||

03 | 18 Jan | Logic | 2.3-2.4 | ||

03 | 20 Jan | Logic | 2.4-2.5 (unfinished) | ||

04 | 25 Jan | Counting I | 2.5, 1.1 | Counting 1a | |

04 | 29 Jan | Counting I | 1.2-1.4 | Counting 1b | |

05 | 01 Feb | Sets | 3.1-3.2 | Sets a | |

05 | 03 Feb | Sets | 3.3, 8.1 | Sets b | |

06 | 08 Feb | Induction | 4.1 | Induction a | |

06 | 10 Feb | Induction | 4.1-4.2 | Induction b | |

07 | 15 Feb | Relations | 5.1,7.1 | Relations a | |

07 | 17 Feb | Relations | 7.2-7.4 | Relations b | Permanently skipped: examples 21,22,41, 59 and theorem 2c. |

08 | 22 Feb | Functions | 5.2-5.3 (partially) | Functions a | Sebastian recommends this website on functions, injectivity and surjectivity. |

08 | 24 Feb | Functions | 5.6 | Functions b | |

09 | 29 Feb | Counting II | 5.2-5.3 (counting) | Counting 2a | Kahoot answers |

09 | 02 Mar | Counting II | 5.5 | Counting 2b | Permanently skipped: example 5.47 |

10 | 07 Mar | Finite State Machines | 6.1-6.2 | ||

10 | 09 Mar | Finite State Machines | 6.2-6.3 | ||

11 | 14 Mar | Graphs | 11.1-11.2 | Graphs a | |

11 | 16 Mar | Graphs | 11.3-11.4 | Graphs b | |

12 | – no class – | ||||

12 | – no class – | ||||

13 | – no class – | ||||

13 | 30 Mar | Graphs | 11.5 | Graphs c | |

14 | 04 Apr | Trees | 12.1-12.2 | Trees a | |

14 | 06 Apr | Trees | 12.2-12.3, Example 10.5 | Trees b | Permanently skipped: Example 12.9 |

15 | 11 Apr | Complexity | 5.7-5.8 | Sorting algorithms and complexity | Permanently skipped: Example 5.71 |

15 | 13 Apr | Optimization and Matching | 5.8, 13.1 | Dijkstra's shortest-path algorithm | |

16 | 18 Apr | Optimization and Matching | 13.1-13.2 | Kruskal and Prim | |

16 | 20 Apr | Review: definition recap kahoot, old exam questions | The kahoot can be found here. I recommend randomizing the question order. The question lengths for questions on relations have been increased. | ||

17 | 25 Apr | Review: feel free to email topic suggestions | Suggested topics so far: Finite State Machines, Equivalence Relations |

There will probably be some changes in this lecture plan eventually. So far, 2.5 and 8.1 have been moved forward a bit.

Please note that my lecture notes were not originally written to be put online, and should not be used as a replacement for the book. (Also: they may contain some Dutch here and there.. )