Permutation-and-Combination

Question 1

The number of substrings (of all lengths inclusive) that can be formed from a character string of length n is

A
n
B
n2
C
n(n-1)/2
D
n(n+1)/2
Engineering-MathematicsPermutation-and-CombinationGATE 1994
Question 1 Explanation: 
No. of substrings of length
n = 1
(n-1) = 2
(n-2) = 3
So, Total = n(n+1)/2
There is 1 question to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access