CS 2800 Lecture Notes - Lecture 1: Finite-State Machine, Modular Arithmetic, Number Theory
25 Jan 2017
School
Department
Course
Professor
Document Summary
Finite automata (there are no programs that can solve this problem, etc) Sets, relations, functions and apply to counting (talking about sizes of infinity) Logic (applies through the whole course, but will delve deeper into it at the end of the course) Attendance is expected, but attendance is not necessary. Not allowed to use laptops in lecture. Released on friday night or sat morning. Due monday (10 days after being assigned) at noon. If typing, learning latex might be a good idea. Evening prelims (dates are on the website) Letter grades are given for each question, will not directly translate to final grade. How to do hw: have to write and turn it in on your own. Expectation: you do what the professor does in class. Before lecture, there will be a rough sketch, after there will be notes on what actually happened. After the lecture, it"s suggested to try to reproduce the lecture to someone else (the debugging duck)
