Review: Topics covered in pages 1-42. 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
Due Fri Feb.2, Day 3
1.4 p.55 1,3,7,11,16,18,24,27,30,33
# systems, adding, 2's complement,
Hex
Due Wed. Feb. 7, Day 5
1.5 p.74
(review, don't hand in
1,4,7,13) 21abc, 23, 26, 27, 31, 32, 33, 35, (37) ,41
Set th. as Boolean alg (read 5.3 p.
286-290)
Was due Fri. Feb 9, Day 6
5.3 p.292
48, 49, 50 (these are fill-in-the blanks, & you can probably
do them now) , 51, 52, 54,
55, (57),
Read 58&solutions, do 58a(v), c. Note that 0=False, 1=True gives
the logic system of Ch. 1.
Mod. arithmetic
Due Wed. Feb 14, Day 8
3.4 p.163 13,14, 16& draw a
picture like p.157 to show n/d and n%d, (22hint: first find answers if
the matrix elements are labeled starting with 0--like C++,Pascal
arrays)
, 24, 25, 27, 28, 37, (45&read 44)
Floor & ceiling
Due Wed. Feb. 21, Day 11
3.5 p.170
1,3,5,7,9,(10),13,14,15,16,24
Algorithms (Euclidean) loop trace, trace
table. Read 3.8, and 5.1
pp. 266-7 Due Wed. Feb. 28, Day 14
3.8 p.196
1,3,5,6,9,13,15, 17,19,21, 25,27 5.1
p. 267 31, 32
Exam 1 covers above here.
Correctness of Algorithms (loop invariants, pre&post
conditions)
("asserts") Due Wed. Mar. 7, Day 17 (but I'll take
it late, Friday, if you like.)
4.5 p.253 1,3,4,
6(correction:Postcondition: exp = xm and i = m), 8
Graphs: intro
Should have been due Mon. Mar. 12, Day 19, but now due Wed. Mar. 14 due
to all the absences.
11.1 p.649
1,3,5,8,10,12,17,18,19,24a,b,25,28,31,(33),36,37a,b
Paths&Circuits (Euler, Hamilton)
Due Wed. Mar. 28, Day 23
11.2 p.679
1,3,4,8a,d,9,12,14,18,19,20,23,25,38,42,45
Representation of Graphs as Matrices.
Due Fri. Mar. 30, Day 24
11.3 p.695 2,3,4,6,(15),19
Isomorphisms of Graphs
Due Fri. Apr. 6, Day 27
11.4 p.703 1,2,5,7,8,11,14,16,21,22, read
sol of 23, 27,30
Trees
11.5 p.721
2a,4,7a,8,9,11,13,25,27,30,32,34,36,38,39,42,51
Spanning Trees, Weighted Graphs
11.6 p.732 1,5,7,9,12,13,16,20,23
Recursively Defined Sequences
8.1 p.472 1,3,7,9,11,15,18,34,37,39
Solving Recurrence Relations by Iteration
All due some time or other....
8.2 p.485
1,2a,b,c,3,5,10,18,20,24,27,30,35,50,53
2nd order... Recurrence Relations
Due Wed. May 2, Day 38
8.3 p.498 1,3,5,7,8,11,13,16,19,25
Next:
O-notations and efficiency of algorithms, Ch. 9
Assignments on MoreAssts link
**
Cardinality & Computability (read 7.5 pp. 453-4)
7.5 p.455 (36)
Russell's Paradox, Halting
5.4 p.296 1,2,4,5,7.9,11
** Some thing(s) from the following list: (MoreAssts link for HW when we get
here.)
Formal languages 12.1
Finite state Automata
12.2, 3
?Equivalence relations 10.3 Done, Discrete I
Modular arithmetic with applications to Cryptography 10.4
Partial order relations 10.5
O-notations and efficiency of algorithms, Ch. 9