Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida

objectives obtain basic knowledge of discrete mathematics learn how to apply discrete mathematics to computer science

textbook Title: Discrete mathematics and its applications Author: Kenneth Rosen Publisher: McGraw-Hill, 5th ed. ISBN

grading Three exams: 3 * 30% –Early Oct., Nov., Dec. Attendance 10% There may be homework assignments, which will be reflected in exams A:B:C:D =?:?:?:?

Course Outline 1.Logic (§§ ) 2.Proof methods (§1.5) 3.Set theory (§§ ) 4.Functions (§1.8) 5.Algorithms (§2.1) 6.Orders of Growth (§2.2) 7.Complexity (§2.3) 8.Number Theory (§ ) 9.Matrices (§2.7) 10.Proof strategy (§3.1) 11.Sequences (§3.2) 12.Summations (§3.2) 13.Inductive proofs (§3.3) 14.Recursion (§ ) 15.Combinatorics (ch. 4) 16.Probability (ch. 5) 17.Recurrences (§ ) 18.Relations (ch. 7) 19.Graph Theory (chs. 8+9)

Time and schedule Every Tue. and Thu. 13:00 – 14:15 Sept. 30 th : no class, Thanksgiving Nov. 2 nd : no class Nov. 4 th : 2 nd exam

TA Chang, Duk-hyun tel: Office:

Discreteness Discrete vs continuous Discrete math: mostly finite, countable Continuous math: mostly uncountable Discrete – digital: obtained by counting Continuous – analog: obtained by measuring

If a set A has the same cardinality as N (the natural numbers), then we say that A is countable. In other words, a set is countable if there is a bijection from that set to N. An alternate way to define countable is: if there is a way to enumerate the elements of a set, then the set has the same cardinality as N and is called countable. A set that is infinite and not countable is called uncountable. Are rational numbers countable? How about real numbers?

math A tool to solve a problem Mathematical modeling 실제 문제해답 추상적 모델 (abstract model) 변환된 모델 (transformed model)

math It ’ s not just about numbers! Mathematics is much more than that: But, the concepts can relate to numbers, symbols, visual patterns, or anything! Mathematics is, most generally, the study of any and all absolutely certain truths about any and all perfectly well-defined concepts.

Again, what ’ s this class about? What are “ discrete structures ” anyway? “ Discrete ” - Composed of distinct, separable parts. (Opposite of continuous.) discrete:continuous = digital:analog “ Structures ” - objects built up from simpler objects according to a definite pattern. “ Discrete Mathematics ” - The study of discrete, mathematical objects and structures.

Why Study Discrete Math? It provides tools and techniques to design and analyze the computer system Broadly speaking, the basis of all of digital information processing: Discrete manipulations of discrete structures represented in memory Digital computer is basically a finite discrete system, part or all of which can be modeled by discrete math. It ’ s the basic language and conceptual foundation of all of computer science. A generally useful tool for rational thought!

Uses for Discrete Math in Computer Science Advanced algorithms & data structures Programming language compilers & interpreters. Computer networks Operating systems Computer architecture Database management systems Cryptography Error correction codes Graphics & animation algorithms, game engines Just about everything!

Course Objectives Upon completion of this course, the student should be able to: –Check the validity of simple logical arguments. –Check the correctness of simple algorithms. –Creatively construct simple valid logical arguments. –Creatively construct simple correct algorithms. –Describe the definitions and properties of a variety of specific types discrete structures. –Correctly read, write and analyze various types of structures using standard notations.