CSC263 Winter 2015 - L0301 Lecture Slides

TR10, SF3202, Instructor: Larry Zhang

WARNING: The lecture slides posted on this page are OUTDATED course content. It should NOT be used as a valid source of information for any current course offering. The ONLY valid source of course information is the material provided in the CURRENT offering of a course.

Also, please be warned that these lecture slides may contain SPOILERS of in-class activities such as formative questions and exercises designed for the delivery of the course content. These questions are beneficial for your learning only if you try to think about the questions and solve the problem first, independently. Seeing the answers/solutions prematurely may be harmful to your learning experience. It is your own responsibility to use these materials with caution to protect your learning experience.

Memes

Week 1: Complexity Review; ADTs

Lecture slides

Week 2: Priority Queues; Heaps

Lecture slides

Week 3: Dictionaries; BSTs

Lecture slides

Week 4: Balanced Trees; Augmenting

Lecture slides

Week 5: Hashing

Lecture slides

Week 6: Randomization; Quicksort

Lecture slides

Week 7: Amortization; Dynamic Arrays

Lecture slides

Week 8: Graphs; Breadth-First Search

Lecture slides

Week 9: Depth-First Search

Lecture slides

Week 10: Minimum Spanning Trees

Lecture slides

Week 11: Disjoint Sets

Lecture slides

Week 12: Lower Bounds; Review

Lecture slides

© 2015 Larry Yueli Zhang All Rights Reserved