Theory-of-Computation

Question 47

How many sub strings of different lengths (non-zero) can be found formed from a character string of length n?

Question 47 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

Correct Answer: D

Question 47 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