CSE 235 Fall 2003
Introduction to Discrete Structures
Archived Class
Charles Cusack
Computer Science and Engineering
University of Nebraska--Lincoln
Main
Schedule
Grading
Gradebook

Policies
Advice
College
    Policies

Notes
Programs
Tutorials

CSCI 385
MATH 160
Others

Admin
previous     next     today     future     all    

Schedule for weeks 1 through 17

Wk Day Date TopicResourcesEvents

1MonAug 25Introduction CSE235 Web Page

WedAug 27Logic
  • Rosen 1.1
  • Lecture Notes: Intro to Logic

  • FriAug 29Propositional Equivalences
  • Rosen 1.2
  • Logical Equivalence List

  • FriIntroduction

    2MonSep 01Labor DayNo Class

    WedSep 03Predicates and Quantifiers
  • Rosen 1.3
  • Lecture Notes: Predicates and Quantifiers

  • FriSep 05More on Quantifiers Rosen 1.4

    FriPretest

    3MonSep 08Proofs
  • Rosen 1.5
  • Lecture Notes: Proofs
  • Sample Proofs
  • Inference List

  • WedSep 10More Proofs

    FriSep 12Sets and Set Operations Rosen 1.6-1.7

    FriWS 1

    4MonSep 15Functions Rosen 1.8

    WedSep 17
  • Algorithms
  • Growth of Functions
  • Rosen 2.1-2.2
  • Asymptotic Notation Lecture Notes
  • HW1 due

    FriSep 19Growth of Functions
  • Rosen 2.2
  • Proving Bounds Examples

  • FriQuiz 1

    5MonSep 22Complexity of Algorithms
  • Rosen 2.3
  • Algorithm Analysis Lecture Notes

  • WedSep 24Complexity of Algorithms Rosen 2.3

    FriSep 26The Integers and Division Rosen 2.4

    FriWS 2

    6MonSep 29Integers and Algorithms Rosen 2.5

    WedOct 01Proof Strategy Rosen 3.1HW2 due

    FriOct 03Sequences and Summations Rosen 3.2

    FriWS 3

    7MonOct 06Mathematical Induction
  • Rosen 3.3
  • Induction Proofs

  • WedOct 08
  • Mathematical Induction
  • Recursive Definitions
  • Rosen 3.3-3.4

    FriOct 10
  • Recursive Definitions
  • Recursive Algorithms
  • Rosen 3.4-3.5
  • Algorithms and Recurrences Examples
  • HW3 due

    FriQuiz 2

    8MonOct 13Recursive Algorithms Rosen 3.5

    WedOct 15
  • Basics of Counting
  • Pigeonhole Principle
  • Rosen 4.1-4.2
  • Counting Tutorial

  • FriOct 17Rosen Chapters 1-3Review

    FriWorksheetWS 4

    9MonOct 20Fall BreakNo Class

    WedOct 22Rosen Ch 1-3
  • Pen
  • Pencil
  • Midterm Exam

    FriOct 24
  • Permutations
  • Combinations
  • Rosen 4.3
  • Permutations and Combinations Tutorial

  • FriFall BreakNo Class
    (Both recitations)

    10MonOct 27Binomial Coefficients Rosen 4.4

    WedOct 29
  • Generalized Permutations
  • Generalized Combinations
  • Rosen 4.5

    FriOct 31Recurrence Relations
  • Rosen 6.1
  • Examples: Algorithms and Recurrences

  • FriWS 5

    11MonNov 03Solving Recurrence Relations
  • Rosen 6.3
  • Lecture Notes: Recurrences
  • HW4 due

    WedNov 05More with Recurrence Relations
  • Rosen 6.1, 6.3
  • Josephus Stuff

  • FriNov 07Inclusion-Exclusion Rosen 6.5-6.6

    FriWS 6

    12MonNov 10Chapter 6 review Rosen 6

    WedNov 12Relations
  • Rosen 7.1, 7.3
  • Binary Relations Tutorial

  • FriNov 14
  • Representing Relations
  • Closures of Relations
  • Rosen 7.3-7.4
  • Lecture Notes: Warshall's Algorithm
  • HW5 due

    FriQuiz 3

    13MonNov 17
  • Equivalence Relations
  • Partial Orders
  • Rosen 7.5-7.6
  • Lecture Notes: Equivalence Relations

  • WedNov 19Graphs
  • Rosen 8.1-8.2
  • Lecture Notes: Graphs and Trees
  • Graph Theory Stuff

  • FriNov 21
  • Representing Graphs
  • Isomorphism
  • Rosen 8.3

    FriWS 7

    14MonNov 24NothingCar--Go home.HW6 due

    WedNov 26ThanksgivingNo Class

    FriNov 28ThanksgivingNo Class

    FriNo Class

    15MonDec 01Connectiviy and Paths
  • Rosen 8.4-8.5
  • Euler Paths Stuff

  • WedDec 03
  • Trees
  • Tree Applications
  • Rosen 9.1-9.2

  • FriDec 05Tree Traversals Rosen 9.3

    FriQuiz 4

    16MonDec 08
  • Tutorials
  • Review
  • HW7 due

    WedDec 10Review

    FriDec 12Review

    FriWS 8

    ExMonDec 153:30-5:30Final Exam