The instructor will be 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

A good source for extra problems in the design and analsysis of algorithms is the free book

*Problems on Algorithms*, Second Edition, by Ian Parberry and William Gasarch (free book)

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

Tutorial Date | Handout | Revision |

06/09/2016 | None -- Background Review Session | |

13/09/2016 | Problem Set 1 Prob 5 solution | |

20/09/2016 | Problem Set 2 Solution Sketch | |

27/09/2016 | Problem Set 3 Solution Sketch | |

04/10/2016 | Problem Set 4 Solution Sketch | |

11/10/2016 | Problem Set 5 Solution Sketch | |

18/10/2016 | Problem Set 6 Solution Sketch | |

25/10/2016 | Exam Question Review | |

01/11/2016 | Problem Set 7 Solution Sketch | |

08/11/2016 | Problem Set 8 Solution Sketch | |

15/11/2016 | Problem Set 9 Solution Sketch | |

22/11/2016 | Problem Set 10 Solution Sketch Taxi_Scheduling_PPT Extra Matching Examples | 21/11/16 21/11/16 |

29/11/2016 | Problem Set 11 Solution Sketch Hashing_Solution |

Return to COMP3711H Fall 2016 Home Page