Web-Technologies
October 9, 2023UGC NET JRF November 2020 Paper-2
October 9, 2023GATE 1994
| Question 15 |
The number of substrings (of all lengths inclusive) that can be formed from a character string of length n is
| n | |
| n2 | |
| n(n-1)/2 | |
| n(n+1)/2 |
Question 15 Explanation:
No. of substrings of length
n = 1
(n-1) = 2
(n-2) = 3
So, Total = n(n+1)/2
n = 1
(n-1) = 2
(n-2) = 3
So, Total = n(n+1)/2
Correct Answer: D
Question 15 Explanation:
No. of substrings of length
n = 1
(n-1) = 2
(n-2) = 3
So, Total = n(n+1)/2
n = 1
(n-1) = 2
(n-2) = 3
So, Total = n(n+1)/2