Experiential Learning in module order

This page collects together all of the “experiences” associated with individual modules.

In this site, experiences represent “active” learning opportunities, as opposed to readings, which represent “passive” learning opportunities. In many courses, readings and experiences together constitute the “assignments”.

Module: Introduction

E01: Introduce yourself

Post an introduction in #hello_world in Slack.

27 Aug 09:00 PM

Module: Propositional Logic

Rosen Sections 1.1-1.3

Propositional logic, applications of propositional logic, propositional equivalences

Textbook 35 pages

A01: Homework 1

Homework for sections 1.1-1.3

Homework 04 Sep 05:45 PM

Q01: Quiz 1

Quiz for sections 1.1-1.3

Quiz 03 Sep 06:00 PM

Propositional logic

Write propositional logic expressions (Rosen Section 1.1)

Problems

Propositional logic

Write propositional logic expressions (Rosen Section 1.1)

Solutions

Propositional logic applications

Express system specifications using propositions (Rosen Section 1.2)

Problems

Propositional logic applications

Express system specifications using propositions (Rosen Section 1.2)

Solutions

Propositional equivalences

Use DeMorgan’s laws, determine tautologies (Rosen Section 1.3)

Problems

Propositional equivalences

Use DeMorgan’s laws, determine tautologies (Rosen Section 1.3)

Solutions

Module: Predicate Logic

A02: Homework 2

Homework for sections 1.4-1.6

Homework 11 Sep 05:45 PM

Q02: Quiz 2

Quiz for sections 1.4-1.6

Quiz 10 Sep 06:00 PM

Predicates and quantifiers

Express statements using quantifiers, predicates, and logical connectives (Rosen Section 1.4)

Problems

Predicates and quantifiers

Express statements using quantifiers, predicates, and logical connectives (Rosen Section 1.4)

Solutions

Nested quantifiers

Express statements using nested quantifiers (Rosen Section 1.5)

Problems

Nested quantifiers

Express statements using nested quantifiers (Rosen Section 1.5)

Solutions

Rules of inference

Apply rules of inference to make conclusions (Rosen Section 1.6)

Problems

Rules of inference

Apply rules of inference to make conclusions (Rosen Section 1.6)

Solutions

Introduction to Proofs

Direct proof, proof by contraposition, proof by contradiction (Rosen Section 1.7)

Problems

Introduction to Proofs

Direct proof, proof by contraposition, proof by contradiction (Rosen Section 1.7)

Solutions

Module: Sets

A03: Homework 3

Homework for sections 1.7, 2.1, 2.2

Homework 25 Sep 05:45 PM

Q03: Quiz 3

Quiz for sections 1.6, 1.7, 2.1

Quiz 24 Sep 06:00 PM

Sets

Set membership, set equality, cardinality, power sets (Rosen Section 2.1)

Problems

Sets

Set membership, set equality, cardinality, power sets (Rosen Section 2.1)

Solutions

Set operations

Union, intersection, De Morgan’s law, venn diagrams (Rosen Section 2.2)

Problems

Set operations

Union, intersection, De Morgan’s law, venn diagrams (Rosen Section 2.2)

Solutions

Module: Functions

A04: Homework 4

Homework for sections 2.3 and 2.4

Homework 02 Oct 05:45 PM

Functions

Injective, surjective, composition, inverse (Rosen Section 2.3)

Problems

Functions

Injective, surjective, composition, inverse (Rosen Section 2.3)

Solutions

Module: Sequences, series, summations

Sequences and summations

Terms, recurrence relations, initial conditions (Rosen Section 2.6)

Problems

Sequences and summations

Terms, recurrence relations, initial conditions (Rosen Section 2.6)

Solutions

Module: Linear algebra

A05: Homework 5

Homework for section 2.6 and review

Homework 09 Oct 05:45 PM

Matrices

Matrix addition, multiplication, inverse (Rosen Section 2.6)

Problems

Matrices

Matrix addition, multiplication, inverse (Rosen Section 2.6)

Solutions

Module: Midterm

A06: Homework 6

Chapter 1 Review Homework

Homework 16 Oct 05:45 PM

Module: Algorithms

A07: Homework 7

Homework for section 3.1

Homework 23 Oct 05:45 PM

A08: Homework 8

Homework for sections 3.2-3.3

Homework 30 Oct 05:45 PM

Algorithms

Linear search, binary search, bubble sort, insertion sort (Rosen Section 3.1)

Problems

Algorithms

Linear search, binary search, bubble sort, insertion sort (Rosen Section 3.1)

Solutions

Growth of functions

Big O estimates (Rosen Section 3.2)

Problems

Growth of functions

Big O estimates (Rosen Section 3.2)

Solutions

Complexity of algorithms

Big O estimates (continued) (Rosen Section 3.3)

Problems

Complexity of algorithms

Big O estimates (continued) (Rosen Section 3.3)

Solutions

Module: Data representations

A09: Homework 9

Homework for section 4.2

Homework 06 Nov 05:45 PM

Integer representation

Binary, decimal, octal, hexadecimal, binary expansion (Rosen Section 4.2)

Problems

Integer representation

Binary, decimal, octal, hexadecimal, binary expansion (Rosen Section 4.2)

Solutions

Module: Number theory

A10: Homework 10

Homework for sections 4.1 and 4.3

Homework 13 Nov 05:45 PM

Divisibility and modular arithmetic

Modular arithmetic (Rosen Section 4.1)

Problems

Divisibility and modular arithmetic

Modular arithmetic (Rosen Section 4.1)

Solutions

Primes and greatest common divisors

Prime factorization, greatest common divisor, least common multiple, Euclidean algorithm (Rosen Section 4.3)

Problems

Primes and greatest common divisors

Prime factorization, greatest common divisor, least common multiple, Euclidean algorithm (Rosen Section 4.3)

Solutions

Module: Induction and recursion

A11: Homework 11

Homework for sections 5.1 and 5.2

Homework 20 Nov 05:45 PM

A12: Homework 12

Homework for sections 5.3 and 5.4

Homework 04 Dec 05:45 PM

Induction

Proof by induction (Rosen Section 5.1)

Problems

Induction

Proof by induction (Rosen Section 5.1)

Solutions

Strong Induction

Proof by strong induction (Rosen Section 5.2)

Problems

Strong Induction

Proof by strong induction (Rosen Section 5.2)

Solutions

Recursive definitions

Proof by induction (Rosen Section 5.3)

Problems

Recursive definitions

Proof by induction (Rosen Section 5.3)

Solutions

Recursive algorithms

Recursive algorithms (Rosen Section 5.4)

Problems

Recursive algorithms

Recursive algorithms (Rosen Section 5.4)

Solutions

Module: Counting

A13: Homework 13

Homework for sections 6.1

Homework 04 Dec 05:45 PM

Basics of counting

Basic counting problems (how many ways…) (Rosen Section 6.1)

Problems

Basics of counting

Basic counting problems (how many ways…) (Rosen Section 6.1)

Solutions

Pigeonhole principle

Apply the pigeonhole principle (Rosen Section 6.2)

Problems

Pigeonhole principle

Apply the pigeonhole principle (Rosen Section 6.2)

Solutions

Permutations and combinations

Listing permutations and combinations (Rosen Section 6.3)

Problems

Permutations and combinations

Listing permutations and combinations (Rosen Section 6.3)

Solutions

Binomial coefficients

Find coefficients (Rosen Section 6.4)

Problems

Binomial coefficients

Find coefficients (Rosen Section 6.4)

Solutions

Generalized permutations and combinations

Combinations and permutations (continued) (Rosen Section 6.5)

Problems

Generalized permutations and combinations

Combinations and permutations (continued) (Rosen Section 6.5)

Solutions