Scribd
Upload
7 views6 pages

Permutations Involving ABC String

Uploaded by

nivikrishnan2006
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
7 views6 pages

Permutations Involving ABC String

Uploaded by

nivikrishnan2006
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

PERMUTATION

AND
COMBINATIONS
T.L.P : 2.5
1(I) HOW MANY PERMUTATIONS OF
ABCDEFGH CONTAIN STRING ABC?
 Solution:

• The string "ABC" becomes one block


[ABC]
• Remaining letters: D, E, F, G, H (5 single
letters)
• Total = 1 block + 5 letters = 6 distinct
items
• Number of arrangements = 6! = 720
1(II) HOW MANY PERMUTATIONS OF
ABCDEFGH CONTAIN STRING BA AND
GH?
 Solution:

 The string "BA" becomes one block


 The string "GH" becomes one block
 Remaining letters: C, D, E, F(4 single
letter)
 Total = 2 blocks + 4 letters = 6 distinct
items
 Number of arrangements = 6! = 720
[Link]
 The chairs of an auditorium are to be labeled
with an uppercase English letter followed by a
positive integer not exceeding 100. What is the
largest number of chairs that can be labeled
differently?

 Solution:
 Each label = uppercase letter (A–Z) + number
(1–100)
 Number of choices for letter = 26
 Number of choices for number = 100
 Total labels = 26 × 100 = 2600
[Link]

 How many different bit strings are there


of length 9?

 Solution:
 Each of 9 positions can be either 0 or 1
(2 choices)
 Total strings = 2^9 = 512
 Hence, there are 512 different bit
strings of length 9
THANK YOU

You might also like