Section 10.1 and 10.2. Hand Back Exam #3 The class average was much better on this exam (no adjustments necessary). Activity 0: –Discuss problems 2 and.

Slides:



Advertisements
Similar presentations
Counting. Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers ? How many steps.
Advertisements

4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.
Section 4.1: The Basics of Counting As we have seen, one way to count the number of objects in a finite set S is to produce a one-to-one correspondence.
Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.
College of Information Technology & Design
Great Theoretical Ideas in Computer Science.
5.4 Counting Methods Objectives: By the end of this section, I will be able to… 1) Apply the Multiplication Rule for Counting to solve certain counting.
Counting (Combinatorics) 1.
Counting II: Recurring Problems And Correspondences Great Theoretical Ideas In Computer Science Steven RudichCS Spring 2004 Lecture 10Feb 12, 2004Carnegie.
1 Section 4.1 Basics of Counting. 2 Basic Counting Principles: Sum Rule Suppose you have two tasks to perform: –The first task can be done in n 1 ways;
Probability and combinatorics Notes from Virtual Laboratories in Probability and Statistics.
Combinations We should use permutation where order matters
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Chapter 11 and 12 Review JEOPARDY -Algebra 2-.
Divisibility Rules How do we know when we can divide one number into another exactly?
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Section 2: The Multiplication Rule Consider the game of tossing a coin, then rolling a die, then picking a card. One possible event would be (H, 2, 2clubs).
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Combinatorics.
Exam 1 Review 5.1, , 8.1, 8.2.
Warm up!If you flip a coin 6 times, how many different outcomes are there?
Discrete Mathematics CS 2610 March 26, 2009 Skip: structural induction generalized induction Skip section 4.5.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Chapter 8 Counting Principles: Further Probability Topics Section 8.2 Combinations.
Sequences and Series. Quick Review.
Basic Counting Lecture 12: Oct 28. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations,
Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Unit 4 – Combinatorics and Probability Section 4.1 – Multiplication, Addition, and Complement Calculator Required.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Probability Counting Methods. Do Now: Find the probablity of: Rolling a 4 on a die Rolling a “hard eight” (2 - 4’s) on a pair of dice.
1 CSC 321: Data Structures Fall 2013 Counting and problem solving  mappings, bijection rule  sequences, product rule, sum rule  generalized product.
March 10,  Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound.
Basic Probability Section 7.1. Definitions Sample Space: The set of all possible outcomes in a given experiment or situation Often denoted by S Event:
The Basics of Counting Section 6.1.
Section Section Summary The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams.
Discrete Mathematics for Computer Science. + + ( ) + ( ) = ? Counting II: Recurring Problems and Correspondences Chapter 9 slides 1-54.
ICS 253: Discrete Structures I Discrete Probability King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Suppose I have two fair dice.
Copyright © Cengage Learning. All rights reserved. Elementary Probability Theory 4.
Section 11.8 GEOMETRIC PROBABILITY. General Probability.
Counting II: Recurring Problems And Correspondences Great Theoretical Ideas In Computer Science John LaffertyCS Fall 2005 Lecture 7Sept 20, 2005Carnegie.
Unit VI Discrete Structures Permutations and Combinations SE (Comp.Engg.)
GamblingGambling What are the odds? Jessica Judd.
Introduction to Discrete Probability Epp, section 6.x CS 202.
Probability and Counting Rules
 Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound events  Independent.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
CS 104: Discrete Mathematics
Quiz: Draw the unit circle: Include: (1)All “nice” angles in degrees (2) All “nice” angles in radians (3) The (x, y) pairs for each point on the unit circle.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
1 2.3 Counting Sample Points (6)(6)(6)= 216 Example: How many outcome sequences are possible when a die is rolled three times?
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
Section 12.3 Conditional Probability. Activity #1 Suppose five cards are drawn from a standard deck of playing cards without replacement. What is the.
ICS 253: Discrete Structures I
CSC 321: Data Structures Fall 2015 Counting and problem solving
Sequences, Series, and Probability
One, two, three, we’re… Counting.
Object of the game Yahtzee Large straight Small straight Full house
CS100: Discrete structures
Discrete Structures for Computer Science
8.3 Counting Apply the fundamental counting principle
Basic Counting.
Object of the game Yahtzee Large straight Small straight Full house
Basic Counting Lecture 9: Nov 5, 6.
Counting II: Recurring Problems And Correspondences
Discrete Structures Counting.
Object of the game Yahtzee Large straight Small straight Full house
Object of the game Yahtzee Large straight Small straight Full house
Presentation transcript:

Section 10.1 and 10.2

Hand Back Exam #3 The class average was much better on this exam (no adjustments necessary). Activity 0: –Discuss problems 2 and 4 with your partners.

Problem #2 Given the set A = {1, 2, 3}, what is the value of P(A),where P denotes the power set? How many elements would be in P(B) if B = {a,b,c,d,e} ?

Problem #4 Suppose X = {a,b} and Y={x,y}. – Find X x Y How many elements would be in X x Z if Z = {1,2,3,4,5} ?

Transition Both of these problems actually connect with the material we will study for the rest of the semester. –Counting (and Probability) Counting is the basis of an entire course: –Math 3530 Combinatorics –Catalog description: Various ways to enumerate elements of a set.

Activity 1 A “Full House” in the game Yahtzee is when you roll three dice with one number and one dice with a second number.

Activity 1 How many different “Full Houses” are possible? In how many ways can you ROLL a Full House with one roll of five dice?

How many different “Full Houses” are possible? This one is fairly easy: –There are six choices for the “three of a kind” –There are five choices for the “two of a kind” –6*5 = 30

In how many ways can you ROLL a Full House with one roll of five dice? This is actually harder than I would expect you to be able to do right now. We will come back to this one a little bit later.

The Product Rule If you are finding ways to combine one element each from a sequence of sets (one of this AND one of this AND one of this…) the number of combinations is the product of the cardinality of each of the sets.

Activity #2 License Plates in Iowa contain three letters of the alphabet followed by three digits. How many license plates are possible?

The Sum Rule If you are finding ways to select one element each from a sequence of sets (one of this OR one of this OR one of this…) the number of combinations is the sum of the cardinality of each of the sets.

Activity #3 John has room for one more LAC class in his schedule and he still needs to take a course from category 1A and 1C –1A {ENG 1005, ENG 2015, ENG 2120} and –1C {CS 1025, Math 1100, Math 1420, Stat 1772, Stat 1774} In how many ways can he select a course for his schedule?

Activity #4 A password on a computer system consists of six, seven, or eight characters. Each of these characters must be a digit or a letter of the alphabet. How many possible passwords exist?

The Bijection Rule - Background Sometimes it is hard to calculate the exact number of elements in one set. BUT if we can show that the given set has a bijection with another, countable set, then we can use that information to our advantage.

The Bijection Rule A function f from a set S to a set T is called a bijection if and only if it has a well defined inverse function. –That is, there must also be a mapping from T to S.

The K-to-1 Rule Sometimes the function isn’t one-to-one but K-to-1.

Activity #5 I hand out gift bags at my workshops. There are six bags per box. Yesterday I needed five boxes. How many bags did I hand out?

Activity #6 Student ID numbers at UNI are six consecutive digits. –How many total ID numbers are possible? –How many of those consist of all the same digit? –How many of those consist of exactly five consecutive “same” digits (such as )?