| home page - course objectives - practical info - handouts - lab exercises - LaTeX sources - Mike Jacobson - Renate Scheidler - links |
| Handouts |
Practice Final exam: PostScript, PDF.
Proof that CLIQUE is in NP: PostScript, PDF.
Proof that CLILQUE reduces to SI: PostScript, PDF.
Practice midterm: PostScript, PDF.
Proof of correctness for FFT: PostScript, PDF.
Inductive proofs of asymptotic bounds for a recurrence:
Example 1
PostScript,
PDF; Example 2
PostScript,
PDF.
Bounding sum example: PostScript, PDF.
Sample algorithm analysis for Assignment 1: PostScript, PDF.
Aymptotic notation example (log base 2 vs. natural log): PostScript, PDF.
Asympotic notation definitions and main results: PostScript, PDF.
Math formulas for CPSC 413: PostScript, PDF.
Math Review Handout #1: Logarithms, Exponents, and Derivatives: PostScript, PDF.
Math Review from Fall 2000: (CPSC 031)
|
This page last modified:
http://www.cpsc.ucalgary.ca/~jacobs/cpsc413/W05/handouts.html |