Join Peggy Fisher for an in-depth discussion in this video Conditional propositions, part of Foundations of Programming: Discrete Mathematics.
- [Voiceover] Conditional statements,…or conditional propositions, form the basis…for all decision making in computer software.…First, let's do a quick review of our logical operators.…A compound proposition is created by connecting…individual propositions using logical operators.…AND is denoted with an upside down v symbol,…such as p AND q.…The truth value of a compound proposition…using the AND operator is only true…when both propositions are true.…
OR is denoted using a v symbol, such as p OR q.…The truth value of a compound proposition…using the OR operator is always true…except when p and q are both false.…If a statement has logical operators,…the order of precedence is the NOT operator first,…then AND, and finally OR.…Now, back to conditional propositions.…A conditional statement is read as 'if this, then that'.…
For example, if there is an accident on the highway,…then I will be late for work.…Conditional statements are written using an arrow,…such as if p then q.…p represents the premises and q is the conclusion.…
This course relies on an open-source SML (standard machine language) library to demo the concepts behind discrete math. Peggy Fisher shows you how to manipulate sets of data, write proofs and truth tables, analyze data sequences, and visualize data using graph theory. Challenges at the end of every chapter allow you to test your knowledge. By the end of the course, you should be able to make the leap from theory to using discrete math in practice: saving time and resulting in code that's cleaner and easier to maintain in the long run.
- Real-world discrete math
- Objects as sets
- Set notation and operations
- Standard machine language (SML) setup
- Working with data types, strings, and functions in SML
- Analyzing data sequences
- Writing truth tables
- Identifying and evaluating predicates
- Validating arguments
- Writing proofs: subset, conditional, and biconditional proofs
- Visualizing data with graphs
- Advanced discrete math techniques
Skill Level Intermediate
Foundations of Programming: Design Patternswith Elisabeth Robson2h 19m Intermediate
1. Discrete Math Uses
3. Setting Up SML
4. Analyzing Data Sequences
5. Effective Arguments and Defensible Decisions
6. Proofs Made Easy
7. Advanced Discrete Math Topics
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.Cancel
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.