Teaching in Spring 2022: [CSE 2321] Foundations I – Discrete Structures
| Class | Class Title | Days & Times | Room |
| CSE 34444 | Fndns 1: Discr Str (Lecture) | MoWeFr 10:20AM – 11:15AM | CH0312 |
| CSE 25610 | Fndns 1: Discr Str (Lecture) | MoWeFr 12:40PM – 01:35PM | CH0312 |
|
Course Description: Propositional logic, Boolean algebra, first-order logic, sets, functions, basic proof techniques, graphs and trees, analysis of algorithms, asymptotic analysis, combinatorics, graph algorithms. Course Syllabus (Click Here) which also includes a tentative schedule, and topics covered. Text: Introduction to Algorithms, 3rd edition, by Cormen, Leiserson, Rivest, and Stein, The MIT Press. Additional resources/books may be added during the semester. The following lecture notes were written by my former student Sery Gunawardena in Fall 2019.
HW1 Soln: 1. (i) 2. (ii) 3. (i) 4. (i) 5. (i) 6. (ii) 7. (ii) 8. (iv) 9. (iv) 10. (iii). HW2 Soln: 1. (ii) 2. (iii) 3. (iii) 4. (iv) 5. (i) 6. (i) 7. (iii). HW3 Soln: 1. (iii) 2. (iv) 3. (iv) 4. (ii) 5. (iii). HW4 Soln: 1. (iii) 2. (i) 3. (iii) 4. (i) 5. (i). HW5 Soln: 1. (ii) 2. (i) 3. (iii) 4. (i) 5. (i). HW6 Soln: 1. (i) 2. (ii) 3. (iv) 4. (iii) 5. (iv). HW7 Soln: 1. (iv) 2. (iii) 3. (iv) 4. (iii) 5. (iii). HW8 Soln: 1. (ii) 2. (i) 3. (iii) 4. (iv) 5. (ii). HW9 Soln: 1. (ii) 2. (iii) 3. (iv).
WorkSheet 0 | Practicing for Exam 1 WorkSheet 1 | Practicing for Exam 2 WorkSheet 2 | Practicing for Exam 2 WorkSheet 3 | Practicing for Exam 2 WorkSheet 4 | Practicing for Exam 2 WorkSheet 5 | Practicing for Exam 2 Required reading: The MIT open courseware: “Logic”. – Handout #1: An example on analyzing nonrecursive programs.
– Handout #2: Common Recursive Algorithms.
– Handout #3: Comparing two representations of a graph.
– Handout #4: The breadth-first search algorithm.
– Handout #5: The depth-first search algorithm.
Graders Information (Names, Emails, Office Hours):
The office location for all graders is BE406. |