CSC165 Fall 2014 - L5101 Lecture Slides

T6-9, BA1130, 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: Introduction, precision, quantifiers

Lecture slides

Week 2: Verify/falsify, sentences, symbols

Lecture slides

Week 3: Conjunction, disjunction, negation, implication

Lecture slides

Week 4: Implication/disjunction, mixed quantifiers, proof

Lecture slides

Week 5: Contradiction, existence, sequences

Lecture slides

Week 6: Cases, multiple quantifiers, limits

Lecture slides

Week 7: Sorting algorithm complexity, big-Oh

Lecture slides

Week 8: Counting steps, worst-case, formal big-Oh

Lecture slides

Week 9: Big-Oh of polynomials, non-polynomials, limits

Lecture slides

Week 10: Big-Omega, big-Theta, general properties

Lecture slides

Week 11: Halting problem, computability

No lecture

Week 12: Computability, review

Lecture slides

© 2014 Larry Yueli Zhang All Rights Reserved