CISC 102 Lecture Notes - Lecture 24: Lemon Meringue Pie, Ice Cream, Complex Instruction Set Computing
31 Oct 2018
School
Department
Course
Professor
CISC 102 verified notes
24/38View all
20
CISC 102 Lecture Notes - Lecture 20: Complex Instruction Set Computing, Public-Key Cryptography, Binary Logarithm
24
CISC 102 Lecture Notes - Lecture 24: Lemon Meringue Pie, Ice Cream, Complex Instruction Set Computing
25
CISC 102 Lecture Notes - Lecture 25: Minestrone, Complex Instruction Set Computing, Pigeonhole Principle
Document Summary
How many subsets are there of a set w n elements. Counting problems are useful to determine resources used by an algorithm (i. e. time & space). Let a x b denote the cross product of sets a and b. You"re picking a main course from : fish, beef, chicken, vegan. We can write this as the set m (main), as follows. There is also a choice of desert from : apple pie, lemon meringue pie, ice cream. When a meal we select both a main and a desert. The product rule will be used to determine the total num of possible meals: The product rule principle can be stated formally as: There is an event e that occurs in m ways and an event f that occurs in n ways, and these events are independent of each other. The combo the events e and f can occur in m x n ways.
