Lecture Presentations
Class No. Date Slides Code Last Updated Topics
1 30 Oct PDF PDF 27 Oct Course administration; Python basics
2 2 Nov PDF Executions in class:
txt TXT
10:00 12:00
2 Nov Python basics (conditionals, iteration, lists)
3 6 Nov PDF PY PY 5 Nov lists, functions, memory model
4 9 Nov PDF PY PY PY 9 Nov more on functions; number representation
5 13 Nov PDF PY PY PY 12 Nov Fast Exponentiation; Binary Search
6 16 Nov PDF PY PY PY 16 Nov (fixed merge_by_sort) Basic algorithms and their complexity: Search ; Sort and Merge. Complexity and the O notation.
7 20 Nov PDF PY PY 20 Nov Complexity continued; Higher Order Functions and Lambda Expressions; Numeric Derivative and Integral; Floating Point Arithmetic.
8 23 Nov PDF
PDF
PY Executions in class:
txt TXT
10:00 12:00
23 Nov Newton Raphson Method

Intermediate summary, Software testing, code styling.
9 27 Nov PDF PY PY 27 Nov Recursion
10 30 Nov PDF PY PY Executions in class:
txt TXT
10:00 12:00
29 Nov Recursion 2: Mergesort, memoization
11 4 Dec PDF PY 4 Dec Recursion (cont.), randomness
12 7 Dec PDF PY
Executions in class:
txt TXT
10:00 12"00
6 Dec Number theoretic algorithms: Factoring by trial division; Probabilistic primality testing. Diffie Hellman key exchange
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License