{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CSF10l14

CSF10l14 - Lecture 14 CS336 Product r ule Suppose that a...

This preview shows pages 1–2. Sign up to view the full content.

1 Lecture 14 CS336 Basics of Counting 1 Basic Counting Principles Product rule: Suppose that a procedure can be broken down into a sequence of two tasks where there are n 1 ways to do the first task and n 2 ways of doing the second, then there are n 1 n 2 ways to do the procedure. Sum rule: If a task can be done either in n 1 ways or n 2 way then there are n 1 +n 2 ways to do the task. Example A multiple-choice test contains 10 questions. There are 4 possible answers for each question. How many ways can a student answer the questions on the test if the student answers every question? How many ways can a student answer the test if the student can leave answers blank? Example How many different three-letter initials are there that begin with an A? Example How many bit strings are there of length 6 or less? Example How many strings of length eight English letters are there If letters can be repeated? if no letter can be repeated?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 4

CSF10l14 - Lecture 14 CS336 Product r ule Suppose that a...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online