Discrete Structures

Course Page

Course Schedule and Lecture Slides

  • Week 1

    • Introduction

    • Propositional Logic

  • Week 2:

    • Propositional Logic (Continuation)

    • Equivalence Laws and Quantifiers

  • Week 3:

    • Arguments ( Simple Propositions)

    • Arguments (Quantified Statements)

  • Week 4:

    • Sets

    • Set Operations

  • Week 5:

    • Sequences

    • Functions

  • Week 6:

    • Review

    • Exam 1

  • Week 7:

    • Mid-Fall Recess! October 5-6

    • Proofs

  • Week 8:

    • Mathematical Induction

    • Recursion

  • Week 9:

    • Number Theory

    • Cryptography

  • Week 10:

    • Cryptography (Continued)

    • Linear Programming (Basic)

  • Week 11:

    • Counting

    • Counting Problems

  • Week 12:

    • Recurrence Relation

    • Graphs

  • Week 13:

    • Student Presentations

    • Student Presentations

  • Week 14:

    • Student Presentations

    • Student Presentations

  • Week 15:

    • ThanksGiving Break!

  • Week 16:

    • Final Review

    • Final Review

  • Final Exam



Course Syllabus (PDF)

Assignments and Hands-on Experiments

  • Assignments:

    • Due in two weeks

    • In class submission

  • Hands-on Experiment

    • Due in two weeks

    • Online Submission

Grading

  • Assignments: 10%

  • Hands-on: 25%

  • Student Presentations: 20%

  • Exams:

    • Exam 1: 20%

    • Final Exam: 20%

  • Class Participation: 5%

  • Grading Policy:

    • A 90% and above

    • A- 87 - 89%

    • B+ 84 - 86%

    • B 78 - 83%

    • B- 75 - 77%

    • C+ 72 - 74%

    • C 63 - 71%

    • C- 60 - 62%

    • D+ 57 - 59%

    • D 52 - 56%

    • D- 50 - 51%

    • F - Below 50%

Text

  • Discrete Mathematics and Its Applications, Kenneth H. Rosen, (Seventh Edition) McGraw-Hill, 2012, ISBN 0073383090.


Reading