1 votes 1 votes The number of possible subsequences in a string of length n are: $n^{2}$ $2^{n}$ n! n(n-1) Combinatory nptel-quiz combinatory counting normal + – rsansiya111 asked Dec 7, 2021 • recategorized Jul 6, 2022 by Lakshman Bhaiya rsansiya111 356 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply raja11sep commented Dec 7, 2021 reply Follow Share Answer: B Which is equal to all possible subsets. For every character you have two choice either take or don’t. 0 votes 0 votes raja11sep commented Dec 7, 2021 reply Follow Share algorithms - Why is the number of possible subsequences $2^n$? - Mathematics Stack Exchange 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes B. 2^n ... The problem of counting distinct subsequences is easy if all characters of input string are distinct….. The count is equal to nC0 + nC1 + nC2 + … nCn = 2^n... 33 answered Mar 9, 2022 33 comment Share Follow See all 0 reply Please log in or register to add a comment.
