Discrete Math Structures

Discrete Math Structures
Course Number: 
Math 2320

Textbook:
Discrete Mathematics (5th edition) by Kenneth A. Ross and Charles R. B. Wright

Grading Policy

  • Homework assignments: 25 points
  • Two hourly exams: 100 points each
  • Final Exam: 200 points
  • Total: 425 points

Sections Covered

  • 1.1: Some Warm-Up Questions
  • 1.2: Factors and Multiples
  • 1.3: Some Special Sets
  • 1.4: Set Operations
  • 1.5: Functions
  • 1.6: Sequences
  • 1.7: Properties of Functions
  • 2.1: Informal Introduction
  • 2.2: Propositional Calculus
  • 2.3: Getting Started with Proofs
  • 2.4: Methods of Proof
  • 3.1: Relations
  • 3.2: Digraphs and Graphs
  • 3.3: Matrices
  • 3.4: Equivalence Relations and Partitions
  • 3.5: The Division Algorithm and Integers Mod p
  • 4.1: Loop Invariants
  • 4.2: Mathematical induction
  • 4.3: Big-Oh Notation
  • 4.4: Recursive Definitions
  • 4.5: Recurrence Relations
  • 4.6: More Induction
  • 5.1: Basic Counting Techniques
  • 5.2: Elementary Probability
  • 5.3: Inclusion-Exclusion and Binomial Methods
  • 6.1: Graphs
  • 6.2: Edge Traversal Problems
  • 6.3: Trees
  • 6.4: Rooted Tress
  • 6.5: Vertex Traversal problems
  • 6.6: Minimum Spanning Trees