Join Peggy Fisher for an in-depth discussion in this video Abstract discrete math, part of Programming Foundations: Discrete Mathematics.
- [Voiceover] Abstract Math Problems.…Abstract math provides the conceptual background…and theory that justifies…the way math is used in applications.…Abstract math requires conceptual reasoning…about abstract ideas, as well as manipulating symbols,…particularly, understanding and constructing proofs.…In doing abstract math, you state theorems and prove them…mostly in the context of mathematical ideas.…The level of abstraction allows for solving complex problems…by breaking them down into smaller problems.…
When completing proofs, we often start…with a statement similar to this one.…One supposes that a particular but arbitrarily chosen…element x in D, where D is the domain,…for which P(x), the proposition, is true,…and proves that Q(x) must also be true.…As you can see, this is an abstract version…of the proof which allows us to determine…the validity of the proof, and therefore…we can use this to generalize to more specific solutions.…
In discrete mathematics,…there are relatively few formulas to memorize.…Instead, there are a number of fundamental concepts…
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
Programming Foundations: Design Patterns (2013)with 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.