1 / 14

CSC 133 - Discrete Mathematical Structures

CSC 133 - Discrete Mathematical Structures. Dr. Karl Ricanek Jr. Quick Info. Dr. Karl Ricanek Jr Web www.uncw.edu/people/ricanekk Contact CIS 2042 ricanekk@uncw.edu 962-4261 fb: ricanekk and skype: karl.ricanek Office Hours: TR 9:45am-11:00am and by appointment

hop-green
Download Presentation

CSC 133 - Discrete Mathematical Structures

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. Quick Info • Dr. Karl Ricanek Jr • Web • www.uncw.edu/people/ricanekk • Contact • CIS 2042 • ricanekk@uncw.edu • 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

  3. 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.

  4. 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.

  5. 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

  6. The Required Text • Discrete Mathematics with Applications, 3rd Edition,  Susanna S. Epp.

  7. An Overview of Each Topic • Logic • Proofs • Functions • Recursion • Graphs • Probability

  8. 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?

  9. Digital Logic

  10. Proofs • What is a proof? • How is programming like writing a proof?

  11. Functions • What is a function? • What if a function calls itself? • That’s recursion!

  12. How good is a function at doing its job? • What do we mean by “good”?

  13. Graphs (and Trees)

  14. 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

More Related