CS 2800 Lecture Notes - Lecture 1: Finite-State Machine, Modular Arithmetic, Number Theory

22 views2 pages
Lecture 1
(Wed, January 25)
Intro, logistics (functions)
Professor Micheal George
Discrete (not discreet)
Discrete structures- there’s not a “part way”
- Sets, relations, functions and apply to counting (talking about sizes of infinity)
- Probability
- Finite automata (there are no programs that can solve this problem, etc)
- Number theory (esp modular arithmetic)
- Graphs
- Logic (applies through the whole course, but will delve deeper into it at the end of the
- There will always be true things
Mathematics & computer science ← common description
The emphasis: level of mathematical sophistication
Key Skills:
- Build mathematical models of problems
- Describe precisely
- Prove properties
Viewed as a math course
Will involve a lot of writing
Course Logistics
- Attendance is expected, but attendance is not necessary
- Not allowed to use laptops in lecture
- Ask questions!
- One assignment a week
Unlock document

This preview shows half of the first page of the document.
Unlock all 2 pages and 3 million more documents.

Already have an account? Log in

Get OneClass Notes+

Unlimited access to class notes and textbook notes.

YearlyBest Value
75% OFF
$8 USD/m
$30 USD/m
You will be charged $96 USD upfront and auto renewed at the end of each cycle. You may cancel anytime under Payment Settings. For more information, see our Terms and Privacy.
Payments are encrypted using 256-bit SSL. Powered by Stripe.