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.…
Author
Peggy Fisher
Released
3/9/2016This 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
Duration
Views
-
Introduction
-
Welcome1m 11s
-
-
1. Discrete Math Uses
-
Real-world discrete math3m 8s
-
Abstract discrete math1m 57s
-
2. Sets
-
Objects as sets2m 56s
-
Set notation3m 56s
-
Set operations6m 30s
-
Power sets4m 33s
-
Sequences and sums7m 22s
-
Recursion3m 5s
-
Solution: Practice with sets6m 53s
-
-
3. Setting Up SML
-
Functional programming2m 31s
-
Datatypes4m 45s
-
Characters and strings5m 19s
-
Recursive functions4m 45s
-
Challenge: Learn SML1m 40s
-
-
4. Analyzing Data Sequences
-
Use SML to create lists4m 39s
-
Perform functions on lists4m 31s
-
-
5. Effective Arguments and Defensible Decisions
-
Truth tables4m 58s
-
Conditional propositions5m 47s
-
Valid arguments4m 40s
-
Rules of inference4m 46s
-
Prove logical equivalence6m 11s
-
Solution: Write truth tables4m 55s
-
6. Proofs Made Easy
-
Write subset proofs3m 12s
-
Evaluate conditional proofs8m 54s
-
Solution: Write a proof4m 24s
-
7. Advanced Discrete Math Topics
-
Event probability3m 31s
-
Cryptography2m 22s
-
Conclusion
-
Next steps35s
-
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
Press 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.
Share this video
Embed this video
Video: Sets from Cartesian products