Scribd
Upload
41 views19 pages

Discrete Structures - Lecture 26, 27

This document provides an introduction to combinatorics and summarizes several basic counting principles: 1. The sum rule states that if one event can occur in m ways and a second in n ways, the total number of ways for one event to occur is m + n. 2. The product rule says that if one event occurs in m ways and a second occurs in n ways for each of the first, the total number of ways for both is mn. 3. The subtraction rule is used when some ways for events to occur are common to both; the total is then m + n - the number of common ways. Several examples illustrate applications of these rules to counting problems involving course selections,

Uploaded by

Aman Wasti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
41 views19 pages

Discrete Structures - Lecture 26, 27

This document provides an introduction to combinatorics and summarizes several basic counting principles: 1. The sum rule states that if one event can occur in m ways and a second in n ways, the total number of ways for one event to occur is m + n. 2. The product rule says that if one event occurs in m ways and a second occurs in n ways for each of the first, the total number of ways for both is mn. 3. The subtraction rule is used when some ways for events to occur are common to both; the total is then m + n - the number of common ways. Several examples illustrate applications of these rules to counting problems involving course selections,

Uploaded by

Aman Wasti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Discrete Mathematics

LECTURE 26, 27
Introduction to
COMBINATORICS
Course Instructor:
1 Rida Memon
COMBINATORICS

 It is the mathematics of counting and arranging objects


with certain properties.

 It is the branch of mathematics dealing with


combinations of objects belonging to a finite set in
accordance with certain constraints.

2
Basic Counting Principles

There are FOUR basic counting principles:

1. The SUM Rule

2. The PRODUCT Rule

3. The SUBTRACTION Rule

4. The DIVISION Rule

3
The SUM Rule

 If one event can occur in m ways and a second event


can occur in n (different) ways, then the total number
of ways in which exactly one of the events (i,e, first or
second) can occur is m+n.

4
Example

Suppose there are 7 different optional courses in


Computer Science and 3 different optional courses in
Mathematics. Then how many choices are available for a
student who wants to take any one optional course.

Solution:
There are 7+3=10 choices available for the student who
wants to take any one optional course.

5
Task 1

 A student can choose a computer project from one of


the three lists. The three lists contain 23, 15 and 19
possible projects, respectively. How many possible
projects are there to choose from?

6
The PRODUCT Rule

 If one event can occur in m ways and for each of these


m ways, a second event can occur in n ways, then the
total number of ways in which exactly both events can
occur is mn.

7
Example

Suppose there are 7 different optional courses in


Computer Science and 3 different optional courses in
Mathematics. Then how many choices are available for a
student who wants to take any one optional course of
each subject. (A total of two courses)

Solution:
There are 7 x 3=21 choices available for the student who
wants to take any one optional course of each subject.

8
Task 3

 The chairs of an auditorium are to be labeled with two


characters, a letter followed by a digit. What is the
largest number of chairs that can be labeled differently?

9
Task 4

 The chairs of an auditorium are to be labeled with two


characters, a letter and a digit in any order. What is the
largest number of chairs that can be labeled differently?

10
Task 6

 Find the number of ways that an organization consisting


of 15 members can elect a president, treasurer and
secretary.

 Note: No person is elected to more than one position.

11
Task 7

 A computer access code word consists of either one,


two or three letters of English alphabets with
repetitions allowed. How many different words are
possible?

12
Task 8

 A computer access code word consists of either one,


two or three letters of English alphabets with no
repetitions allowed. How many different words are
possible?

13
The SUBTRACTION Rule

 If one event can occur in m ways and a second event


can occur in n ways, and some of the ways to do it are
common to both the ways, then the total number of
ways in which exactly one of the events (i,e,, first or
second) can occur is:

m+n-(the number of common ways)

14
Example

How many bit strings of length eight either start with a 1


bit or end with the two bits 00 but not both?

Solution:
So, number of bit strings
according to the given
criteria is:
= 128+64-32 = 160

15
Practice Questions
1.

2.

3.

4.

16
Practice Questions
5.

6.

7.

17
Reading Assignment

 Chapter 6
 Section 6.1
 Page 385 - 394

18
Thanks

 End of Lecture
 Q/As

19

You might also like