These lessons on set theory are useless if we cannot apply them to our computing solutions. While we don't mention programming in this lesson, we do show how to use an ordered collection called a bitmap (sometimes called a bit array, bit string, or bit vector) to define sets contained in a finite universal set. We also show how to apply set operations such as union and intersection to these collections to derive solutions.
Timestamps
00:00 | Intro
00:28 | Basic Requirements for Using Bitmaps
02:33 | Bitmap Creation Demonstration
04:44 | Example of Union and Intersection with Bitmaps
09:38 | Creating a Tic-Tac-Toe Game using Bitmaps
Hashtags
#bitmap #vector #array
