edited by
467 views
0 votes
0 votes
Number of strings up to length $3$ on alphabet set $\sum$ = { a,b,c,d } are :(including,string of length zero)?

$A) 16 $

$B)  85 $

$C) 128 $

$D)  64 $
edited by

1 Answer

Best answer
4 votes
4 votes
$\underline{\hspace{0.5cm}} \ \underline{\hspace{0.5cm}} \   \underline{\hspace{0.5cm}}  $ 4 options to fill each blank = $4^3 = 64$

$\underline{\hspace{0.5cm}} \ \underline{\hspace{0.5cm}} $ $ =4^2 = 16$

$\underline{\hspace{0.5cm}}   = 4^1 = 4$

$1$

$64 + 16 + 4 + 1 = 85$
selected by

Related questions

0 votes
0 votes
1 answer
1
shikharV asked Jan 19, 2016
472 views
Couldn't understand the method they have used to find the answer. Please explain
0 votes
0 votes
1 answer
3
sripo asked Nov 5, 2018
2,632 views
Lets for a a given string aabbbccddI need to find the number of substrings possible how to go about it? Does the n(n+1)/2 formula work here also?
0 votes
0 votes
0 answers
4
Lakshman Bhaiya asked Oct 24, 2018
372 views
Suppose that a solution $(X,Y,Z)$ of the equation $X+Y+Z=20,$with $X,Y$ and $Z$ non-negative integers,is chosen at random.What is the probability that $X$ is divisible by...