Reread Section 12.6 and do the Exercise 1ĭo the problems on the worksheet: ( worksheet, solutions) Reread Section 12.5 and do the Exercises 1, 3, 5 ( even solutions, video) Reread Section 12.4 and do the Exercises 1, 3, 5, 7 ( even solutions, video) Reread Section 12.2 and do the Exercises 1, 3, 5, 7, 11 ( even solutions, video) Reread Section 12.1 and do the odd Exercises ( even solutions, video) Read Chapter 12 of Book of Proof (20 pages) Quiz: Monday April 13, based on your understanding of the following work. Topics: Surjections, injections, inverses, composition, important functions in computer science (including modular reduction, “division algorithm”, floor, ceiling). YouTube: Relations between two sets (6:39) YouTube: Relations and their Inverses (2:48) YouTube: Reflexive, Symmetric, and Transitive Relations on a Set (6:53) YouTube: You need to check EVERY spot for reflexivity, symmetry, and transitivity (3:39) YouTube: Equivalence Relations (4:35) YouTube: How to Prove a Relation is an Equivalence Relation (8:17) Reread Section 11.3 and do Exercises 1, 3, 5, 7. Reread Section 11.1 and do Exercises 1, 3, 5, 7, 10. Read Chapter 11 of Book of Proof (22 pages) Quiz: Monday April 6, based on your understanding of the following work. Topics: Reflexivity, symmetry, transitivity, equivalence relations. Quiz: Friday March 20, based on your understanding of the following work.īook of Proof textbook My notes Module: Relations (1 week) Topics: Implication (including converse, inverse, contrapositive), structure of formal proofs, direct proof, proof by contradiction, proof by induction, counterexamples. Quiz: Wednesday March 4, based on your understanding of the following work. Topics: Boolean algebra, logic gates and combinational circuits, circuit design methodology, normal forms, reduction to nor/nand gates, circuit minimization, Karnaugh maps (including don’t care). Quiz: Friday February 21, based on your understanding of the following work.īook of Proof textbook Logical equivalents Logical inferences My notes (logic) My notes (quantifiers) Module: Digital Logic (1.5 weeks) Topics: Propositional logic, logical connectives, truth tables, valid arguments (including modus ponens and modus tollens), logical equivalence, universal and existential quantification. Quiz: Friday February 7, based on your understanding of the following work.īook of Proof textbook My notes Module: Logic (2 weeks) Topics: Notations (including “set-builder”), basic operations, Venn diagrams, Cartesian products, power sets, cardinality, countability, common numerical sets. Quiz: Wednesday January 29, based on your understanding of the following work.įloating-point representation Slides Floating point visualizer (external link) Module: Sets (1.5 weeks) Topics: Discrete structure definition and IEEE floating point representation as an example (including range, precision, and error). Scores so far (updated 5/12 2pm) Course information Module: Introduction (0.5 weeks) CSC 28 – Discrete Structures for Computer Science Quick Links
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |