Join Peggy Fisher for an in-depth discussion in this video Sets from Cartesian products, part of Programming Foundations: Discrete Mathematics.
- [Voiceover] Creating sets from Cartesian products.…Cartesian products are a result…of taking two sets, such as sets A and B,…and creating a list of ordered pairs.…A more formal definition looks like this.…A cross B is equal to the ordered pairs of…a comma b, such that…little A is an element of set A,…and little B is an element of set B.…Using this formula, if we have sets A…a set of all students at a college,…and B, a set of all courses at the college,…A times B would be the set of…all student and course combinations.…
To predetermine the number of ordered pairs…we can take the cardinality of set A…times the cardinality of set B.…That gives us the number of ordered pairs.…In this example, we will keep it simple…and say that we have two students…and three possible courses.…The cardinality of A is two,…the cardinality of B is three,…so we will end up with six ordered pairs.…To find the Cartesian product of these two sets…we start by taking a value from the first set, such as s1,…and we combine it with every element in the second set.…
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.