csc 133 - discrete mathematical structures dr. karl ricanek jr

14
CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Upload: lydia-jacobs

Post on 31-Dec-2015

223 views

Category:

Documents


2 download

TRANSCRIPT

Page 1: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

CSC 133 - Discrete Mathematical Structures

Dr. Karl Ricanek Jr

Page 2: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Quick Info

• Dr. Karl Ricanek Jr – Web

• www.uncw.edu/people/ricanekk– Contact

• CIS 2042• [email protected]• 962-4261• fb: ricanekk and skype: karl.ricanek

– Office Hours: • TR 9:45am-11:00am and • by appointment

• Teaching Assistant: Paul Martin – Email: pgm0543– Location: CI 2055

Page 3: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

What is CSC 133?

• Discrete Mathematical Structures– Focus on

• Propositional and predicate logic• Proofs (deduction, induction, contradiction)• Set theory.• Boolean algebra.• Recursion.• Graphs and Trees.• Counting and probability.

Page 4: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

How Do I Get an ‘A’?

• Come to every class. – Attendance is required.

• Read the textbook.– Reading the textbook is required.

• Do homeworks on time.

• Make use of office hours, TA, and fellow students. – Send me email early and often.

Page 5: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Course and Grading Criteria

• Attendance– Your attendance grade will be computed by taking the

number of classes attended and dividing by the total number of classes (minus 2).  This grade counts 1/6 of your total grade. 

• Quizzes 1/6 … drop 2 lowest• 2 Midterms …1/6 each• Final 1/6

– or (2/6 as it will replace your lowest midterm score)

• Homework projects … 1/6

Page 6: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

The Required Text

• Discrete Mathematics with Applications, 3rd Edition,  Susanna S. Epp.

Page 7: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

An Overview of Each Topic

• Logic

• Proofs

• Functions

• Recursion

• Graphs

• Probability

Page 8: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Logic

• If you know a set of statements are true, what other statements can you also deduce are true?

• If I tell you that all men are mortal, and Socrates is a man, what can you deduce?

Page 9: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Digital Logic

Page 10: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Proofs

• What is a proof?

• How is programming like writing a proof?

Page 11: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Functions

• What is a function?

• What if a function calls itself?– That’s recursion!

Page 12: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

How good is a function at doing its job?

• What do we mean by “good”?

Page 13: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Graphs (and Trees)

Page 14: CSC 133 - Discrete Mathematical Structures Dr. Karl Ricanek Jr

Probability

• What is the likelihood of an event occurring?

• What is randomness?

• Statistics can be described as the study of how to make inference and decisions in the face of uncertainty and variability