Answer:
a) 1 / 12
b) 1 / 4
Step-by-step explanation:
The events are independent since they do not affect each other. The total probability of two independent events is the product of the probabilities of the two events.
a) When rolling a die, there are 6 outcomes, the numbers 1 - 6. There is only 1 outcome where you can get a 2. Therefore, the probability of rolling a two is 1/6.
When flipping a coin, there are two ways it can land: heads or tails. And there is one outcome with heads. The probability of getting head would be 1 / 2.
To find the the total, you multiply the probabilities of the two events: 1 / 6 * 1 / 2 = 1 / 12
b) As stated before, when rolling a die, there are 6 outcomes, the numbers 1 - 6. There are 3 outcomes where she can roll an even number: the numbers 2, 4, or 6. So, the probability of rolling an even number is 3 / 6 or 1 / 2.
When flipping a coin, there are two ways it can land: heads or tails. And there is one outcome with tails. The probability of getting tails would be 1 / 2.
Now, you multiply the two probabilities to get the total probability: 1 / 2 * 1 / 2 = 1 / 4
Answer:
1. -3
2. 5
Step-by-step explanation:
Hope this helped
Also Toga is my favorite character
Answer:
5.7
Step-by-step explanation:
<u>unrelated</u>, I love how peter is open about buying makeup. i feel as if the gender roles are garbage. #YasQueen #GoPeter #PeterIsCool #MakeupCanBeForBoysToo <3
(also peter could totally be a girl and I am misgendered a person)
Answer: 5 games
Step-by-step explanation: A .500 record means that the soccer team won half of their games ( that's how I interpret it). Since they are going to play 30 games, they need to win half of 30 or 15 games to have that record. 15-10 = 5. So, they need to win 5 more games to have a .500 record.
Answer:
Step-by-step explanation:
a.) The worst-case height of an AVL tree or red-black tree with 100,000 entries is 2 log 100, 000.
b.) A (2, 4) tree storing these same number of entries would have a worst-case height of log 100, 000.
c.) A red-black tree with 100,000 entries is 2 log 100, 000
d.) The worst-case height of T is 100,000.
e.) A binary search tree storing such a set would have a worst-case height of 100,000.
