CS 1050 A Constructing Proofs

Fall 2006


 
Topics
Date(s)
Reading
Class Overview 
Basics:  Sets and Numbers 
Mon, Aug 21
Propositions
Direct Proofs
Wed, Aug 23
Reading:
(1) Intro Lecture from Berkeley Class,
(2) Rosen, pp. 75-102
(I suggest reading all of Chapter 1.)
Direct proofs 
Fri, Aug 25
Same as before

No lecture

Mon,
Aug 28

   

Proofs by contrapositive, cases

Wed, Aug   30

Same as before
Proofs by contradiction  
Fri,
Sept 1
Same as before

Functions

Wed,
Sept 6
Rosen, Chapter 2  

Functions

Fri,
Sept 8
Same as before
Countable and uncountable sets
Mon,
Sept 11
 Same as before
Propositional  logic
 Wed,
Sept 13

Rosen,  Chapter 1,

Sections 1.1-1.5

 Induction
Fri, Sept 15
Rosen, Chapter 4,
Pages 263-298
Induction
 
Mon,
Sept 18
 

 Same as before

Review for Quiz 1
Wed,
 Sept 20
 
Review for Quiz 1
Fri,
Sept 22
Quiz 1
Mon,
Sept 25
Review of quiz solutions
Wed,
Sept 27
Induction
Fri,
Sept 29
 
Rosen, Chapter 4,
Pages 263-298
Induction

  Mon, 

Oct 2 

 Same as before

 Recursively defined functions

Wed,
Oct 4

Recursively defined functions

    Fri,

  Oct 6

 Solving a special type of recurrence
Fibonacci numbers
 
Mon,
Oct 9
Handout
Sorting,  Bubble sort
Wed,
Oct 11

 Rosen, Chapter 3,

Pages 167-175

Insertion sort,  Binary search
Fri,
Oct 13

Same as before

 Merge Sort
Mon,
Oct 16
Same as before
 

Asymptotic growth of functions

   Wed,

  Oct 18

Rosen, Chapter 3,

Pages 180-188

Asymptotic growth of functions

    Fri,

  Oct 20

Same as before

Review for Quiz-2
 
Mon,
Oct 23
Review for Quiz-2
Wed,
Oct 25
Quiz-2
Fri, Oct 27

Big-Oh notation

Mon,

Oct 30

Rosen, Chapter 3,

Pages 180-188

Number theory and number theoretic algorithms:   Euclid's  GCD algo. 

Wed,

 Nov 1

Rosen, Chapter 3,

Pages 227-237   

Properties of GCD

 

    Mod notation, its properties  

Modular exponentiation

Fermat's little theorem,

RSA Cryptosystem

Introduction to Graph Theory