• CRN 20730 Course Administration

Assignments

• Assignments
• Assignment Submission Instructions
• Assignment Template pdf
• Assignment Template (MS Word)
• Assignment Example pdf
• Assignment Example (MS Word)
• Assignment a12

Projects Submission Instructions

• Project Creation Instructions
• Project Submission Instructions
• p01 Project Template pdf
• p01 Project Template (MS Word)
• p02 Project Template pdf
• p02 Project Template (MS Word)
• p03 Project Template pdf
• p03 Project Template (MS Word)
• p04 Project Template pdf
• p04 Project Template (MS Word)
• p05 Project Template pdf
• p05 Project Template (MS Word)

Projects

• p01: Tautology
• p02: Cartesian Product
• p03: Code Fragment 3 Time Complexity
• p04: Code Fragment 4 Time Complexity
• p05: Code Fragment 5 Time Complexity

Project p02

• p02.cpp
• List02.h
• List02.cpp
• p02make

Reports

• r01 Library research
• Report Template pdf
• Report Template download

Tests

• Test 3, Version 1, Spring 2019

Lectures

• L000: Administrative Overview
• L000: Administrative Overview youtube
• L001: Course Overview
• L001: Course Overview youtube
• L002: Rosen, 1.1 Propositional Logic
• L003: Rosen, 1.2 Applications of Propositional Logic
• L004: Rosen, 1.3 Propositional Equivalences
• L005: Rosen, 1.4 Predicates and Quantifiers
• L006: Rosen, 1.5 Nested Quantifiers
• L007: Rosen, 1.6 Rules of Inference
• L008: Rosen, 1.7 Introduction to Proofs
• L009: Rosen, 2.1 Sets
• L010: Linux Survival
• L011: p01 overview
• L012: Rosen, 2.2 Set Operations
• L013: Rosen, 2.3 Functions
• L014: Project p02 Overview
• L015: Rosen, 2.4 Sequences and Summations
• L016: Time Complexity: T(n), Counting the Cost
• L017: Time Complexity: T(n), Examples
• L018: Validating T(n)
• L019: Project p03 Overview
• L020: O(f(n)), Omega(g(n)), Theta(f(n))
• L021: O(f(n)), Omega(g(n)), Theta(f(n)) Examples
• L022: Rosen, 4.1 Divisibility and Modular Arithmetic
• L023: Rosen, 4.2 Integer Representation and Algorithms
• L024: Rosen, 4.3 Primes and the Greatest Common Divisor
• L025: Rosen, 4.4 Solving Congruences
• L026: Rosen, 4.4 Applications of Congruences
• L027: Rosen, 4.6 Cryptography
• L028: Rosen, 5.1 Mathematical Induction
• L029: Rosen, 5.2 Strong Induction and Well-Ordering
• L030: Rosen, 5.3 Recursive Definition and Structural Induction
• L031: Rosen, 5.4 Recursive Algorithms
• L032: Rosen, 6.1 The Basics of Counting
• L033: Rosen, 6.2 The Pigeonhole Principle
• L034: Rosen, 6.3 Permutations and Combinations
• L035: Rosen, 6.4 Binomial Coefficients and Identities
• L036: Rosen, 6.5 Generalized Permutations and Combinations