Join Peggy Fisher for an in-depth discussion in this video Discrete math for programming, part of Foundations of Programming: Discrete Mathematics.
- [Voiceover] Discrete math is a very important concept…in the foundation of programming.…Computers operate in a very discrete manner.…When we program, it doesn't matter…what language we start with.…Eventually our code is translated into machine language…or a series of binary bits and bytes…that the computer can understand.…A bit consists of a value of zero or one.…This is also the value of Boolean operators,…true or false.…They're stored as zero or one.…
When we build complex Boolean statements…in programming, it's extremely important…to understand how to evaluate the end result.…For example, if we need to program a series…of statements depending on whether or not…a condition is true, this is considered…a logical expression.…Let's consider a business problem.…The company wants to send out reminders…to all customers who have not made…a minimum payment on their credit card bill…and they are over 60 days late.…To program this logic, we need to check…the following conditions:…one, if the customer owes money on their account;…
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.