CSCI 250 Fall 2010
Discrete Structures
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Homework

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 112
CSCI 125
Others

Admin
previous     next     today     future     all    

Schedule for weeks 1 through 16

Wk Day Date TopicResourcesEvents

1WedSep 01First Examples
  • Ensley 1.1
  • Chapter 1 Resources

  • 2MonSep 06Number Puzzles and SequencesEnsley 1.2

    WedSep 08Truth-tellers, Liars, and Propositional Logic
  • Ensley 1.3
  • Intro to Logic
  • Truth Table Applet
  • Truth Table Quiz Applet
  • HW 1 due

    3MonSep 13Predicates
  • Ensley 1.4
  • Predicates and Quantifiers
  • Logical Equivalence List
  • Logical Equivalence Applet
  • Logical Equivalence Quiz

  • WedSep 15ImplicationsEnsley 1.5HW 2 due

    4MonSep 20Mathematical Writing
  • Ensley 2.1
  • Proof Examples

  • WedSep 22Proofs About NumbersEnsley 2.2HW 3 due

    5MonSep 27Catch-up

    WedSep 29Mathematical Induction
  • Ensley 2.3
  • Induction Notes

  • 6MonOct 04Contradiction and the Pigeonhole Principle
  • Ensley 2.5
  • Pigeonhole Principle Tutorial
  • HW 4 due

    WedOct 06No Class (CIS)

    7MonOct 11Set Definitions and Operations
  • Ensley 3.1
  • Set Operations Applet
  • Venn Diagram Applet

  • WedOct 13More Operations on SetsEnsley 3.2HW 5 due

    8MonOct 18No Class (Fall Recess)

    WedOct 20Proving Set PropertiesEnsley 3.3

    9MonOct 25Boolean AlgebraEnsley 3.4HW 6 due

    WedOct 27Functions/Relations: Definitions, Diagrams, and InversesEnsley 4.1

    10MonNov 01The Composition OperationEnsley 4.2HW 7 due

    WedNov 03Properties of RelationsEnsley 4.4

    11MonNov 08Equivalence RelationsEnsley 4.5HW 8 due

    WedNov 10Numerical Functions in Discrete MathEnsley 4.6

    12MonNov 15Growth of Functions
  • Ensley 4.8
  • Asymptotic Notation Notes
  • Asymptotic Notation Handout

  • WedNov 17Catch-upHW 9 due

    13MonNov 22Combinatorics: Introduction
  • Ensley 5.1
  • Permutations and Combinations Tutorial

  • WedNov 24Basic Rules for Counting
  • Ensley 5.2
  • Counting Tutorial
  • HW 10 due

    14MonNov 29Combinations and the Binomial TheoremEnsley 5.3

    WedDec 01Recursive Counting Ensley 5.5 HW 11 due

    15MonDec 06Solving Recurrence Relations
  • Ensley 5.6
  • Recurrence Relations Notes

  • WedDec 08Review the semesterHW 12 due

    ExWedDec 15EverythingFinal Exam, 9-11 am