CS 2800 Fall 2017

From CS2800 wiki


This is a DUMMY course website for CS 2800, Spring 2018. The actual website is here.

Schedule

Topic Date Lecture Topic
Basics 8/23 Introduction
8/25 Modeling problems
8/28 Proofs
Probability 8/30 Probability intro
9/1 Conditional probability
9/6 Independence
9/8 More on Proofs
9/11 Random Variables
9/13 Expectation and Variance
9/15 Markov's, Chebychev's, weak law of large numbers
9/18 Probabilistic Counting
Functions and relations 9/20 Cardinality definitions
9/22 Inverses
9/25 Cardinality and countability
9/27 Uncountable sets
9/29 Finite cardinality
10/6 Induction
10/4 Relations
10/6 Equivalence classes
Automata 10/11 Inductively defined sets
10/13 Structural induction; automata intro
10/16 The language of a machine
10/18 Union of recognizable sets
10/20 Unsolvable problems
10/23 Nondeterministic automata
10/25 Regular expressions
10/27 Kleene's theorem: RE to [math]\epsilon [/math]-NFA
10/30 Kleene's theorem: NFA to RE
11/1a Turing Machines
Number Theory 11/1b Euclidean division
11/3 Strong induction, number bases
11/6 Modular numbers
11/8 Euler's theorem
11/10 Properties of GCD
11/13 RSA
Formal Logic 11/15 Formal logic, semantics
11/17 Proofs
11/20 Soundness and completeness
11/27a Completeness
Graphs 11/27b Graph definitions, handshaking
11/29 Eulerian and Hamiltonian cycles
12/1 Finale

Homework

Office hours schedule (click for location)

TODO: Embed office hours calendar