0% found this document useful (0 votes)
246 views

236 - Tutorial Manual PDF

This document outlines the syllabus and schedule for a 15-week combinatorial analysis course. The course introduces foundational topics like sets, counting principles, probability, and graph theory. It is assessed through 10 assignments, 2 quizzes, and class work conducted during weekly tutorials. Assignments are due each week and cover topics like permutations, combinations, and generating functions. The course aims to teach students to define, describe, calculate, evaluate, recognize, demonstrate, and show various standard combinatorial concepts and problems.

Uploaded by

Dr Sana KKU
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
246 views

236 - Tutorial Manual PDF

This document outlines the syllabus and schedule for a 15-week combinatorial analysis course. The course introduces foundational topics like sets, counting principles, probability, and graph theory. It is assessed through 10 assignments, 2 quizzes, and class work conducted during weekly tutorials. Assignments are due each week and cover topics like permutations, combinations, and generating functions. The course aims to teach students to define, describe, calculate, evaluate, recognize, demonstrate, and show various standard combinatorial concepts and problems.

Uploaded by

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

King Khalid University Lab Manual

Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

236CSM-3

Combinatorial Analysis of Computer

Tutorial Manual
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Course Syllabus
SYLLABUS AND SCHEDULE FOR THEORY COURSE

Chapter No.
Week Topic Text Reference
& Page No.

1-2 Introduction to Combinatorics:


Types of Combinatorics, Applications of Combinatorics, Applied
Chapter-1,
Introduction to set theory: Sets, Relations & Maps, basic notations, Combinatorics by
Pages 1-24,
Cartesian product countable & uncountable, set operations, Fred S. Roberts
principle of addition and multiplication.

3-4 Chapter-2
Basic Counting Principles, Counting methods, Sum rules, and Applied
Product rules, Permutation and Combinations, Binomial Combinatorics by Page 13-20,
Expression. Fred S. Roberts
Pages 40-62

5-6 Enumerative Chapter-2


Probability: Probability concept and methods, Principle of
Combinatorics by
Inclusion and Exclusion. Page 33-40,
Charalambos A

7-8 Pigeonhole Principle, Generalized Pigeonhole Principle, Enumerative


Page 277 to
Derangements, Catalan Numbers, Stirling formula and Bell Combinatorics by
318
Number. Charalambos A

9-10 Generating Functions:


Applied Chapter-5
Recursion and generating function, ordinary and exponential Combinatorics by
generating functions, probability generating functions, recurrence Fred S. Roberts Page 149-207
relations.

11-12 Partially order sets:


Poset, Partially Order relation, Lattices and Semi Lattice, Introduction to
Page 110 to
Properties of Lattices, Lattice as Algebraic system, Hesse Diagram, Combinatorics by
114
Dilworth's theorem, Boolean Algebra, Properties of Boolean Author: Richard A
Algebra.

13-14 Graph Theory:


Applied
Graphs, Connected graph, Subgraph, weighted graph, Cyclic graph, Combinatorics by Page 76-131
trees, Spanning tree, minimum spanning tree, coloring of graphs Fred S. Roberts
and Ramsey's theorem..

15 Revision
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Course Description (As per course Specification)


This course introduces the combinatorial analysis as an area of mathematics
concerned with solving problems for which the number of possibilities is
finite. The covered topics are: basic counting methods, generating functions,
Probability and Pigeonhole Principle.

 Course Learning Outcomes (As per syllabus)


1 Define the concepts of Permutation, Combinations, Binomial
Distribution, and Generating Functions.
2 Describe the concepts of probability, inclusion and exclusion
3 Calculate the Basic counting principal problems, inequalities, and
Sterling numbers
4 Evaluate the pigeon hole principle and generating function with relevant
problems
5 Recognize with various standard combinatorial objects and sequences
problems like Permutations, Combinations, Catalan numbers
6 Demonstrate recursions, generating functions and explicit expressions
for combinatorial defined number sequences
7 Show the basic definitions and concepts of graph theory and tree diagram

Tutorial Description and Week-wise Practical Schedule (15 weeks)


Topics Weeks
Introduction 1
Problems related to: Sets, Relations & Maps 2
Problems related to: Basic Counting Principles, Counting 3-6
methods, Sum rules, and Product rules, Permutation and
Combinations, Binomial Expression.
Problems related to: Probability: Probability concept and 7-8
methods, Principle of Inclusion and Exclusion.
Problems related to: Pigeonhole Principle, Generalized Pigeonhole 9-11
Principle, Derangements, Catalan Numbers, Sterling formula and
Bell Number. Recursion and generating function, ordinary and
exponential generating functions
Problems related to: Graphs, Connected graph, Sub-graph, 12-14
weighted graph, Cyclic graph, trees, Spanning tree, minimum
spanning tree, coloring of graphs
Revision 15
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Marks Distribution with assessment criteria

S. No Assessment Week Due Marks


1 Assignment I Week 2 10
2 Assignment II Week 3 10
3 Assignment III Week 4 10
4 Assignment IV Week 5 10
5 Quiz -1 Week 5 10
6 Assignment V Week 7 10
7 Assignment VI Week 8 10
8 Assignment VII Week 9 10
9 Assignment VIII Week 10 10
10 Quiz- 2 Week 10 10
11 Assignment IX Week 12 10
12 Assignment X Week 13 10
Revision
Total Marks (10) =(Sum/120)*10

Instructions for Activities:


1. Assignment must be evaluated by continuous week
2. Class work must be conducted during tutorial timing.
3. Quiz will be conducted with 10 questions for full one hour

Instructions for assessment methods:


1. Assignment should be unique and solved completely
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 1)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic
 Problems (Examples)

1. Which of the following are well-defined sets?

(a) All the colors in the rainbow.


(b) All the points that lie on a straight line.
(c) All the honest members in the family.
(d) All the consonants of the English alphabet.
(e) All the tall boys of the school.
(f) All the efficient doctors of the hospital.
(g) All the hardworking teachers in a school.
(h) All the prime numbers less than 100.
(i) All the letters in the word GEOMETRY.

2. Let A = (a, b, c, d, e, f}. Insert the appropriate symbol ∈ or ∉ in the blank


space.

(a) d __ A (b) y __ A (c) m __ A

3. Write the following sets in the set builder form.

(a) A = {2, 4, 6, 8} (b) B = {3, 9, 27, 81} (c) C = {1, 4, 9, 16, 25}

4. Write the following sets in the roster form.

(a) A = {x : x ∈ W, x ≤ 5} (b) B = {x : x ∈ I, -3 < x < 3)


(c) C = {x : x is divisible by 12}

5. Which of the following are the examples of an empty set?

(a) The set of even natural numbers divisible by 3.


(b) The set of all prime numbers divisible by 2.
(c) {x : x ∈ N, 5 < x < 6}
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

6. Classify the following as finite and infinite sets.

(a) The set of days in a week


(b) A = {x : x ∈ N x > 1}
(c) B = {x : x is an even prime number}

7. Write down the union and intersection of the following pairs of sets:

(i) A = {1, 2, 3, 4, 5, 6} B = {1, 3, 5, 7, 9}


(ii) X = {a, b, c, d, e} Y = {c, e, f, g}

8. Let A = set of natural numbers less than 8,


B = {even natural numbers less than 12}
C = {Multiples of 3 between 5 and 15}
and D = {Multiples of 4 greater than 6 and less than 20};

Find: (i) B ∪ C (ii) A ∩ C (iii) (B ∩ C) ∪ A (iv) (D ∪ A) ∩ B

9. Show by Venn diagrams the relationship between the following pairs of sets:

(i) X = {letters of alphabet upto ‘h’}; Y = {all the vowels of alphabet}


(ii) A = {even numbers less than 10}; B = {odd numbers less than 10}
(iii) C = {multiple of 5 less than 30}; D = {multiple of 3 less than 20}

10. Let M= {Natural numbers between 10 and 40; each divisible by 3}


N = {Natural numbers upto 40; each divisible by 4}.

(i) Write each in roster form.


(ii) Draw a Venn-diagram showing the relationship between sets M and set N.

 Exercises (Class Activity)

1. If x= {b, c, d, e} y={f, g, e, h } z={i ,j, k, b, g } find


1. xUyUz
2. yUz
3. xUz
4. x∩z
5. x∩yUz
6. x∩y∩z
7. xUy∩z

2. If p={1, 2, 3, 4, 5 } q={3, 4, 6, 7 , 8 } r={4, 5, 6, 9, 10 } find


1. (p U q) ∩ r
2. (p ∩ q) U r
3. (p U q) U (q U r)
4. (p ∩ r) U (q ∩ r)
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

5. p ∩ (q ∩ r)
6. r ∩ ( q ∩ p)
7. (p U q) ∩ (r ∩ q)

3. If U= {4, 5, 6, 7, 8}a= { 4, 5, 6} and b= {4, 7, 8} find


i. Complement a.
ii. Complement b.
iii. Join a and b.

4. Solve using the addition principle. 2x + 5 < x+4. The solution set is {x|x< ?}

5. Solve using the multiplication principle.5x>-4

 Assignment I

1. Let A = (a, b, c, d, e, f}. Insert the appropriate symbol ∈ or ∉ in the blank


space.
(a) a __ A (b) e __ A (c) x __ A

2. Write the following sets in the set builder form.

(a) D = {1, 3, 5,.....}


(b) E = {4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, ......., 52}
(c) F = {-10, ......, -3, -2, -1, 0, 1, 2, …..., 5}

3. Write the following sets in the roster form.

(a) D = {x : x = 3p, p ∈ W, p ≤ 3}
(b) E = {x : x = a2, a ∈ N, 3 < a < 7}
(c) F = {x : x = n/(n + 1), n ∈ N and n ≤ 4}
(d) G = {x : x ∈ N, 3x - 2 < 5}

4. Which of the following are the examples of an empty set?

(a) The set of odd natural numbers divisible by 2


(b) B = {O}
(c) C = { }
(d) D = {x : x ∈ R, x2 = -1}

5. Classify the following as finite and infinite sets.

(a) C = {x : x is a multiple of 5}
(b) D = {x : x is a factor of 30}
(c) P = {x : x ∈ Z, x < -1}
(d) The set of all letters in the English alphabet
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

6. Write down the union and intersection of the following pairs of sets:

(iii) P = {x : x is a multiple of 2 between 9 and 21}


Q = {x : x is a multiple of 3 between 10 and 20}

(iv) M = {letters in the word ‘COMPUTER’}


N = {letters in the word ‘CALCULATOR’}

7. Let A = set of natural numbers less than 8,


B = {even natural numbers less than 12}
C = {Multiples of 3 between 5 and 15}
and D = {Multiples of 4 greater than 6 and less than 20};
(i) A ∪ D (iii) (A ∩ C) ∪ (B ∩ D) (iv) (B ∪ D) ∩ (C ∪ A)

8. Show by Venn diagrams the relationship between the following pairs of sets:

(i) M = {all girls of your school}; N = {all boys of your school}


(ii) P = {boys who play hockey}; Q = {boys who play cricket}
(iii) R = {people who speak Hindi}; S = {people who speak Tamil}
(iv) U = {people who live in India}; V = {people who live in Bihar}
(v) E = {men}; F = {kings}
(vi) S = {all animals}; T = {people who wear shirts}

9. If: A = Set of natural numbers, B = Set of prime numbers and


C = Set of even prime numbers.
Draw Venn-diagram showing the relationship among the given sets A, B and C

10. From the given Venn diagram, find the following sets:

(i) A
(ii) B
(iii) A ∪ B
(iv) A ∩ B
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 2)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Permutations)
 Problems
1. In a multinational company, four posts are vacant. 30 candidates apply for the
post. In how many ways can the selection is made if
a. There is no restriction
b. A particular candidate is always included
c. A particular candidate is always excluded.
2. If five digits 1, 2, 3, 4, 5 are being given and a three digit code has to be made
from it if the repetition of digits is allowed then how many such codes can be
formed.
3. Find the no. of permutations of letters of the word APPLE.
4. Find the no. of permutations of letters of the word SUPERINTENDENT
5. Find the no. of permutations of letters of the word ASSASSINATION.
6. An encyclopedia has eight volumes. In how many ways can the eight volumes be
replaced on the shelf?
7. Assuming that any arrangement of letters forms a 'word', how many 'words' of any
length can be formed from the letters of the word SQUARE?
8. A restaurant offers 5 choices of appetizer, 10 choices of main meal and 4 choices
of dessert. A customer can choose to eat just one course, or two different courses,
or all three courses. Assuming all choices are available, how many different
possible meals does the restaurant offer?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Exercise
1. In how many ways the word HOLIDAY can be rearranged such that the letter I
will always come to the left of letter L?

2. There are 6 people who will sit in a row but out of them Ronnie will always be left
of Annie and Rachel will always be right of Annie. In how many ways such
arrangement can be done?

3. In how many different ways can the letters of the word 'LEADING' be arranged in
such a way that the vowels always come together?

4. In how many different ways can the letters of the word 'CORPORATION' be
arranged so that the vowels always come together?

5. Abdur Rahman has a 5-digit pass code to access his e-mail account. The code is
made up of the even digits 2, 4, 6,8, and 0. Each digit can be used only once. How
many different pass codes could Abdur Rahman have?

 Assignment -II
1. A father, mother, 2 boys, and 3 girls are asked to line up for a photograph.
Determine the number of ways they can line up if
a. There are no restrictions
b. The parents stand together
c. The parents do not stand together
d. All the females stand together
2. In how many ways can the letters of the word 'LEADER' be arranged?
3. How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9,
which are divisible by 5 and none of the digits is repeated?

4. In how many different ways can the letters of the word 'DETAIL' be arranged
in such a way that the vowels occupy only the odd positions?

5. How many 4-letter words with or without meaning, can be formed out of the
letters of the word, 'LOGARITHMS', if repetition of letters is not allowed?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 3)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Permutations)

 Problems
1. In how many different ways can the letters of the word 'MATHEMATICS' be
arranged so that the vowels always come together?

2. A password consists of two letters of the alphabet followed by three digits chosen
from 0 to 9. Repeats are allowed. How many different possible passwords are
there?

3. How many permutations of 3 different digits are there, chosen from the ten digits
0 to 9 inclusive?

4. How many permutations of 4 different letters are there, chosen from the twenty
six letters of the alphabet (repetition is not allowed)? Or A password consists of
four different letters of the alphabet. How many different possible passwords are
there?

5. In how many different ways can the letters of the word 'ALGORITHM' be
arranged in such a way that the vowels occupy only the odd positions, and in how
many ways word 'COMPUTER' be arranged so that the vowels always come
together?

6. In how many different ways can the letters of the word 'LEADING' be arranged in
such a way that the vowels always come together?
7. Ellie want to change her password which is ELLIE9 but with same letters and
number. In how many ways she can do that?

8. Determining the number of ways a selection from a set can be made when the
order does not matter.
A tray contains 4 different cookies. (Let the set {A, B, C, D})
a. How many ways can you select and arrange 3 cookies from the tray?
b. How many ways can you select 3 cookies from the tray if order doesn’t matter?
c. How are the answers to questions a. and b. related?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Exercise
1. A license plate begins with three letters. If the possible letters are A, B, C, D and
E, how many different permutations of these letters can be made if no letter is
used more than once?

2. A zip code contains 5 digits. How many different zip codes can be made with the
digits 0–9 if no digit is used more than once and the first digit is not 0?

3. In how many ways can the letters in the word "HELLO" be arranged where the L's
are together?

4. How many ways can the letters in the word 'PARALLEL" be arranged if the
letters P and R are together?

5. How many different arrangements can be made using two of the letters of the
word TEXAS if no letter is to be used more than once?

 Assignment III
1. 10 students have appeared in a test in which the top three will get a prize. How
many possible ways are there to get the prize winners?

2. How many different words can be formed with the letters of the word ‘SUPER’
such that the vowels always come together?

3. Find the number of different words that can be formed with the letters of the word
‘BUTTER’ so that the vowels are always together.

4. A special type of password consists of four different letters of the alphabet, where
each letter is used only once. How many different possible passwords are there?

5. A question paper consists of 10 questions divided into two parts A and B. Each
part contains five questions. A candidate is required to attempt six questions in all
of which at least 2 should be from part A and at least 2 from part B. In how many
ways can the candidate select the questions if he can answer all questions equally
well?

6. In how many of the distinct permutations of the letters in MISSISSIPPI do the


four I’s not come together?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 4)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Combinations and Binomial Distribution)

 Problems
1. A committee of 5 members has to be chosen from 25 members in an organization.
Find out how, many different combinations are possible.

2. Find the combinations of 2 letter words taken from word "HUNT".


Number of letters in word “HUNT” =n=4

3. In how many ways we can choose 3 books from a set of 5 books. Number of
books to choose from =n=5 and Number of letters to choose =r=3

4. Among a set of 5 black balls and 3 red balls, how many selections of 5 balls can
be made such that at least 3 of them are black balls

5. How many 4 digit numbers that are divisible by 10 can be formed from the
numbers 3, 5, 7, 8, 9, 0 such that no number repeats?

6. 16 teams enter a competition. They are divided up into four Pools (A, B, C and
D) of four teams each. Every team plays one match against the other teams in its
Pool. After the Pool matches are completed:

7. From a group of 7 men and 6 women, five persons are to be selected to form a
committee so that at least 3 men are there on the committee. In how many ways
can it be done?

8. A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can
3 balls be drawn from the box, if at least one black ball is to be included in the
draw?

9. A company has to select 3 officers from a pool of 6 candidates. How many


different ways can this be done if:
(a) The officers are distinct? (b) The officers are not distinct?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Exercise
1. Find the values of 14C5, 10C8 and C(7, 2).
2. Find the number of ways of selecting 9 balls from 6 red balls, 5 white balls and 5
blue balls if each selection consists of 3 balls of each color?
3. In a deck of 52 cards, there are 4 aces. A combination of 5 cards have to be made
in which there is exactly one ace?
4. In how many ways can one select a cricket team of eleven from 17 players in
which only 5 players can bowl if each cricket team of 11 must include exactly 4
bowlers?
5. If 4 men are to be selected from 6 men and 3 women are to be selected from 5
women, how many ways can these people be arranged in a line if
a) There is no restriction?
b) The four men remain together?
c) A man is at the beginning of the line?
d) A man is at the beginning of the line and a woman is at the end of the line?
e) The men and women alternate?

 Assignment IV

 Determine n if

 The Library of Science Book Club offers three books from a list of 42. If you
circle three choices from a list of 42 numbers on a postcard, how many
possible choices are there?

 Given a class of 12 girls and 10 boys.


o In how many ways can a committee of five consisting of 3 girls and 2
boys be chosen?
o What is the probability that a committee of five, chosen at random
from the class, consists of three girls and two boys?
o How many of the possible committees of five have no boys?(i.e.
consists only of girls)
o What is the probability that a committee of five, chosen at random
from the class, consists only of girls?
 In a game of poker, 5 cards are dealt from a pack of 52. How many possible
poker hands are there?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 5)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Combinations and Binomial Distribution)

 Problems
1. Find the coefficient of x9y3 in the equation of (2x-3y)12

2. Write out the expansion of (x + y)6 .

3. Write out the expansion of (x - 5)4 .

4. Write out the expansion of (1 - x)7 .

 Exercise

1. Write out the expansion of (x2 +3y)4 .

2. Find the 4th term in the expansion (x-y)7

 Assignment V

1. Find the first four terms in the expansion of (2-3x)8

2. Find the coefficient of x4 in the expansion of (x+2y)10

3. Find the coefficient of x2y2 in the binomial expansion of (x+2y)10

4. Write out the expansion of (2x + 7y)3 .

5. At Scrabble the letters QWYPKGDZXBM are left in the bag. In how many

ways can you draw out four of them?


King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 6 )

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Probability)
 Problems
1. A die is rolled, find the probability that an even number is obtained.

2. In a certain test 5 out of 20 students scored an ‘A’. We chose three students at


random out of the 20 students without replacement. Find the probability that
all three are the ones who scored an ‘A’.

3. Two coins are tossed, find the probability that two heads are obtained.
Note: Each coin has two possible outcomes H (heads) and T (Tails).

4. Two dice are rolled, find the probability that the sum is
a) equal to 1
b) equal to 4
c) less than 13

5. A die is rolled and a coin is tossed, find the probability that the die shows an
odd number and the coin shows a head.

6. Two cards have been drawn from the deck of 52 cards without replacing the
first one back. Find the probability of getting first card as king and second
card as queen

7. If a card is drawn at random from a deck of 52, what is the probability that it is
an ace?

8. Suppose a coin is tossed 5 times. What is the probability that there will be at
least 2 heads?
9. Calculate the probability of getting a) two heads or three heads and b) two
heads or two tails in six tosses of a coin.
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Exercise
1. A card is drawn at random from a deck of cards. Find the probability of
getting the 3 of diamond.

2. A card is drawn at random from a deck of cards. Find the probability of


getting a queen.

3. A jar contains 3 red marbles, 7 green marbles and 10 white marbles. If a


marble is drawn from the jar at random, what is the probability that this
marble is white?

4. The blood groups of 200 people are distributed as follows: 50 have type A
blood, 65 have B blood type, 70 have O blood type and 15 have type AB
blood. If a person from this group is selected at random, what is the
probability that this person has O blood type?

5. A die is rolled and a coin is tossed, find the probability that the die shows an
odd number and the coin shows a head

 Assignment VI
1. A die is thrown. Describe the following events:
a. A: a number less than 7
b. B: a number greater than 7
c. C: a multiple of 3
d. D: a number less than 4
e. E: an even number greater than 4
f. F: a number not less than 3
Also find AUB, AB, BUC, EF

2. Consider the example of finding the probability of selecting a black card or a 6


from a deck of 52 cards.
3. A box contains 4 chocobars and 4 ice creams. Tom eats 3 of them, by
randomly choosing. What is the probability of choosing 2 chocobars and 1 ice-
cream?

4. When two dice are rolled, find the probability of getting a greater number on
the first die than the one on the second, given that the sum should equal 8

5. 4 six-sided dice are rolled. What is the probability that the numbers they show
are all different?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 7 )

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Probability)
 Problems
1. Calculate the number of positive integers less than or equal to 100 that are
divisible by 3 or by 5.

2. A bag contains 12 white and 18 black balls. Two balls are drawn in succession
without replacement. What is the probability that first is white and second is
black?

3. What is the probability that a number selected from numbers 1,2,3,...,30, is


prime number, when each of the given numbers is equally likely to be
selected?

4. A bag contains 21 toys numbered 1 to 21. A toy is drawn and then another toy
is drawn without replacement. Find the probability that both toys will show
even numbers

5. There are 10 counters in a bag: 3 are red, 2 are blue and 5 are green.
The contents of the bag are shaken before Maxine randomly chooses one
counter from the bag. What is the probability that she doesn't pick a red
counter?

6. A die is thrown once. What is the probability that the score is a factor of 6?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Exercises
 There are three pink pencils, two blue pencils, and one green pencil. If one pencil
is picked randomly, what is the theoretical probability it will be blue?

 Two dice are thrown and the sum is seven points.


a. Shade the squares on an area diagram where this outcome could occur.
b. What is the probability of getting seven points?
c. If the total was seven points, what is the probability that one of the dice was
a six?

 What is the probability of spinning:

a. pink or blue? b. orange or pink?

c. red or orange? d. red or blue?

 If each section in each spinner is the same size, what is the probability of getting a
black truck?

 Assignment VII

1. The diagram shows a spinner made up of a piece of card in the shape of a


regular pentagon, with a toothpick pushed through its center. The five
triangles are numbered from 1 to 5. The spinner is spun until it lands on one
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

of the five edges of the pentagon. What is the probability that the number it
lands on is odd?

2. Each of the letters of the word MISSISSIPPI are written on separate pieces
of paper that are then folded, put in a hat, and mixed thoroughly.
One piece of paper is chosen (without looking) from the hat. What is the
probability it is an I?

3. A fair coin is tossed three times. What is the probability of obtaining one
Head and two Tails? (A fair coin is one that is not loaded, so there is an equal
chance of it landing Heads up or Tails up.)

4. A committee of three is chosen from five councillors - Adams, Burke, Cobb,


Dilby and Evans. What is the probability Burke is on the committee?

5. The die has 8 equal faces marked with the numbers 1 to 8. If the die is
thrown once, what is the probability that the face that lands uppermost has a
prime number?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 8)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Pigeon Hole Principle)
 Problems
1. In an examination of 20 marks as the maximum and if there are 50 students
writing the examination then there will be at least 2 students who are having same
mark. (There should be only integer values as marks)

2. 51 numbers are chosen from the integers between 1 and 100 inclusively. Prove
that 2 of chosen integers are consecutive.

3. Calculate Derangement for n=5?

4. Suppose that 4 cards labeled 1 to 4 are placed randomly into 4 boxes also labeled
1 to 4, one card per box. What is the probability that no card gets placed into a box
having the same label as the card?
5. If you have 7 pairs of parentheses then how many valid groups of them one can
make using catalan numbers?
5 
6. Find  
4 
 Exercise
1. Find the number of ways of putting 5 letters in the envelope in such a way that
no letter is being put in the right envelope.

2. Suppose that a professor has graded 4 tests for 4 students – student A, student
B, student C, and student D. However, the professor mixed up the tests when
handing them back, and now none of the students has the correct test. How
many ways could the professor have mixed them all up in this way?
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

3. In how many ways can the product of n ordered number be calculated by


pairs? For example, the possible ways for are
and .

8 
4. Find  
4 

 Assignment VIII
1. Given n letters and n addressed envelopes, in how many ways can the letters
be placed in the envelopes so that no letter is in the correct envelope?

2. How to use the Catalan numbers to count the number of rooted binary trees
with n internal nodes

3. Find the derangement for n= 9

4. Explain how Catalan number concept applied in polygon triangulation. If you


count the number of ways to triangulate a regular polygon with n + 2 sides,
you also obtain the Catalan numbers.

12
5. Find  
4
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 9)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Generating function)
 Problems
1. What is the generating function for the sequence 1, 1, 1,...

2. What is the generating function for the sequence 1, 3,3, 1

3. What is the generating function for the sequence 1, 2, 4,8,...

1
4. Expand
(1  5 x) 2

5. Write the probability Generating function for throw a die and toss a two coin?

6. Draw a Hasse diagram for (A,) (divisibility relation), where A = {1, 2, 3, 4, 5,


6, 7, 8}

7. Give the laws for semi lattice

 Exercise
1. What is the generating function for the sequence 1, 4,6 4,1

1 x
2. Expand
(1  5 x) 2

3. Write the probability Generating function for throw two die and toss a coin?

4. Draw a Hasse diagram for (A,) (divisibility relation), where A = {2, 3, 4, 5, 6,


30, 60}
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Assignment IX
1. Write the Generating function for 1,-1,1,-1,1,-1,1….

2. Write the Generating function for 1,0,1, 0,1, 0,1….

3. Add

4. Find the generating function for

1  5x
5. Expand
(1  5 x) 2
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 10)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Pigeon Hole Principle and Generating function)

 Problems

1. Expand

2. Let's say you are sorting mail, you have 5 letters from a credit card company,
one for each person and 5 mailboxes on the wall. How many ways are there
for every person to not receive the incorrect offer from the credit card
company? Assuming every offer is tailored to each individual.
3. Find a sequence of n = 4 parentheses that is not well-formed and a sequence
that is well-formed.
4. Find the well-formed sequences of parentheses of length 2n = 6.
5. A rooted binary tree is a tree with one root node, where each node has either
zero or two branches descending from it. A node is internal if it has two nodes
coming from it. How many rooted binary trees are there with n internal
nodes?

 Exercise
1. Write the sequence for 2,0,2,0,2,0…
2. Calculate C10 ? (using Catalan numbers)
3. Calculate D9 (using Deranagments)
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Assignment X
1. Explain the concept of Polygon Triangulation?

2. Describe the Catalan numbers using mountain ranges?

3. Write the complete table for striling number calculations?

4. What are the different generating function and explain?

5. How to draw Hasse Diagram?


King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 11)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Graph theory)
 Problems
1. Draw all the graphs that have V = {a, b, c} as set of vertices.
2. In each of the following graphs, find paths of length 9 and 11, and cycles of
length 5, 6, 8 and 9, if possible.

3. Prove that the sum of the degrees of the vertices of any finite graph is even
with example
4. Find the indegree and outdegree of all vertex of following graph

5. Write the adjacent vertex and adjacent edges of all in the following graph
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Exercises
1. Find the Complement of given graph

2. Give the connectivity matrix of the following graph

3. Give sub graph of the following graph

4. In the following graph find the path, open walk, closed walk, trial

 Assignment XI
1. Find the degree of every vertex of this graph. When two lines cross, but there
isn’t a dot, that does not count as a vertex, so this graph has only 6 vertices
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

2. Suppose that in a group of 5 people: A, B, C, D, and E, the following pairs of


people are acquainted with each other. A and C, A and D, B and C, C and D,
C and E
a. Draw a graph G to represent this situation.
b. List the vertex set, and the edge set, using set notation. In other words,
show sets Vand E for the vertices and edges, respectively, in G = {V,
E}.
c. Draw an adjacency matrix for G.
3. Find the all paths between J to B from the following graph

4. From the following graph try to find the shortest path between all cities

5. Is the graph a tree? if not, find a cycle.


King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

Tutorial Session / Exercise (Week 12)

 Objectives / Statement Purpose:


To exercise the students on the particular topic through more examples
 Activity Outcomes:
Solving problems

 Instructions for solving problems :


Learning the theory and definitions of particular topic which help to solve the
problems in the specific topic (Graph theory)
 Problems
1. In problems 1–4, determine whether the given graph is a tree or not.

2. For the following graph find U,, and Complement of two graphs
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

3. Find the complement of following graphs


a)

G: G':

b)

4. For the graph below:

a) A snow plow starts at vertex 0 and must return to vertex 0 using a route
which visits each edge at least once and repeats a minimum number of
edges. Find such a route and how many repeated edges does it have?
Assume that the edges all have the length, say length 1.

b) Repeat doing question a. under the assumption that vertical edges have
length 1, horizontal edges have length 5, and the "diagonal edges" have
length 3.
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Exercise

1. For the graph below:

What is the shortest route from 0 to 3? What is the shortest route from 0 to 8?
(Route length is the sum of the weights of the edges in the route. When no
weight is assigned to an edge the weight is assumed to be 1.)

2.

3. Draw the tree, If a coin is tossed and the number cube is rolled simultaneously
then the probability of getting head on the coin and the number 4

4. Draw a tree for following problem, A box has 1 red ball, 1 green ball and 1
blue ball, 2 balls are drawn from the box one after the other, without replacing
the first ball drawn. Use the tree diagram to find the number of possible
outcomes for the experiment
King Khalid University Lab Manual
Subject : Combinatorial
College of Computer Science
Analysis of Computer
Computer Science Program
Subject Code 236CSM-3

 Assignment XII
1. The given two graphs G = (V1, E1) and G' = (V2, E2), Find (i) G U G',
(ii) G  G', (iii) G  G'

2. For the following graph identify the walk path trail

3. Are the following graph are same? Explain

4. Identify the distance of each vertex from starting node by assuming each edge
has value 1.

You might also like