retagged by
14,039 views

2 Answers

Best answer
28 votes
28 votes
Trivial sub-strings are { } and { GATE2013 } only..
No of sub-strings from n distinct character string

= n(n+1)/2  +  1        // n is no of characters in string, as we have 1 sub-strings of length n, 2 of length n-1, ... n sub-strings of length 1.

= 8*9/2 +1 = 36 + 1

= 37

Out of 35 total string,  2 are  trivial so (37-2) 35 are non trivial..
selected by
14 votes
14 votes

Every String has at least 2 substring one is NULL string and 2nd is the given string itself, Which are called Trivial substring....remaining possible substring called Non-trivial substrings.


So answer is C. 2

Related questions

0 votes
0 votes
1 answer
1
Souvik33 asked Dec 21, 2022
834 views
The number of subwords for w=’SCALABLE” is equal to:343537
0 votes
0 votes
2 answers
3
Rohit Gupta 8 asked Nov 18, 2017
3,952 views
The number of superkeys possible for the relation R(A B C D E) with {A, BC, CDE} as three candidate keys are _________.Please EXPLAIN the solution.