COT3100 HW 12

# COT3100 HW 12 - Lauren Safran Kevin McDonald Rey Olivo...

This preview shows pages 1–2. Sign up to view the full content.

Lauren’Safran ’ Kevin’McDonald ’ Rey’Olivo ’ COT3100’ ’ Homework’12 ’ 6.1 2.’ 27*37’=’999’Offices’in’the’building 8.’ 26*25*24’=’15600’ways’to’make’3’different’lettered’initials’ 10.’ Due’to’the’fact’that’each’bit’does’not’depend’on’another’bit,’the’possible’bit’ strings’of’length’8’are’counted’using’the’product’rule. Therefore,’the’number’of’bit’strings’of’length’8’is’2 8 =256’ 16.’ The’number’of’possible’strings’with’four’lowercase’letters’in’them’is’26 4 .’ The’number’of’possible’strings’with’four’lowercase’letters’in’ them’that’do’not’ contain’x’is’25 4 .’26 4 -25 4 ’ =’ 66351,’which’is’the’number’of’possible’strings’with’four’ lowercase’letters’in’them’that’have’the’letter’x.’ 32.’ a.’if’letters’can’be’repeated:’26 8 ’ =’ 208827064576’ b.’if’letters’cannot’be’repeated:’26*25*24*23*2

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

COT3100 HW 12 - Lauren Safran Kevin McDonald Rey Olivo...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online