Register

ISRO 2024

192 views
0 votes
0 votes

From a character string of lenth $m$, the number of sub-strings of all lengths that can be formed are:

  1. $m^2$
  2. $m$
  3. $m(m+1)/2$
  4. $m(\log m)$
User Avatar

1 Answer

0 votes
0 votes
Correct Answer is C.

The number of substrings that can be formed from a character string of length m is given by the formula:

m(m+1)/2

This formula represents the sum of the first m natural numbers and accounts for substrings of all possible lengths, from length 1 to length m.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
Ramayya asked Jan 7
498 views
ISRO 2024
In a priority queue, insertion and deletion can be done at Front back Middle Any position
In a priority queue, insertion and deletion can be done atFrontbackMiddleAny position
User Avatar
0 votes
0 votes
2 answers
2
Ramayya asked Jan 7
523 views
ISRO 2024
What is the maximum number of comparisons needed to sort 6 items using radix sort, if each number is a 3-digit decimal number? 120 180 210 360
What is the maximum number of comparisons needed to sort 6 items using radix sort, if each number is a 3-digit decimal number?120180210360
User Avatar
0 votes
0 votes
0 answers
3
Ramayya asked Jan 7
148 views
ISRO 2024
In Reeverse Polish notation, expression A*B+C*D is written as AB*CD*+ A*BCD*+ AB*CD+* A*B*CD+ A request to the approver.!! This question is asked in ISRO 2024. Due to insufficient points, couldn’t add ‘isro2024’ tag, Please add it.
In Reeverse Polish notation, expression A*B+C*D is written asAB*CD*+A*BCD*+AB*CD+*A*B*CD+A request to the approver.!!This question is asked in ISRO 2024. Due to insuffici...
User Avatar
3 votes
3 votes
2 answers
4
gatecse asked Dec 17, 2017
1,259 views
ISRO-DEC2017-57
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary tree is $\text{e d b g f c a}$ $\text{e d b f g c a }$ $\text{d e b f g c a}$ $\text{d e f g b c a}$
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary ...
User Avatar
Link Copied!