Question

1. Solve the following two " union " type questions: (a) How many bit strings of...

1. Solve the following two " union " type questions:

(a) How many bit strings of length 9 either begin with 2 0s or end with 2 1s? (inclusive or)

(b) Every student in a discrete math class is either a computer science or a mathematics major or is a joint major in these two subjects. How many students are in the class if there are 30 computer science majors (including joint majors), 20 math majors (including joint majors) and 10 joint majors?

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
1. Solve the following two " union " type questions: (a) How many bit strings of...
1. Solve the following two " union " type questions: (a) How many bit strings of length 9 either begin with 2 0s or end with 2 1s? (inclusive or) (b) Every student in a discrete math class is either a computer science or a mathematics major or is a joint major in these two subjects. How many students are in the class if there are 30 computer science majors (including joint majors), 20 math majors (including joint majors) and...
This is a Discrete math problem. a. How many bit strings of length 12 are there...
This is a Discrete math problem. a. How many bit strings of length 12 are there in total? b. How many bit strings of length 12 contain an odd number of 1s? c. How many bit strings of length 12 contain “111000” as a substring of 6 consecutive bits in a row?
For a bit string containing 10 bits, how many strings are there that contains 5 consecutive...
For a bit string containing 10 bits, how many strings are there that contains 5 consecutive 0s or 1s. The OR is inclusive in this example and it is AT LEAST 5 consecutive so 6 consecutive would still count. I don't understand how I should approach this. There are too many cases to exclude when calculating the permutation of a single case.
Discrete Math a.) How many bit strings are there of length five or less, not counting...
Discrete Math a.) How many bit strings are there of length five or less, not counting the empty string? b.) How many different three-letter initials with none of the letters repeated can people have? c.) How many different three-letter initials are there that begin with the letter B? d.) How many 5-element DNA sequences end with A? e.) How many bit strings of length nine both begin and end with 1?
How many bit strings of length 20 are there that contain eight 1s and twelve 0s...
How many bit strings of length 20 are there that contain eight 1s and twelve 0s so that each 1 is followed by one 0 immediately?
How many ternary strings of length 8 begin with 01 or end with 1? (A ternary...
How many ternary strings of length 8 begin with 01 or end with 1? (A ternary string consists of 0s, 1s, and 2s.)
How many 13 bit strings either begin with 00 or end with 111?
How many 13 bit strings either begin with 00 or end with 111?
how many bit of strings of length five start either or end with two zeros?
how many bit of strings of length five start either or end with two zeros?
how many 8 bit strings begin or end with 1 ? * Is there a simple...
how many 8 bit strings begin or end with 1 ? * Is there a simple way of solving this problem ?*
1. (4 pts) Consider all bit strings of length six. a) How many begin with 01?...
1. (4 pts) Consider all bit strings of length six. a) How many begin with 01? b) How many begin with 01 and end with 10? c) How many begin with 01 or end with 10? d) How many have exactly three 1’s? 2. (8 pts) Suppose that a “word” is any string of six letters. Repeated letters are allowed. For our purposes, vowels are the letters a, e, i, o, and u. a) How many words are there? b)...