CSCI246, Fall 2021

The most updated information for this course is on Moodle.

Week | Date | Topic | Readings | Posted Materials |
---|---|---|---|---|

1 | Aug. 23 | Course Overview, Propositions & Propositional Operators | Section 1.1 | |

Aug. 25 | Compound Propositions & Conditional Statements | Sections 1.2 & 1.3 | ||

Aug. 27 | Logical Equivalence & Propositional Laws | Sections 1.4 & 1.5 | ||

2 | Aug. 30 | Predicates & Quantifiers | Sections 1.6 & 1.7 | |

Sept. 1 | De Morgan's Quantified Statements & Nesting Quantifiers | Sections 1.8 & 1.9 | ||

Sept. 3 | Nested Quantifiers & Logical Reasoning | Sections 1.10 & 1.11 | ||

3 | Sept. 6 | Inference Rules with Propositions | Section 1.12 | |

Sept. 8 | Review for Exam | |||

Sept. 10 | Exam 1 | |||

4 | Sept. 13 | Labor Day - No Class | ||

Sept. 15 | Inference Rules with Quantifiers | Section 1.13 | ||

Sept. 17 | Mathematical Definitions & Introduction to Proofs | Section 2.1 & 2.2 | ||

5 | Sept. 20 | Best Practices and Common Errors in Proofs | Section 2.3 | |

Sept. 22 | Writing Direct Proofs | Sections 2.4 | ||

Sept. 24 | Proof by Contrapositive & Proof by Contradiction | Sections 2.5 & 2.6 | ||

6 | Sept. 27 | Sets, Subsets, Sets of Sets, Union & Intersection | Sections 3.1, 3.2 & 3.3 | |

Sept. 29 | Review for Exam | |||

Oct. 1 | Exam 2 | |||

7 | Oct. 4 | More Set Operations & Set Identifies | Sections 3.4 & 3.5 | |

Oct. 6 | Cartesian Products & Partitions | Sections 3.6 & 3.7 | ||

Oct. 8 | Function Defintions & Floor & Ceiling Functions | Sections 4.1 & 4.2 | ||

8 | Oct. 11 | Properties of Functions, Inverse & Composition of Functions | Sections 4.3, 4.4 & 4.5 | |

Oct. 13 | Graphs Introduction & Representation | Sections 13.1 & 13.2 | ||

Oct. 15 | Sequences, Recurrence Relations & Summations | Section 8.1, 8.2 & 8.3 | ||

9 | Oct. 18 | Mathematical Induction & Inductive Proofs | Sections 8.4 & 8.5 | |

Oct. 20 | Strong Induction | Section 8.6 | ||

Oct. 22 | Recursive Definitions | Section 8.8 | ||

10 | Oct. 25 | Structural Induction | Section 8.9 | |

Oct. 27 | Review for Exam | |||

Oct. 29 | Exam 3 | |||

11 | Nov. 1 | Recursive Algorithms | Section 8.10 | |

Nov. 3 | Using Induction to Prove Correctness of Recrusive Algorithms | Section 8.11 | ||

Nov. 5 | Sum Rule, Product Rule (Counting Functions) Bijections & Generalized Product Rule | Sections 10.1, 10.2 & 10.3 | ||

12 | Nov. 8 | Counting Permutations & Combinations (Subsets) | Sections 10.4, 10.5 & 10.6 | |

Nov. 10 | Binomial Coefficients | Section 11.2 | ||

Nov. 12 | Pigeonhole Principle | Section 11.3 | ||

13 | Nov. 15 | Binary Relations, Properties of Relations, Directed Graphs & Composition of Relations | Sections 6.1, 6.2, 6.3, & 6.4 | |

Nov. 17 | Vetran's Day - no class | |||

Nov. 19 | Transitive Closure & Equivalence Relations | Sections 6.5 & 6.9 | ||

13 | Nov. 22 | |||

Nov. 24 | ||||

Nov. 26 | ||||

14 | Nov. 29 | Review for Final | ||

Dec. 1 | ||||

Dec. 3 | ||||

Finals | Dec. 6 | Final Exam, Wednesday 8:00am-10:00am (11:00am if needed) |