Question 9962 – Theory-of-Computation
December 6, 2023Question 9991 – Theory-of-Computation
December 6, 2023Question 9973 – Theory-of-Computation
How many sub strings of different lengths (non-zero) can be found formed from a character string of length n?
Correct Answer: D
Question 28 Explanation:
Let us consider an example S = {APB}
Possible sub-strings are = {A, P, B, AP, PB, BA, APB}
Go through the options.
Option D:
n(n+1)/2 = 3(3+1)/2 = 6
Possible sub-strings are = {A, P, B, AP, PB, BA, APB}
Go through the options.
Option D:
n(n+1)/2 = 3(3+1)/2 = 6
n
n2
2n
Subscribe
Login
0 Comments