SAPTHAGIRICOLLEGEOFENGINEERING
(AffiliatedtoVisvesvarayaTechnologicalUniversity,Belagavi&Approvedby
AICTE,NewDelhi.)
(AccreditedbyNAACwith“A”Grade)
ISO9001 –2015&ISO14001–2015Certified
#14/5,Chikkasandra,HesaraghattaMainRoad,Bengaluru–560057.
Web:[Link],Email:principal@[Link]
Phone:080-28 372800 Fax: 080-28 372797
DEPARTMENT OF MATHEMATICS
Subject: DMS Sub Code: BCS405A
MODULE-4
1. For the integers 1,2,3 … . . 𝑛 there are 11660 derangements 1, 2, 3, 4, 5 appear in first five positions then
find the value of n.
2. Determine number of integers between 1 to 300 which are
i) divisible by exactly two of 5,6,8,
ii) at least two of 5,6,8.
3. Solve 𝑎𝑛 = 2(𝑎𝑛−1 − 𝑎𝑛−2 ) for 𝑛 ≥ 2 given 𝑎0 = 1, 𝑎1 = 2.
4. Out of 30 students of a hostel 15 study history, 8 study economics, 6 study geography and 3 study all the
three subjects. Show that 7 or more study none of the subjects.
5. An apple, a banana, a mango and an orange to be distributed to 4 boys B1, B2, B3, B4. The boys B1 and
B2 do not wish apple, B3 does not want banana or mango, B1 refuses orange. In how many ways
distribution can be made so that all of them are happy.
6. Solve the recurrence relation 𝑎𝑛 − 3𝑎𝑛−1 = 5 × 3𝑛 for 𝑛 ≥ 1 given 𝑎0 = 2.
7. How many integers between 1 to 300 (inclusive) are
i) Divisible by at least one of 5,6,8.
ii) Divisible by none of 5,6,8.
8. Find the rook polynomial for the 3× 3 board by using the expansion formula.
9. Compute derangement of 𝑑4 , 𝑑5 , 𝑑6, , 𝑑7 .
10. Determine the number of positive integers n such that 1 ≤ 𝑛 ≤ 100 and n is not divisible by 2,3 or 5.
11. Find the rook polynomial for the board shown below:
12. The number of virus affected files in a system is 1000(initially) and this increases 250% every 2 hours.
Use recurrence relation to determine the number of virus affected files in the system after one day.
13. There are right letters to eight different people to be placed in eight different addressed envelopes. Find the
number of ways of doing this so that at least one letter gets to the right person.
14. If 𝑎𝑛 is a solution of the recurrence relation:
153 1377
𝑎𝑛+1 = 𝐾𝑎𝑛 for 𝑛 ≥ 0 and 𝑎3 = 49 , 𝑎3 = 2401. What is K?
15. In how many ways can the 26 letters of the English alphabet be permuted so that none of the patterns
CAR, DOG, PUN or BYTE occurs.
16. By using the expansion formula. Obtain the rook polynomial for the board C:
17. If 𝑎0 = 0, 𝑎1 = 1, 𝑎2 = 4, 𝑎4 = 37 satisfy the recurrence relation 𝑎𝑛+2 + 𝑏𝑎𝑛+1 + 𝑐𝑎𝑛 = 0, for 𝑛 ≥ 0.
Find the constants b and c, and solve the relation 𝑎𝑛 .
18. Find the number of permutations of 𝑎, 𝑏, 𝑐, … . 𝑥, 𝑦, 𝑧 in which none of the patterns spin, game, path, or net
occurs.
19. Solve the recurrence relation 𝑎𝑛 + 𝑎𝑛+1 − 6𝑎𝑛+2 = 0 where 𝑛 ≥ 2 and 𝑎0 = −1, 𝑎1 = 8.
20. The number of bacteria in a culture is 1000 (approximately) and this number and this increases 250%
every 2 hours. Use recurrence relation to determine the number of bacteria present after one day.
SAPTHAGIRICOLLEGEOFENGINEERING
(AffiliatedtoVisvesvarayaTechnologicalUniversity,Belagavi&Approvedby
AICTE,NewDelhi.)
(AccreditedbyNAACwith“A”Grade)
ISO9001 –2015&ISO14001–2015Certified
#14/5,Chikkasandra,HesaraghattaMainRoad,Bengaluru–560057.
Web:[Link],Email:principal@[Link]
Phone:080-28 372800 Fax: 080-28 372797
21. Describe the expansion formula for Rook polynomials. Find the Rook polynomial for 3x3 board using
expansion formula.
22. How many derangements are there for 1, 2, 3, 4, 5?
23. Solve the recurrence relation 2𝑎𝑛+3 = 𝑎𝑛+2 + 2𝑎𝑛+1 − 𝑎𝑛 , 𝑛 ≥ 0, 𝑎0 = 0, 𝑎1 = 1, 𝑎2 = 2.
24. In how many ways one can arrange the letters in the word CORRESPONDENTS so that
i) There is no pair of consecutive identical letters.
ii) There are exactly 2 pairs of consecutive identical letters.
iii) There are at least 3 pairs of consecutive identical letters.
25. Find the number of non-negative integer solutions of the equation 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 18, under the
condition 𝑥𝑖 ≤ 7 for 𝑖 = 1,2,3,4.
26. Each of the n students is given a book. The books are to be returned and redistributed to the same students.
In how many ways can the 2 distributions be made so that no student will get the same book in both the
distributions.
27. Solve the recurrence relation 𝐶𝑛 = 3𝐶𝑛−1 − 2𝐶𝑛−2 , 𝑓𝑜𝑟 𝑛 ≥ 2 𝑔𝑖𝑣𝑒𝑛 𝐶1 = 5, 𝐶2 = 3.
28. Solve the recurrence relation 𝑎𝑛+2 − 3𝑎𝑛+1 + 2𝑎𝑛 , 𝑔𝑖𝑣𝑒𝑛 𝑎0 = 1, 𝑎1 = 6.
29. Define derangement. In how many ways can each 10 people select a left glove and a right glove out of a
total of 10 pairs of gloves so that no person selects a matching pair of gloves.
30. Find the rook polynomial for the chess board as shown in the figure.
31. Solve the recurrence relation:𝑎𝑛 = 𝑛𝑎𝑛−1 where 𝑛 ≥ 1 𝑎𝑛𝑑 𝑎0 = 1.
32. In how many ways 5 numbers of a’s , 4 numbers of b’s and 3 numbers of c’s can be arranged so that all
identical letters are not in a single block.
33. Solve the recurrence relation:𝐹𝑛+2 = 𝐹𝑛+1 + 𝐹𝑛 where 𝑛 ≥ 0 𝑎𝑛𝑑 𝐹0 = 0, 𝐹1 = 1.
34. Five teachers T1, T2, T3, T4, T5 are to be made class teachers for five classes C1, C2, C3, C4, C5, one
teacher for one class. T1 and T2 do not wish to become the class teacher for C1 or C2. T3 and T4 for C4,
or C5, T5 for C3 or C4 or C5. In how many ways can the teachers be assigned the work (without
displeasing any teacher).
