{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture01CourseOverview

Lecture01CourseOverview - Lecture 1 CS 1813 Discrete...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 1813 Discrete Mathematics, Univ 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]
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
CS 1813 Discrete Mathematics, Univ 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 proofs galore!     proofs galore!          proofs galore!  proofs galore! proofs galore! proofs galore!
Background image of page 2
CS 1813 Discrete Mathematics, Univ 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 Mouse gestures Files Files Databases computation
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}