Review: Topics covered in pages 1-39. Front flyleaf "LOGIC", Back flyleaf "LOGIC", "SUMS." You will need to review other topics as we proceed. Use the text's Index. New reading is given here--the whole section unless otherwise noted..
Circuits
1.4 p.55 1,3,7,11,16,18,24,27,31,33
# systems, addressing, 2's complement
1.5 p.74 19,20,23,24,28,29,30,32,(34)
Set th. as Boolean alg (read 5.3 p. 266)
5.3 p.268 48a,b,c,d(i)
Mod. arithmetic
3.4 p.146 13,14,(16),22,(24),25,33
Floor & ceiling
3.5 p.153
1,3,5,7,9,(10),13,14,15,16,24
Algorithms (Euclidean) loop trace, trace table
3.8 p.177
1,3,5,6,812,13,15,17,19,24,26
p. 243 21, 22
Correctness of Algorithms (loop invariants, pre&post conditions)
4.5 p.229 1,3,4,6,8
Formal languages (examples of functions, partitions) (read 5.1
p. 239-41)
5.1 p.243
19a,c,e,20,
p.268 39, p.355
13,
p. 386 20,21
Cardinality & Computability (read 7.6 pp. 420-22)
7.6 p.423 (28)
Russell's Paradox, Halting
5.4 p.271 1,2,4,5,6,8,10
Finite state Automata
7.2 p.367
1,2,7,8,10,12,17,20,22,27,28,(30),(31)
Graphs: intro
11.1 p.616
1,3,5,8,10,12,17,18,19,24a,b,25,28,31,(33),36,37a,b
Paths&Circuits (Euler, Hamilton)
11.2 p.636
1,3,4,8a,d,9,12,14,18,19,20,23,25,38,42,45
Matrix Multiplication, Representation of Graphs
11.3 p.654 2,3,4,6,(15),19
Isomorphisms of Graphs
11.4 p.662 1,2,5,7,8,11,14,16,21,22, read
sol of 23, 27,30
Trees
11.5 p.681
2a,4,7a,8,9,11,13,25,27,30,32,34,36,38,39,42,51
Spanning Trees, Weighted Graphs
11.6 p.692 1,5,7,9,12,13,16,20,23
O-notation (Read 9.1 as prep: nothing should be new)
9.2 p.493
2,3,7,11,13,14,17,21,23,26,27,37,read
39 and 40
Efficiency of algorithms, esp. sorts
9.3 p.502 1,2,4,6,8,10,15,17,20,22
Recursively Defined Sequences
8.1 p.438 1,3,7,9,11,15,18,29,32,34
Solving Recurrence Relations by Iteration
8.2 p.451
1,2a,b,c,3,5,10,15,17,21,23,26,31,41,44
2nd order... Recurrence Relations
8.3 p.464 1,3,5,7,8,11,13,16,19,25