|
|
CS U200 |
|
|
Prof. Fell |
Fall 2004 |
|
|
|
|
|
reading |
csu200 |
|
| 1 |
|
September |
8 |
|
handouts |
intro, sets of numbers, field
axioms, variables and expressions algebra |
|
| 2 |
|
9 |
|
handout, Hein 316,317 |
linear functions, polynomials,
Horner's method |
|
|
10 |
|
|
On-line homework 1 is due |
| 3 |
|
13 |
|
handout, Hein 85 |
exponentials and logs |
|
| 4 |
|
15 |
|
handout, Hein 2.1.2 |
n!, floor, ceil, |x|, (step
functions, sin, cos, tan) |
|
| 5 |
|
16 |
|
Hein 2.1.2 |
mod, div, division algorithm |
|
|
17 |
|
|
On-line homework 2 is due |
| 6 |
|
20 |
|
Hein 2.1.2 |
Euclidean algorithm, gcd, lcm |
|
| 7 |
|
22 |
|
|
prime factorization |
Written Homework 1 is due |
| 8 |
|
23 |
|
Hein 82 |
modular arithmetic, +, x tables,
inverses, zero-divisors |
|
|
24 |
|
|
On-line homework 3 is due |
| 9 |
|
27 |
|
catch up and review |
|
| 10 |
|
29 |
|
EXAM 1 |
|
| 11 |
|
30 |
|
Go over exam |
|
|
October |
1 |
|
|
On-line homework 4 is due |
| 12 |
|
4 |
|
Hein 2.3.4, 10.5.2 |
applications of mod |
|
| 13 |
|
6 |
|
Hein 85 |
number representations: binary,
octal, hex |
|
| 14 |
|
7 |
|
Hein 180, 5.2.1, 4.4.15.2.1 |
sequences |
Written Homework 2 is due |
|
8 |
|
|
On-line homework 5 is due |
| |
11 |
|
|
Columbus Day |
|
| 15 |
|
13 |
|
sums |
|
| 16 |
|
14 |
|
|
more sums, proof by induction |
|
|
15 |
|
|
On-line homework 6 is due |
| 17 |
|
18 |
|
|
review |
|
| 18 |
|
20 |
|
|
EXAM 2 |
|
| 19 |
|
21 |
|
Hein 5.3.1 |
more sums, proof by induction |
|
|
22 |
|
|
|
| 20 |
|
25 |
|
Hein 5.3.1 |
more sums, proof by induction |
On-line homework 7 is due |
| 21 |
|
27 |
|
Hein 1.2.1 |
sets: set builder notation,
subsets |
|
| 22 |
|
28 |
|
Hein 1.2.2, 1.2.3 |
set operations, Venn diagrams |
|
|
29 |
|
|
On-line homework 8 is due |
| 23 |
|
November |
1 |
|
1.3.1 |
tuples, Cartesian product, power
set |
|
| 24 |
|
3 |
|
Hein 5.3.2 |
counting: combinations |
Written Homework 3 is due |
| 25 |
|
4 |
|
Hein 2.3.3 |
counting: pigeonhole principle |
|
|
5 |
|
|
On-line homework 9 is due |
| 26 |
|
8 |
|
Hein 5.3.3 |
counting: applications |
|
| 27 |
|
10 |
|
|
discrete probability |
|
| |
11 |
|
|
Veteran's Day |
|
|
12 |
|
|
On-line homework 10 is due |
| 28 |
|
15 |
|
Hein
1.3.4 |
relations and functions on
finite and infinite sets |
|
| 29 |
|
17 |
|
Hein 2.3.1, 2.3.2 |
onto and 1-1 functions |
|
| 30 |
|
18 |
|
|
review |
|
|
18 |
|
|
On-line homework 11 is due |
| 31 |
|
22 |
|
|
EXAM 3 |
|
| 32 |
|
24 |
|
|
NO CLASS |
|
| |
25 |
|
|
Thanksgiving |
|
|
|
|
| 33 |
|
29 |
|
Hein 1.4 |
Graphs and Trees |
|
| 34 |
|
December |
1 |
|
Hein 1.4 |
More Graphs and Trees |
Written Homework 4 is due |
| 35 |
|
2 |
|
Hein 3.1.4 |
Binary Trees |
|
|
3 |
|
|
On-line homework 12 is due |
| 36 |
|
6 |
|
Hein 3.2.4 |
Traversing Binary Trees |
|
| 37 |
|
8 |
|
|
review |
|
|
|
|
|
|
|
|
|
Last Updated: October 26, 2004 6:26 p.m. by