View source for CS 2800 Spring 2020

This is the course website for CS 2800, Spring 2020.

* Instructor: [http://www.cs.cornell.edu/~mdgeorge Michael George].  Office hours TBD.

* Class meets Monday, Wednesday, Friday, 10:10-11:00am in Statler 185
* Please read the [[syllabus]]
* Please enroll in [[Redirect:Piazza|Piazza]] for all course announcements and discussion
* Homework is posted on [[Redirect:Piazza|Piazza]]
* Be sure to frequently refer to the list of [[Useful pages]]

= Schedule =

= Schedule =

<!-- This section automatically generated (by schedule.py in the tools/ folder)
  -- do not edit!
  -->

{|class="wikitable"
 ! Topic || Date ||width=70%| Lecture Topic
 |-
 |rowspan=3| [[:Category:Set theory|Sets]] and [[:Category:Proof techniques|Proof techniques]]
 | 1/22  || [[FA19:Lecture 1 Introduction|Introduction]] 
 |-
 | 1/24  || [[FA19:Lecture 2 Set and function definitions|Set and function definitions]] 
 |-
 | 1/27  || [[FA19:Lecture 3 Set constructions|Set constructions]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=1| [[:Category:Set theory|Sets]] and [[:Category:Proof techniques|Proof techniques]]
 | 1/29  || [[FA19:Lecture 4 Proof techniques|Proof techniques]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=2| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
 | 1/31  || [[FA19:Lecture 5 Function properties|Function properties]] 
 |-
 | 2/3   || [[FA19:Lecture 6 Injectivity and left inverses|Injectivity and left inverses]] 
 |-
 |rowspan=2| 
 |-
 |-
 |rowspan=3| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
 | 2/5   || [[FA19:Lecture 7 Surjectivity and Bijectivity|Surjectivity and Bijectivity]] 
 |-
 | 2/7   || [[FA19:Lecture 8 Cardinality|Cardinality]] 
 |-
 | 2/10  || [[FA19:Lecture 9 Diagonalization|Diagonalization]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=1| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
 | 2/12  || [[FA19:Lecture 10 Proof techniques review|Proof techniques review]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=2| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
 | 2/14  || [[FA19:Lecture 11 Relations|Relations]] 
 |-
 | 2/17  || [[FA19:Lecture 12 Equivalence classes|Equivalence classes]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=2| [[:Category:Number theory|Number theory]]
 | 2/19  || [[FA19:Lecture 13 Induction|Induction]] 
 |-
 | 2/21  || [[FA19:Lecture 14 Strong induction and Euclidean division|Strong induction and Euclidean division]] 
 |-
 |rowspan=1| 
 | 2/24  ||class="break"| No class; 
 |-
 |rowspan=1| [[:Category:Number theory|Number theory]]
 | 2/26  || [[FA19:Lecture 15 Base b representation|Base b representation]] 
 |-
 |rowspan=2| 
 |-
 |-
 |rowspan=3| [[:Category:Number theory|Number theory]]
 | 2/28  || [[FA19:Lecture 16 GCD algorithm|GCD algorithm]] 
 |-
 | 3/2   || [[FA19:Lecture 17 Modular numbers|Modular numbers]] 
 |-
 | 3/4   || [[FA19:Lecture 18 Modular division and exponentiation|Modular division and exponentiation]] 
 |-
 |rowspan=1| 
 | 3/5   ||class="exam"| 
 |-
 |rowspan=2| [[:Category:Number theory|Number theory]]
 | 3/6   || [[FA19:Lecture 19 Euler’s theorem|Euler’s theorem]] 
 |-
 | 3/9   || [[FA19:Lecture 20 Public key cryptography|Public key cryptography]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=1| [[:Category:Number theory|Number theory]]
 | 3/11  || [[FA19:Lecture 21 RSA|RSA]] 
 |-
 |rowspan=2| [[:Category:Automata]]
 | 3/13  || [[FA19:Lecture 22 Inductively defined sets|Inductively defined sets]] 
 |-
 | 3/16  || [[FA19:Lecture 23 Structural induction|Structural induction]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=2| [[:Category:Automata]]
 | 3/18  || [[FA19:Lecture 24 Deterministic Finite Automata|Deterministic Finite Automata]] 
 |-
 | 3/20  || [[FA19:Lecture 25 Automata constructions|Automata constructions]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=1| [[:Category:Automata]]
 | 3/23  || [[FA19:Lecture 26 Unrecognizable languages|Unrecognizable languages]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=2| [[:Category:Automata]]
 | 3/25  || [[FA19:Lecture 27 Non-determinism|Non-determinism]] 
 |-
 | 3/27  || [[FA19:Lecture 28 Regular expressions|Regular expressions]] 
 |-
 |rowspan=3| 
 | 3/30  ||class="break"| No class; 
 |-
 | 4/1   ||class="break"| No class; 
 |-
 | 4/3   ||class="break"| No class; 
 |-
 |rowspan=1| [[:Category:Automata]]
 | 4/6   || [[FA19:Lecture 29 Kleene's theorem|Kleene's theorem]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=1| [[:Category:Combinatorics]]
 | 4/8   || [[FA19:Lecture 30 Sum and product rule|Sum and product rule]] 
 |-
 |rowspan=1| 
 | 4/9   ||class="exam"| 
 |-
 |rowspan=2| [[:Category:Combinatorics]]
 | 4/10  || [[FA19:Lecture 31 Permutations and combinations|Permutations and combinations]] 
 |-
 | 4/13  || [[FA19:Lecture 32 Combinatorial proofs|Combinatorial proofs]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=3| [[:Category:Probability]]
 | 4/15  || [[FA19:Lecture 33 Probability spaces|Probability spaces]] 
 |-
 | 4/17  || [[FA19:Lecture 34 Conditional probability|Conditional probability]] 
 |-
 | 4/20  || [[FA19:Lecture 35 Random variables|Random variables]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=1| [[:Category:Probability]]
 | 4/22  || [[FA19:Lecture 36 Expectation|Expectation]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=2| [[:Category:Probability]]
 | 4/24  || [[FA19:Lecture 37 Independent RVs|Independent RVs]] 
 |-
 | 4/27  || [[FA19:Lecture 38 Markov's/Chebychev's/Weak law|Markov's/Chebychev's/Weak law]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=2| [[:Category:Metalogic]]
 | 4/29  || [[FA19:Lecture 39 Truth tables|Truth tables]] 
 |-
 | 5/1   || [[FA19:Lecture 40 Proof trees|Proof trees]] 
 |-
 |rowspan=1| 
 |-
 |rowspan=1| [[:Category:Metalogic]]
 | 5/4   || [[FA19:Lecture 41 Soundness and completeness|Soundness and completeness]] 
 |-
 |rowspan=1| 
 | TBD   ||class="exam"| 
 |}

= Office hours schedule =

(Click for location)

{{#widget:Google Calendar
|id=cueqnsj7l73r7cjbfdp0ei5r9o@group.calendar.google.com
|color=2952A3
|view=week
}}