The Gateway to Computer Science Excellence

0 votes

- $n + 1 (n$ prefixes for $n$ characters, plus the empty string$)$
- $n + 1 ($similar to $(a))$
- $n - 1 (n$ prefixes for $n$ characters, minus the string itself$)$
- $n [1$ character substring$] + (n - 1) [2$ character substring$] + \dots + 1 = \dfrac{n (n + 1)}{2}.$ Add $1$ to include the empty substring.
- $\displaystyle{}\sum_{i=0}^{n} {^{n}C_{i}} = 2^{n}$, if you include the empty subsequence.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.6k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,833 questions

57,723 answers

199,442 comments

107,778 users