CSC148 Winter 2018 - Lecture Slides

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.

Week 1: OO Programming

Lecture slides

Week 2: ADT; Stacks and Queues

Lecture slides

Week 3: Exceptions

Lecture slides

Week 4: Recursion

Lecture slides

Week 5: More Recursion

Lecture slides

Week 6: Trees

Lecture slides

Week 7: N-ary Trees and BSTs

Lecture slides

Week 8: Linked Lists

No Slides

Week 9: Algorithm Efficiency

Lecture slides

Week 10: Algorithm Efficiency Cont.

Lecture slides

Week 11: Sorting

Lecture slides

Week 12: Wrapup

Lecture slides

© 2018 Larry Yueli Zhang All Rights Reserved