CS 23022 Section 600
Discrete Structures for Computer Science
Spring 2009
TR 5:30 PM - 6:45 PM - Room MH 219|
|
- IMPORTANT: Read here what Plagiarism is and the Sanctions
The Course
| Month/Day | Weekday | Topic | Reading | Class Slides | Assignments and Deadlines | |
| 1 |
Jan 20 | T |
Introduction to the Course - Sets |
Reading ahead is required in this class. Ch. 1 pp.1-13 |
Syllabus Slides | All
the HW are due by the next class unless stated otherwise. HW1 pp.13 n.1 (a,b,d,g) n.2, n.4(a,b,d), n.6 (b,d) |
| 2 | Jan 22 | R | Sets and Operations | Ch. 1 pp.15-22 | HW2(a) - pp. 31 n.1(a,b,c), n.7 | |
| 3 |
Jan 27 | T |
Sets and Operations | Ch. 1 pp.22-25 and p.28 |
HW2(b) - pp.31, n.3 (a),
n.13 (a, b, c, f, i, k)
|
|
| 4 |
Jan 29 | R |
Proof Templates - Logic - Lattice | Ch. 1 pp.25-31 |
|
|
| 5 |
Feb 3 | T |
The principle of Inclusion | Ch. 1 pp.34-41 | HW3 pp. 42 n.1, 5 |
|
| 6 |
Feb 5 | R |
Mathematical Induction | Ch. 1 pp. 45-53 |
HW4 pp. 62 n.10 pp.63 n.13, 15(a, b), 19(a) |
|
| 7 |
Feb 10 | T |
Practice (HW4 in class) |
|
||
| 8 | Feb 12 | R | More problems that require the use of Mathematical Induction - Strong Form of Mathematical Induction | Ch.1 pp.66-79 | ||
|
9 |
Feb 17 |
T |
Practice | |||
| 10 |
Feb 19 | R |
Exam 1 (Ch1) | |||
| 11 |
Feb 24 | T |
Formal Logic: Propositional Logic | HW5 pp. 99 n.1(a,b,c,f), 2(a, b, c), n.6 (b, c, e) n.9(b), 13(a,b) | ||
| 12 |
Feb 26 | R |
Truth and Logical Truth | HW6 pp 117, n, 4, 7, 9, 10(b,e), 14(a,c), 17(a,b,c) | ||
| 13 |
Mar 3 | T |
Normal Forms |
|||
| 14 |
Mar 5 | R |
Predicates and Quantification | For 0.2 points Extra Credit do the HW assigned in class today |
Optional HW for E.C. Section 2.6 ex. 2(b,d), 4(a,b), 5(d,e,f) Section 2.8 ex. 1, 5(a,c,f,g), 7(b,c,d) |
|
| 15 |
Mar 10 | T |
Exam 2 (Ch 2) has been moved
to Mar 12 Review and Practice |
|||
| 16 |
Mar 12 | R |
Exam 2 (Ch 2) | |||
| 17 |
Mar 17 | T |
Relations: Definitions and Operations. Special Types of Relations | Read page 155-172 of your book. | HW7 pp166-167 ex. 1(b,d), 2, 3(a,b), 6(a,c), 7(a,c,e), 8(b,c), 11(a). (due Mar 31) | |
| 18 |
Mar 19 | R |
Closures. Equivalence Relations | Read page 172-176 and pp.181-183 of your book. | HW8 pp178 Ex. 1(a,c,e), 2(a,c,e),
3(a,c), 4(a,c), 6, 7, 10, 12, 16(b,d) pp189 2(b,d,e), 4, 5. |
|
| Mar 23-29 | Spring Recess | |||||
| 19 |
Mar 31 | T |
Partitions and Equivalence Classes | Read page 183-186 of your book. | ||
| 20 |
Apr 2 | R |
Partial Ordering | Read page 186-199 of your book. | HW9 pp.189 Ex.12-14, pp201 Ex 1, 2, 7, 9 | |
| 21 |
Apr 7 | T |
Review and Practice | |||
| 22 |
Apr 9 | R |
Exam 3 (Ch.3) | |||
| 23 |
Apr 14 | T |
Functions | Read page 219-228 of your book. | HW10 pp.239
ex.1, 4, 6(b,c) Do not return - solved in class |
|
| 24 |
Apr 16 | R |
1-1, Onto and Bijective Functions, Increasing and Decreasing Functions | Read page 228-239 of your book. |
HW11 pp.239 ex. 7, 9, 10,
12(a, c), 15 Do not return - solved in class |
|
| 25 |
Apr 21 | T |
Operation on Functions - Sequences and Subsequences | Read page 243-250 of your book. | HW12 pp. 251 n.2, 3, 5, 6, 10(a) | |
| 26 |
Apr 23 | R |
Analysis of Algorithms | Read page 284-289 of your book (excluded section 5.1.2) | HW13 pp. 296 n.1, 2, 8(a), 9(a) | |
| 27 |
Apr 28 | T |
Intro to Graph Theory –Path and Cycles | Read page 331-338; 340-344 of your book | HW14 pp. 348 n. 2(a, c, e), 3(a), 16, 23(first graph only) | |
| 28 |
Apr 30 | R |
Graphs Isomorphism - Graph Representation - Directed Graph - Trees | Read page 345-347 and 370-372 and 393-394 of your book | HW15 pp. 348 n. 27, 35 | |
| 29 | May 5 | T | Binary Trees - Binary Search Tree - Tree Traversal - Huffman code | Read page 378-387 of your book | HW16 pp391 n.19, pp.412 n.6, pp.419 n.8 | |
| 30 | May 7 | R | Review and Practice | |||
| 31 |
May 14 |
R |
6:00 pm - 8:00 pm
- room MH 219 Final Exam |
Remember.....
this page is constantly
under construction and modification...
check it often for updates!!!
