The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
60 views
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 $
in Combinatory by Boss (36.3k points)
edited by | 60 views
0
64.
+1
No, answer is (B) 85
0
oou its atmost 3 .=1+4+16+64
0
if i modify the question in such a way that no repitition of same alphabet is allowed then in this case what will be answer???
0

BASANT KUMAR

If repetition is not allowed

_       _      _   (Lenght 3$: 4*3*2 = 24$ ways)

_      _   (Length $2: 4*3=12$ ways)

_  (Length $1: 4$ ways)

(Length $0: 1$ way)

So, $24+12+4+1 = 41$

 

+1
yes 41 , i am also getting this.

1 Answer

+4 votes
Best answer
$\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$
by Boss (35.4k points)
selected by
0
Wow,it's a easy method.

Thanks Brother

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,781 questions
53,593 answers
185,825 comments
70,880 users