Difference between revisions of "CS 2800 Spring 2020"

From CS2800 wiki
(Schedule)
(Schedule)
Line 18: Line 18:
 
  ! Topic || Date ||width=70%| Lecture Topic
 
  ! Topic || Date ||width=70%| Lecture Topic
 
  |-
 
  |-
  |rowspan=3| [[:Category:Set theory|Sets]] and [[:Category:Proof techniques|Proof techniques]]
+
  |rowspan=4| [[:Category:Set theory|Sets]] and [[:Category:Proof techniques|Proof techniques]]
 
  | 1/22  || [[FA19:Lecture 1 Introduction|Introduction]]  
 
  | 1/22  || [[FA19:Lecture 1 Introduction|Introduction]]  
 
  |-
 
  |-
Line 25: Line 25:
 
  | 1/27  || [[FA19:Lecture 3 Set constructions|Set constructions]]  
 
  | 1/27  || [[FA19:Lecture 3 Set constructions|Set constructions]]  
 
  |-
 
  |-
|rowspan=1|
 
| 1/28
 
|-
 
|rowspan=1| [[:Category:Set theory|Sets]] and [[:Category:Proof techniques|Proof techniques]]
 
 
  | 1/29  || [[FA19:Lecture 4 Proof techniques|Proof techniques]]  
 
  | 1/29  || [[FA19:Lecture 4 Proof techniques|Proof techniques]]  
 
  |-
 
  |-
  |rowspan=1|
+
  |rowspan=8| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
| 1/31
 
|-
 
|rowspan=2| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
 
 
  | 1/31  || [[FA19:Lecture 5 Function properties|Function properties]]  
 
  | 1/31  || [[FA19:Lecture 5 Function properties|Function properties]]  
 
  |-
 
  |-
 
  | 2/3  || [[FA19:Lecture 6 Injectivity and left inverses|Injectivity and left inverses]]  
 
  | 2/3  || [[FA19:Lecture 6 Injectivity and left inverses|Injectivity and left inverses]]  
 
  |-
 
  |-
|rowspan=2|
 
| 2/4 
 
|-
 
| 2/4 
 
|-
 
|rowspan=3| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
 
 
  | 2/5  || [[FA19:Lecture 7 Surjectivity and Bijectivity|Surjectivity and Bijectivity]]  
 
  | 2/5  || [[FA19:Lecture 7 Surjectivity and Bijectivity|Surjectivity and Bijectivity]]  
 
  |-
 
  |-
Line 51: Line 38:
 
  | 2/10  || [[FA19:Lecture 9 Diagonalization|Diagonalization]]  
 
  | 2/10  || [[FA19:Lecture 9 Diagonalization|Diagonalization]]  
 
  |-
 
  |-
|rowspan=1|
 
| 2/11
 
|-
 
|rowspan=1| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
 
 
  | 2/12  || [[FA19:Lecture 10 Proof techniques review|Proof techniques review]]  
 
  | 2/12  || [[FA19:Lecture 10 Proof techniques review|Proof techniques review]]  
 
  |-
 
  |-
|rowspan=1|
 
| 2/14
 
|-
 
|rowspan=2| [[:Category:Functions|Functions]] and [[:Category:Relations|Relations]]
 
 
  | 2/14  || [[FA19:Lecture 11 Relations|Relations]]  
 
  | 2/14  || [[FA19:Lecture 11 Relations|Relations]]  
 
  |-
 
  |-
 
  | 2/17  || [[FA19:Lecture 12 Equivalence classes|Equivalence classes]]  
 
  | 2/17  || [[FA19:Lecture 12 Equivalence classes|Equivalence classes]]  
|-
 
|rowspan=1|
 
| 2/18
 
 
  |-
 
  |-
 
  |rowspan=2| [[:Category:Number theory|Number theory]]
 
  |rowspan=2| [[:Category:Number theory|Number theory]]
Line 76: Line 52:
 
  | 2/24  ||class="break"| No class;  
 
  | 2/24  ||class="break"| No class;  
 
  |-
 
  |-
  |rowspan=1| [[:Category:Number theory|Number theory]]
+
  |rowspan=4| [[:Category:Number theory|Number theory]]
 
  | 2/26  || [[FA19:Lecture 15 Base b representation|Base b representation]]  
 
  | 2/26  || [[FA19:Lecture 15 Base b representation|Base b representation]]  
 
  |-
 
  |-
|rowspan=2|
 
| 2/27
 
|-
 
| 2/28
 
|-
 
|rowspan=3| [[:Category:Number theory|Number theory]]
 
 
  | 2/28  || [[FA19:Lecture 16 GCD algorithm|GCD algorithm]]  
 
  | 2/28  || [[FA19:Lecture 16 GCD algorithm|GCD algorithm]]  
 
  |-
 
  |-
Line 94: Line 64:
 
  | 3/5  ||class="exam"|  
 
  | 3/5  ||class="exam"|  
 
  |-
 
  |-
  |rowspan=2| [[:Category:Number theory|Number theory]]
+
  |rowspan=3| [[:Category:Number theory|Number theory]]
 
  | 3/6  || [[FA19:Lecture 19 Euler’s theorem|Euler’s theorem]]  
 
  | 3/6  || [[FA19:Lecture 19 Euler’s theorem|Euler’s theorem]]  
 
  |-
 
  |-
 
  | 3/9  || [[FA19:Lecture 20 Public key cryptography|Public key cryptography]]  
 
  | 3/9  || [[FA19:Lecture 20 Public key cryptography|Public key cryptography]]  
 
  |-
 
  |-
|rowspan=1|
 
| 3/10
 
|-
 
|rowspan=1| [[:Category:Number theory|Number theory]]
 
 
  | 3/11  || [[FA19:Lecture 21 RSA|RSA]]  
 
  | 3/11  || [[FA19:Lecture 21 RSA|RSA]]  
 
  |-
 
  |-
  |rowspan=2| [[:Category:Automata]]
+
  |rowspan=7| [[:Category:Automata]]
 
  | 3/13  || [[FA19:Lecture 22 Inductively defined sets|Inductively defined sets]]  
 
  | 3/13  || [[FA19:Lecture 22 Inductively defined sets|Inductively defined sets]]  
 
  |-
 
  |-
 
  | 3/16  || [[FA19:Lecture 23 Structural induction|Structural induction]]  
 
  | 3/16  || [[FA19:Lecture 23 Structural induction|Structural induction]]  
 
  |-
 
  |-
|rowspan=1|
 
| 3/17
 
|-
 
|rowspan=2| [[:Category:Automata]]
 
 
  | 3/18  || [[FA19:Lecture 24 Deterministic Finite Automata|Deterministic Finite Automata]]  
 
  | 3/18  || [[FA19:Lecture 24 Deterministic Finite Automata|Deterministic Finite Automata]]  
 
  |-
 
  |-
 
  | 3/20  || [[FA19:Lecture 25 Automata constructions|Automata constructions]]  
 
  | 3/20  || [[FA19:Lecture 25 Automata constructions|Automata constructions]]  
 
  |-
 
  |-
|rowspan=1|
 
| 3/20
 
|-
 
|rowspan=1| [[:Category:Automata]]
 
 
  | 3/23  || [[FA19:Lecture 26 Unrecognizable languages|Unrecognizable languages]]  
 
  | 3/23  || [[FA19:Lecture 26 Unrecognizable languages|Unrecognizable languages]]  
 
  |-
 
  |-
|rowspan=1|
 
| 3/24
 
|-
 
|rowspan=2| [[:Category:Automata]]
 
 
  | 3/25  || [[FA19:Lecture 27 Non-determinism|Non-determinism]]  
 
  | 3/25  || [[FA19:Lecture 27 Non-determinism|Non-determinism]]  
 
  |-
 
  |-
Line 141: Line 95:
 
  |rowspan=1| [[:Category:Automata]]
 
  |rowspan=1| [[:Category:Automata]]
 
  | 4/6  || [[FA19:Lecture 29 Kleene's theorem|Kleene's theorem]]  
 
  | 4/6  || [[FA19:Lecture 29 Kleene's theorem|Kleene's theorem]]  
|-
 
|rowspan=1|
 
| 4/7 
 
 
  |-
 
  |-
 
  |rowspan=1| [[:Category:Combinatorics]]
 
  |rowspan=1| [[:Category:Combinatorics]]
Line 156: Line 107:
 
  | 4/13  || [[FA19:Lecture 32 Combinatorial proofs|Combinatorial proofs]]  
 
  | 4/13  || [[FA19:Lecture 32 Combinatorial proofs|Combinatorial proofs]]  
 
  |-
 
  |-
  |rowspan=1|
+
  |rowspan=6| [[:Category:Probability]]
| 4/14
 
|-
 
|rowspan=3| [[:Category:Probability]]
 
 
  | 4/15  || [[FA19:Lecture 33 Probability spaces|Probability spaces]]  
 
  | 4/15  || [[FA19:Lecture 33 Probability spaces|Probability spaces]]  
 
  |-
 
  |-
Line 166: Line 114:
 
  | 4/20  || [[FA19:Lecture 35 Random variables|Random variables]]  
 
  | 4/20  || [[FA19:Lecture 35 Random variables|Random variables]]  
 
  |-
 
  |-
|rowspan=1|
 
| 4/21
 
|-
 
|rowspan=1| [[:Category:Probability]]
 
 
  | 4/22  || [[FA19:Lecture 36 Expectation|Expectation]]  
 
  | 4/22  || [[FA19:Lecture 36 Expectation|Expectation]]  
 
  |-
 
  |-
|rowspan=1|
 
| 4/24
 
|-
 
|rowspan=2| [[:Category:Probability]]
 
 
  | 4/24  || [[FA19:Lecture 37 Independent RVs|Independent RVs]]  
 
  | 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]]  
 
  | 4/27  || [[FA19:Lecture 38 Markov's/Chebychev's/Weak law|Markov's/Chebychev's/Weak law]]  
 
  |-
 
  |-
  |rowspan=1|
+
  |rowspan=3| [[:Category:Metalogic]]
| 4/28
 
|-
 
|rowspan=2| [[:Category:Metalogic]]
 
 
  | 4/29  || [[FA19:Lecture 39 Truth tables|Truth tables]]  
 
  | 4/29  || [[FA19:Lecture 39 Truth tables|Truth tables]]  
 
  |-
 
  |-
 
  | 5/1  || [[FA19:Lecture 40 Proof trees|Proof trees]]  
 
  | 5/1  || [[FA19:Lecture 40 Proof trees|Proof trees]]  
 
  |-
 
  |-
|rowspan=1|
 
| 5/1 
 
|-
 
|rowspan=1| [[:Category:Metalogic]]
 
 
  | 5/4  || [[FA19:Lecture 41 Soundness and completeness|Soundness and completeness]]  
 
  | 5/4  || [[FA19:Lecture 41 Soundness and completeness|Soundness and completeness]]  
 
  |-
 
  |-

Revision as of 16:00, 21 January 2020

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

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

Schedule

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

Office hours schedule

(Click for location)