UGC-NET | UGC NET CS 2018 Dec – II | Question 17

The number of substrings that can be formed from string given by “a d e f b g h n m p” is
(A) 10
(B) 45
(C) 56
(D) 55

Answer: (C)
Explanation: Total number of non-empty substrings of all lengths from 1 to n

= n + (n-1) + (n-2) + (n-3) + … 2 + 1
= n * (n + 1)/2

These are non-empty substrings, but if you count null substrings there are [n(n+1)/2] + 1.

Where, n = 10,
So, total number of all substrings are = 10*11/2 + 1 = 55+1 = 56.

Option (C) is correct.
Quiz of this Question

Article Tags :

UGC-NET

Recommended Articles

1. UGC-NET | UGC NET CS 2018 Dec – II | Question 27

2. UGC-NET | UGC NET CS 2018 Dec – II | Question 1

3. UGC-NET | UGC NET CS 2018 Dec – II | Question 2

4. UGC-NET | UGC NET CS 2018 Dec – II | Question 3

5. UGC-NET | UGC NET CS 2018 Dec – II | Question 4

6. UGC-NET | UGC NET CS 2018 Dec – II | Question 5

7. UGC-NET | UGC NET CS 2018 Dec – II | Question 6

8. UGC-NET | UGC NET CS 2018 Dec – II | Question 7

9. UGC-NET | UGC NET CS 2018 Dec – II | Question 8

10. UGC-NET | UGC NET CS 2018 Dec – II | Question 9

11. UGC-NET | UGC NET CS 2018 Dec – II | Question 10

12. UGC-NET | UGC NET CS 2018 Dec – II | Question 11

13. UGC-NET | UGC NET CS 2018 Dec – II | Question 12

14. UGC-NET | UGC NET CS 2018 Dec – II | Question 13

15. UGC-NET | UGC NET CS 2018 Dec – II | Question 14

16. UGC-NET | UGC NET CS 2018 Dec – II | Question 15

17. UGC-NET | UGC NET CS 2018 Dec – II | Question 16

18. UGC-NET | UGC NET CS 2018 Dec – II | Question 18

19. UGC-NET | UGC NET CS 2018 Dec – II | Question 19

20. UGC-NET | UGC NET CS 2018 Dec – II | Question 20

21. UGC-NET | UGC NET CS 2018 Dec – II | Question 21

22. UGC-NET | UGC NET CS 2018 Dec – II | Question 22

23. UGC-NET | UGC NET CS 2018 Dec – II | Question 23

24. UGC-NET | UGC NET CS 2018 Dec – II | Question 24

25. UGC-NET | UGC NET CS 2018 Dec – II | Question 25