CS 242, Section 002 Sonoma State University Spring, 2026
 
Discrete Structures for Computer Science
Instructor: Henry M. Walker

Lecturer, Sonoma State University
Professor Emeritus of Computer Science and Mathematics, Grinnell College

Notes:


Tentative Class Schedule

Tuesday Thursday
January 27 Getting Started
  • Introductions
  • Quick Course Overview
  • Home Page / Syllabus / Schedule
  • Clicker set up
  • Status Check—where are we really?

Unit 1: Logic and Proof
  • 1.1 Propositions and Logical Operations
  • 1.2 Evaluating Compound Propositions
  • 1.3 Conditional Statements
January 29 Unit 1: Logic and Proof
Readings for this Class:
  • 1.4 Logical Equivalence
  • 1.5 Laws of Propositional Logic

Before-Class Homework 1A
  • Participation Activities for this Class:
    • 1.4 Logical Equivalence
    • 1.5 Laws of Propositional Logic
  • Challenge Activities for this Class:
    • 1.1 Propositions and Logical Operations
    • 1.2 Evaluating Compound Propositions
    • 1.3 Conditional Statements
February 3 Unit 1: Logic and Proof
Readings for this Class:
  • 1.6 Predicates and Quantifiers
  • 1.7 Quantified Statements
  • 1.8 De Morgan's law for quantified statements
  • 1.9 Nested Quantifiers (up to, but not including, De Morgan's Law with Nested Quantifiers)

Before-Class Homework 1B
  • Participation Activities for this Class:
    • 1.6 Predicates and Quantifiers
    • 1.7 Quantified Statements
    • 1.8 De Morgan's law for quantified statements
  • Challenge Activities for this Class:
    • 1.4 Logical Equivalence
    • 1.5 Laws of Propositional Logic

Due: Assignment 1 (Propositions and Equivalence)
February 5 Unit 1: Logic and Proof
Readings for this Class:
  • 1.11 Logical Reasoning
  • 1.12 Rules of Inference with Propositions
  • 1.13 Rules of Inference with Quantifiers

Before-Class Homework 1C
  • Participation Activities for this Class:
    • 1.11 Logical Reasoning
    • 1.12 Rules of Inference with Propositions
    • 1.13 Rules of Inference with Quantifiers
  • Challenge Activities for this Class:
    • 1.6 Predicates and Quantifiers
    • 1.7 Quantified Statements
    • 1.8 De Morgan's law for quantified statements

In-class Quiz 1
February 10 Unit 1: Logic and Proof
Readings for this Class:
  • 2.1 Mathematical Definitions
  • 2.2 Introduction to Proofs

Before-Class Homework 1D
  • Participation Activities for this Class:
    • 2.1 Mathematical Definitions
    • 2.2 Introduction to Proofs
  • Challenge Activities for this Class:
    • 1.11 Logical Reasoning
    • 1.12 Rules of Inference with Propositions
    • 1.13 Rules of Inference with Quantifiers

Due: Assignment 2 (Predicates, Quantifiers, and Rules of Inference)
February 12 Unit 1: Logic and Proof
Readings for this Class:
  • 2.3 Best Practices and Common Errors in Proofs
  • 2.4 Writing Direct Proofs

Before-Class Homework 1E
  • Participation Activities for this Class:
    • 2.3 Best Practices and Common Errors in Proofs
    • 2.4 Writing Direct Proofs
  • Challenge Activities for this Class:
    • 2.1 Mathematical Definitions
    • 2.2 Introduction to Proofs
February 17 Unit 2: Sets, Functions, and Boolean Algebra
Readings for this week:
  • Elements of Sets (Chapter 3)
    • 3.1 Sets and subsets
    • 3.2 Sets of sets
    • 3.3 Union and intersection
    • 3.4 More set operations
    • 3.5 Set identities
    • 3.5 Cartesian products
Homework for this week:
Due : Assignment 3 (Proof Basics) (Submit pdf via email)
February 19 Unit 2: Sets, Functions, and Boolean Algebra
Readings for this week:
  • Elements of Sets (Chapter 3)
    • 3.1 Sets and subsets
    • 3.2 Sets of sets
    • 3.3 Union and intersection
    • 3.4 More set operations
    • 3.5 Set identities
    • 3.5 Cartesian products
Homework for this week:
In-class Quiz 2
February 24 Unit 1: Logic and Proof
Readings for this Class:
  • 2.5 Proof by Contrapositive
  • 2.6 Proof by Contradiction
  • 2.7 Proof by Cases

Before-Class Homework 1F
  • Participation Activities for this Class:
    • 2.5 Proof by Contrapositive
    • 2.6 Proof by Contradiction
    • 2.7 Proof by Cases
  • Challenge Activities for this Class:
    • 2.3 Best Practices and Common Errors in Proofs
    • 2.4 Writing Direct Proofs
February 26 Unit 2: Sets, Functions, and Boolean Algebra
Readings for this Class:
  • 4.1 Definitions of Functions
  • 4.2 Floor and Ceiling Functions
  • 4.3 Properties of Functions (i.e., 1-1, onto)

Before-Class Homework 1G
  • Participation Activities for this Class:
    • 4.1 Definitions of Functions
    • 4.2 Floor and Ceiling Functions
    • 4.3 Properties of Functions (i.e., 1-1, onto)
  • Challenge Activities for this Class:
    • 2.5 Proof by Contrapositive
    • 2.6 Proof by Contradiction
    • 2.7 Proof by Cases

Due: Assignment 4 (Sets and More Proofs)
March 3 Unit 2: Sets, Functions, and Boolean Algebra
Readings for this Class:
  • 4.4 The Inverse of a Function
  • 4.5 Composition of Functions
  • 4.6 Logarithms and Exponents

Before-Class Homework 2A
  • Participation Activities for this Class:
    • 4.4 The Inverse of a Function
    • 4.5 Composition of Functions
    • 4.6 Logarithms and Exponents
  • Challenge Activities for this Class:
    • 4.1 Definitions of Functions
    • 4.2 Floor and Ceiling Functions
    • 4.3 Properties of Functions (i.e., 1-1, onto)

In-class Quiz 3

Due: Assignment 5 (More Proofs)
March 5 Unit 2: Sets, Functions, and Boolean Algebra
Readings for this Class:
  • 5.1 An Introduction to Boolean Algebra
  • 5.2 Boolean Functions

Before-Class Homework 2B
  • Participation Activities for this Class:
    • 5.1 An Introduction to Boolean Algebra
    • 5.2 Boolean Functions
  • Challenge Activities for this Class:
    • 4.4 The Inverse of a Function
    • 4.5 Composition of Functions
    • 4.6 Logarithms and Exponents
March 10 Unit 2: Sets, Functions, and Boolean Algebra
Readings for this Class:
  • 5.6 Gates and Circuits

Before-Class Homework 2C
  • Participation Activities for this Class:
    • 5.6 Gates and Circuits
  • Challenge Activities for this Class:
    • 5.1 An Introduction to Boolean Algebra
    • 5.2 Boolean Functions

Due: Assignment 6 (Functions and Boolean Algebra)
March 12 Unit 3: Indexing Mathematical Elements and Induction
Readings for this Class:
  • 8.1 Sequences
  • 8.2 Recurrence Relations
  • 8.3 Summation

Before-Class Homework 2D
  • Participation Activities for this Class:
    • 8.1 Sequences
    • 8.2 Recurrence Relations
    • 8.3 Summation
  • Challenge Activities for this Class:
    • 5.6 Gates and Circuits
March 17 Unit 3: Indexing Mathematical Elements and Induction
Readings for this Class:
  • 8.4 Mathematical Induction

Before-Class Homework 3A
  • Participation Activities for this Class:
    • 8.4 Mathematical Induction
  • Challenge Activities for this Class:
    • 8.1 Sequences
    • 8.2 Recurrence Relations
    • 8.3 Summation

Due: Assignment 7 (Gates, Circuits, and Manipulating Indexed Mathematical Elements)
March 19 Test 1
March 24 Spring Break
Tuesday, March 24
March 26 Spring Break
Thursday, March 26
March 31 Farmworkers Day
SSU Campus Closed
Tuesday, March 31
April 2 Unit 3: Indexing Mathematical Elements and Induction
Readings for this Class:
  • 8.5 More Inductive Proofs
  • 8.6 Strong Induction and Well-ordering

Before-Class Homework 3B
  • Participation Activities for this Class:
    • 8.5 More Inductive Proofs
    • 8.6 Strong Induction and Well-ordering
April 7 Unit 4: Counting
Readings for this Class:
  • 10.1 Sum and Product Rules
  • 10.2 The Bijection Rule
  • 10.3 The Generalized Product Rule

Before-Class Homework 4A
  • Participation Activities for this Class:
    • 10.1 Sum and Product Rules
    • 10.2 The Bijection Rule
    • 10.3 The Generalized Product Rule

Due: Assignment 8 (Proofs and Mathematical Induction)
April 9 Unit 4: Counting
Readings for this Class:
  • 10.4 Counting Permutations
  • 10.5 Counting Subsets
  • 10.6 Subset and Permutation Examples

Before-Class Homework 4B
  • Participation Activities for this Class:
    • 10.4 Counting Permutations
    • 10.5 Counting Subsets
    • 10.6 Subset and Permutation Examples
  • Challenge Activities for this Class:
    • 10.1 Sum and Product Rules
    • 10.2 The Bijection Rule
    • 10.3 The Generalized Product Rule
April 14 Unit 4: Counting
Readings for this Class:
  • 10.7 Counting by Complement
  • 10.8 Permutations with Repetitions
  • 10.9 Counting Multisets

Before-Class Homework 4C
  • Participation Activities for this Class:
    • 10.7 Counting by Complement
    • 10.8 Permutations with Repetitions
    • 10.9 Counting Multisets
  • Challenge Activities for this Class:
    • 10.4 Counting Permutations
    • 10.5 Counting Subsets
    • 10.6 Subset and Permutation Examples

Due: Assignment 9 (Counting)

In-class Quiz 4 (canceled)
April 16 Unit 4: Counting
Readings for this Class:
  • 10.10 Assignment Problems: Balls in Bins
  • 10.11 Inclusion-Exclusion Principle
  • 10.12 Counting Problem Examples

Before-Class Homework 4D
  • Participation Activities for this Class:
    • 10.10 Assignment Problems: Balls in Bins
    • 10.11 Inclusion-Exclusion Principle
    • 10.12 Counting Problem Examples
  • Challenge Activities for this Class:
    • 10.7 Counting by Complement
    • 10.8 Permutations with Repetitions
    • 10.9 Counting Multisets
April 21 Unit 4: Counting
Readings for this Class:
  • 12.1 Probability of an Event
  • 12.2 Unions and Complements of Events

Before-Class Homework 4E
  • Participation Activities for this Class:
    • 12.1 Probability of an Event
    • 12.2 Unions and Complements of Events
  • Challenge Activities for this Class:
    • 10.11 Inclusion-Exclusion Principle

Due: Assignment 10 (More Counting)
April 23

Test 2
April 28 Unit 4: Counting
Readings for this Class:
  • 12.3 Conditional Probability and Independence
  • 12.4 Baynes' Theorem

Before-Class Homework 4F
  • Participation Activities for this Class:
    • 12.3 Conditional Probability and Independence
    • 12.4 Baynes' Theorem
  • Challenge Activities for this Class:
    • 12.1 Probability of an Event
April 30 Unit 5: Graphs, Trees, and Algorithms
Readings for this Class:
  • 13.1 Introduction to Graphs
  • 13.2 Graph Representations

Before-Class Homework 4G
  • Participation Activities for this Class:
    • 13.1 Introduction to Graphs
    • 13.2 Graph Representations
  • Challenge Activities for this Class:
    • 12.3 Conditional Probability and Independence
    • 12.4 Baynes' Theorem
May 5 Unit 5: Graphs, Trees, and Algorithms
Readings for this Class:
  • 13.3 Graph Isomorphism
  • 13.4 Walks, trails, circuits, paths, and cycles

Before-Class Homework 5A
  • Participation Activities for this Class:
    • 13.3 Graph Isomorphism
    • 13.4 Walks, trails, circuits, paths, and cycles
  • Challenge Activities for this Class:
    • 13.1 Introduction to Graphs
    • 13.2 Graph Representations
May 7 Unit 5: Graphs, Trees, and Algorithms
Readings for this Class:
  • 14.1 Introduction to Trees
  • 14.2 Tree Application Examples

Before-Class Homework 5B
  • Participation Activities for this Class:
    • 14.1 Introduction to Trees
    • 14.2 Tree Application Examples
  • Challenge Activities for this Class:
    • 13.3 Graph Isomorphism
    • 13.4 Walks, trails, circuits, paths, and cycles

In-class Quiz 5

Due: Assignment 11 (Probability and Graphs)
May 12 Unit 5: Graphs, Trees, and Algorithms
Readings for this Class:
  • 14.4 Tree Traversals
  • 14.5 Spanning Trees and Graph Traversals

Before-Class Homework 5C
  • Participation Activities for this Class:
    • 14.4 Tree Traversals
    • 14.5 Spanning Trees and Graph Traversals
  • Challenge Activities for this Class:
    • 14.1 Introduction to Trees
    • 14.2 Tree Application Examples
May 14 Last day of class: Thursday, May 14
Before-Class Homework 5D
  • Challenge Activities for this Class:
    • 14.4 Tree Traversals
    • 14.5 Spanning Trees and Graph Traversals

Due: Assignment 12 (Graphs and Trees)
May 19 Final Exam: Tuesday, May 19
10:30 am - 12:30 pm
Salazar Hall 1034
created 22 June 2021
developed and refined Summer 2021
revised for ZyBooks Fall 2025
Valid HTML 4.01! Valid CSS!
For more information, please contact Henry M. Walker at walker@cs.grinnell.edu.