CSE 113 - Foundations of Computer Science

Lecture Notes

These HTML lecture notes are intended to be viewed on-line, not printed on university computer facilities. The university printing facilities simply cannot support students printing large volumes of lecture notes. Any student caught printing these notes on university facilities will have their campus computing privileges subspended. If problems occur, we will be forced to remove these on-line lecture notes and no one will be able to benefit from them. See the official CSE 113 WWW page http://ug.cs.sunysb.edu/~cse113 for all handouts, and postscript versions of these lecture notes.

• Lecture 1 -- Course overview
• Lecture 2 -- Syntax and semantics
• Lecture 3 -- Conditional statements
• Lecture 4 -- Valid and invalid arguments
• Lecture 5 -- Analytic tableaux
• Lecture 6 -- Normal forms
• Lecture 7 -- Digital logic circuits
• Lecture 8 -- Integers and divisibility
• Lecture 9 -- Rationals and irrationals
• Lecture 10 -- Functions and sets
• Lecture 11 -- Properties of functions
• Lecture 12 -- Composition, inverse functions
• Lecture 13 -- Hashing, pigeonhole principle
• Lecture 14 -- Recursive function definitions
• Lecture 15 -- Functional programming
• Lecture 16 -- Recursive functions on lists
• Lecture 17 -- Mutual recursion
• Lecture 18 -- Towers of Hanoi
• Lecture 19 -- Mathematical Induction I
• Lecture 20 -- Mathematical Induction II
• Lecture 21 -- Finite state automata
• Lecture 22 -- Relations and partial orders
• Lecture 23 -- Properties of Graphs
• Lecture 24 -- Binary trees, search/traversal
• Lecture 25 -- Review - only if time permits!
• Lecture 26 -- Predicate Logic - NOT COVERED FALL 1999!
• Lecture 27 -- Quantifiers - NOT COVERED FALL 1999!
• Lecture 28 -- Arguments with quantifiers - NOT COVERED FALL 1999!
• Lecture 29 -- Advanced Set Theory - NOT COVERED FALL 1999!