The instructor was there to answer questions about missing background material.

Students who want more further sourses for background material can check the following

- For Recurrence relations, my old Discrete Math notes Lecture 12 and possibly Lecture 11 or Cormen, Liserson, Rivest, Stein (CLRS), Chapter 4 on the Master Theorem
- For Basic data structures, e.g., lists, stacks, queues trees, CLRS Chapter 10
- For O ( ) Notation, CLRS Chapter 3

Handouuts might be modified to correct errors or add information. All major changes will be documented in the Revision Log

Tutorial Date | Handout | |

04/09/2014 | None -- Background Review Session | |

11/09/2014 | Problem Set 1 Prob 5 solution | |

18/09/2014 | Problem Set 2 | |

25/09/2014 | Problem Set 3 | |

09/10/2014 | Problem Set 4 | |

16/10/2014 | Problem Set 5 | |

23/10/2014 | None: Tutorial will be a Q&A review session with instructor | |

30/10/2014 | Problem Set 6 | |

06/11/2014 | Problem Set 7 | |

13/11/2014 | Problem Set 8 and Solutions | |

20/11/2014 | Problem Set 9 Problem 5 Solution | |

27/11/2014 | Problem Set 10 Problem 3 Solution |

Return to COMP3711H Fall 2014 Home Page