This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 1813 Discrete 1 Lecture 1 CS 1813 – Discrete Mathematics Learning Goals Lesson Plans and Logic Rex Page Professor of Computer Science University of Oklahoma EL 119 – [email protected] CS 1813 Discrete 2 CS 1813 Discrete Mathematics Learning Goals Apply mathematical logic to prove properties of software Predicate calculus and natural deduction Boolean algebra and equational reasoning Mathematical induction Mathematical induction Mathematical induction Understand fundamental data structures Sets Trees Functions and relations Additional topics Graphs Counting Algorithm Complexity p ro o f s g a lo re ! p ro o fs g a lo re ! pro ofs ga lore! proofs galore! proofs galore! proofs galore! CS 1813 Discrete 3 Why Proofs? Software translates input signals to output signals A program is a constructive proof of a translation But what translation? Proofs can confirm that software works correctly Testing cannot confirm software correctness 100s of inputs > 2 100s of possibilities Practice with proofs improves software thinking Key presses Key presses Mouse gestures Mouse gestures...
View
Full
Document
This note was uploaded on 11/11/2011 for the course MATH 112 taught by Professor Jarvis during the Winter '08 term at BYU.
 Winter '08
 JARVIS
 Logic

Click to edit the document details