COMP 232 Lecture Notes - Lecture 1: Propositional Calculus, Automata Theory, Classical Mathematics
17 Apr 2016
School
Department
Course
Professor
Document Summary
Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Some calculus techniques apply only to continuous functions. Dealing with discrete objects requires tech- niques di erent from classical math. This is why a course in discrete mathematics is standard in computer science or software. The techniques of discrete mathematics help us solve many kinds of problems. What is the shortest route to go from point. Discrete mathematics provides the foundations for many elds: Automata theory: the theory behind com- pilers. Routing and other problems in computer networks. Iow, the ability to understand and create math- ematical arguments. To learn mathematical reasoning and prob- lem solving, rather than a set of skills (e. g. how to multiply, divide, di erentiate and integrate). To be able to attack problems di erent from previously seen. To learn to apply mathematical abstrac- tion to problems.
