|Chapters||Topics||Algorithms and extra||Codes||Annoucements|
|Week 1||Chap 2.1-2.4||Python basics: numeric data types, strings, variables, IDLE.|| IDLE
|Week 2|| Chap 3.1-3.3;
| Intro to algorithms,
| Computing/approx square/cubic root.
|| Lecture 3
|Week 3||Chap 4.1-4.2||Functions in Python.||
Bisection method (read this and this).
|Week 4|| Chap 3.4
| Algorithmic complexity;
Python structured types: tuples and lists.
Horner's method (read this).
| Horner's method
Bisection with Horner
(Due Feb 5th, 5pm)
|Week 5||Chap 3.5.||Root-finding algorithms.||Newton's method (read this and animations).||Newton's method
|Week 6||Chap 4.3|| More numerical algorithms;
|Numerical diff. (read this);
Secant method (read this and animations);
Factorial, Fibonacci sequence (read this);
binomial coefficients (read this).
|Week 7||Floating-point numbers|| Floating point numbers (read this and this);
||Floating-point numbers||Assignment 2
(Due Feb 26th, 5pm)
|Week 8||Chap 15/16|| Random number generator;
| Coin flipping;
Birthday paradox (read this);
Monty hall problem (read this).
|Week 9 (spring break)|
|Week 10||Solution to mid-exam||Assignment 3
(Due Mar 21, 5pm)
|Week 11||Topics in number theory||Detecting primes (read this);
Sieve of Eratosthenes (read this);
Euclidean algorithm (read the procedure).
|Week 12|| Topics in number theory
| Modular arithmetic (read this);
Trial division (read this);
Pollard's rho method (read this);
Pollard's rho method.
|Week 13||Chap 10||Search and sort .|| Binary search (try this);
Selection and merge sort (read this and this).
(Due Apr 5th, 5pm)
|Week 14||Chap 12||Topics in cryptography||0-1 Knapsack Problem (read this);
Meet-in-the-middle attack (read this).
|0-1 Knapsack.||Quiz 7 (Wed)|
|Week 15||Review sessions||Quiz 8 (Wed)|
|Exam week (April 26 – May 2)|