Consider all bit strings of length 12. How many have exactly four 1's?

Question

Question

Answer 1

Answer #1

The number of ways to form such a string is

it has 4 1's and 8 0's.

hence applying permutation :

12!/4!*8! = 495

Answer 2

Similar Homework Help Questions

Consider all bit strings of length 12 How many have 8 0s and 4 1s that have exactly 3 consecutive...

consider all bit strings of length 12 How many have 8 0s and 4 1s that have exactly 3 consecutive 1s (allow 4 consecutive 1s)? A 90 В 72 С 45 D 36 E 9 consider all bit strings of length 12 How many have 8 0s and 4 1s that have exactly 3 consecutive 1s (allow 4 consecutive 1s)? A 90 В 72 С 45 D 36 E 9
Let A be the set of all bit strings of length 10. 1. How many bit...

Let A be the set of all bit strings of length 10. 1. How many bit strings of length 10 are there? How many bit strings of length 10 begin with 1101? How many bit strings of length 10 have exactly six 0's? How many bit strings of length 10 have equal numbers of O's and 1's? How many bit strings of length 10 have more O's than 1's? a. b. c. d. e.
Problem 3 (Counting binary strings) 20 marks/ Consider all bit strings of length 15. 1. How many ...

Problem 3 (Counting binary strings) 20 marks/ Consider all bit strings of length 15. 1. How many begin with 00? 2. How many begin with 00 and end with 11? 3. How many begin with 00 or end with 10? 4. How many have exactly ten 1's? 5. How many have exactly ten 1's such as none of these 1's are adjacent to each other? Provide detailed justifications for your answers. Problem 3 (Counting binary strings) 20 marks/ Consider all...

Exercise 8.12.20: Counting binary strings. (a) How many binary strings of length 12 do not have...

Exercise 8.12.20: Counting binary strings. (a) How many binary strings of length 12 do not have exactly four 1's? (b) How many binary strings of length 12 start with 101 or 1110? (e) How many binary strings of length 12 start with 00 or end with 00 or both?
Multiple Choice How many strings of length 12 over the alphabet {a,b,c} have exactly three a's...

Multiple Choice How many strings of length 12 over the alphabet {a,b,c} have exactly three a's or have exactly three b's or have exactly three c's? (1?).22-3-(3) °(12):22-3-(?) (3) ° (13)-3-(1) QUESTION 20 Multiple Choice How many binary strings of length 12 have exactly six 1's or begin with a 0? ° (62) +211 -(0 ° (12) +201 - 1 ° (6) +211 -(5) ° (12) + 211
How many bit strings of length n are palindromes

How many bit strings of length n are palindromes? Hint: Consider two cases n is even and n is odd. Note a palindrome is a “string” of letters or numbers which read the same “frontwards” and backwards”. Examples: 1101011, 10111101 are palindromes.

How many have exactly 4 1's and 6 0's in a 10 bit string?

How many have exactly 4 1's and 6 0's in a 10 bit string?
Problem 3 a) How many strings are there of length 10 over the alphabet (a, b)...

Problem 3 a) How many strings are there of length 10 over the alphabet (a, b) with exactly five a's? b) How many strings are there of length 10 over the alphabet (a, b, c) with exactly five a's?
4. [6 marks] (Basic Counting) How many bit strings of length 10 contain either five consecutive...

4. [6 marks] (Basic Counting) How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s?

Provide a regular expression that describes all bit-strings that length is at least one and at...

Provide a regular expression that describes all bit-strings that length is at least one and at most three.