This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Linear Permutation”.

1. How many substrings (of all lengths inclusive) can be formed from a character string of length 8? (Assume all characters to be distinct)

a) 14

b) 21

c) 54

d) 37

View Answer

Explanation: Let’s consider the given string is CLEAN, so set of string of length 1 = {C,L,E,A,N} ; cardinality of set = 5 set of string of length 2 = {CL,EE,EA,NN}, set of string of length 3 = {CLE,LEE,EAN}, set of strings of length 4 = {CLEN,LEAN}, set of strings of length 5 = {CLEAN} and set of string of length 0 = {} and we cannot have any substring of length 6 as given string has only 5 length. So total no of substrings are possible = 0 length substring + 1 length substring + 2 length substrings +3 length substrings + 4 length substrings + 5 length substrings = 1 + 5 + 4 + 3 + 2 + 1 = 16 means for 1 length string to n length substrings it will sum of the n natural no from 1 to n.

so 1+2+3+…+n = \(\frac{n(n+1)}{2}\) so total no substrings possible = 0 length strings + \(\frac{n(n+1)}{2}\) = 1+ \([\frac{n(n+1)}{2}]\) so total no of substrings possible in n length string (All length inclusive )= 1 + \([\frac{n(n+1)}{2}] = \frac{8(8+1)}{2}\) = 37.

2. The number of diagonals can be drawn in a hexagon is ______

a) 9

b) 32

c) 16

d) 21

View Answer

Explanation: A hexagon has 6 sides. We obtain the diagonals by joining the vertices in pairs.

Total number of sides and diagonals =

^{6}C

_{2}= \(\frac{6 * 5}{2 * 1}\) = 5×3 = 15. This includes its 6 sides also. So, Diagonals = 15 – 6 = 9. Hence, the number of diagonals is 9.

3. The number of binary strings of 17 zeros and 8 ones in which no two ones are adjacent is ___________

a) 43758

b) 24310

c) 32654

d) 29803

View Answer

Explanation: First place 17 zeroes side by side _ 0 _ 0 _ 0 … 0 _ and 8 1’s can be placed in any of the (17+1) available gaps hence the number of ways =

^{n+1}C

_{k}= 43758.

4. How many words that can be formed with the letters of the word ‘SWIMMING’ such that the vowels do not come together? Assume that words are of with or without meaning.

a) 430

b) 623

c) 729

d) 1239

View Answer

Explanation: The word ‘SWIMMING contains 8 letters. Of which, I occurs twice and M occurs twice. Therefore, the number of words formed by this word = \(\frac{8!}{2!*2!}\) = 10080. In order to find the number of permutations that can be formed where the two vowels I and I come together, we group the letters that should come together and consider that group as one letter. So, the letters are S,W,M,M,N,G, (I,I). So, the number of letters are 7 the number of ways in which 7 letters can be arranged is 7! = 5040. In I and I, the number of ways in which I and I can be arranged is 2!. Hence, the total number of ways in which the letters of the ‘SWIMMING’ can be arranged such that vowels are always together are \(\frac{7!}{2!*2!}\) = 5040 ways. The number of words in which the vowels do not come together is =(10080 – 5040) = 5040.

5. A number lock contains 6 digits. How many different zip codes can be made with the digits 0–9 if repetition of the digits is allowed upto 3 digits from the beginning and the first digit is not 0?

a) 254307

b) 453600

c) 458760

d) 972340

View Answer

Explanation: For the first position, there are 9 possible choices (since 0 is not allowed). After that number is chosen, there are 10 possible choices (since 0 is now allowed) for the second digit, for the third digit there are 10 possible choices, 9 possible choices for the fourth digit and 8 possible choices for the fifth digit and 7 possible choices for the sixth digit. The number of number locks = 453600.

6. Let M be a sequence of 9 distinct integers sorted in ascending order. How many distinct pairs of sequences, N and O are there such that i) each is sorted in ascending order, ii) N has 5 and O has 4 elements, and iii) the result of merging N and O gives that sequence?

a) 84

b) 35

c) 194

d) 138

View Answer

Explanation: Selecting any 3 elements from given 9 elements gives

^{9}C

_{3}= 84 number of distinct pairs of sequences.

7. 14 different letters of alphabet are given, words with 6 letters are formed from these given letters. How many number of words are there which have at least one letter repeated?

a) 892742

b) 999988

c) 213216

d) 786730

View Answer

Explanation: Number of words which have at least one letter replaced = total number of words – total number of words in which no letter is repeated, => 10

^{6}–

^{12}P

_{6}=> 1000000 − 924 = 999988.

8. In how many ways can 10 boys be seated in a row having 28 seats such that no two friends occupy adjacent seats?

a) ^{13}P_{5}

b) ^{9}P_{29}

c) ^{19}P_{10}

d) ^{15}P_{7}

View Answer

Explanation: First let us take the 18 unoccupied seats. They create 19 slots i.e., one on the left of each seat and one on the right of the last one. So we can place the 10 boys in any of these 19 slots that are,

^{19}P

_{10}ways.

9. In how many ways can the letters of the word SANFOUNDRY be rearranged such that the vowels always appear together?

a) \(\frac{(8 + 3)!}{2!}\)

b) \(\frac{6!}{2!}\)

c) 8!*3!

d) \(\frac{4!}{8!}\)

View Answer

Explanation: Take AOU together and treat it like 1 entity and arrange SNFNDRY in 8! Ways. Then, the AOU can be arranged in 3! ways. So, total arrangements = 8! * 3! = 40320 * 6 = 241920.

10. How many ways can 8 prizes be given away to 7 students, if each student is eligible for all the prizes?

a) 40325

b) 40320

c) 40520

d) 40720

View Answer

Explanation: Now the first student is eligible to receive any of the 8 available prizes (so 8 ways), the second student will receive a prize from rest 7 available prizes (so 7 ways), the third student will receive his prize from the rest 6 prizes available(so 6 ways) and so on. So total ways would be 8! = 8*7*6*5*4*3*2*1 = 40320. Hence, the 7 prizes can be distributed in 40320 ways.

**Sanfoundry Global Education & Learning Series – Discrete Mathematics.**

To practice all areas of Discrete Mathematics, __here is complete set of 1000+ Multiple Choice Questions and Answers__.