(PVQ)^(P->R)^(q->R)is equivalent to
(PVQ)^(P->R)^(q->R)is equivalent to
(PVQ)^(P->R)^(q->R)is equivalent to
A fair coin is tossed 3 times in succession. If the first toss produced a head, then the probability of getting exactly two heads in 3 tosses ( including the first toss ) is
Akilesh Kharvi ? Dec 8 '2016 at 21:11
Answer:\(\frac{3}{4}\)
Explanation:
P(2 heads in 3 tosses / first toss is a head)
(H,H,H)
(H,H,T)
(H,T,H)
(H,T,T)
(T,H,H)
(T,H,T)
(T,T,H)
(T,T,T)
are the 2^3 = 8 ways in which the coin can roll.
Since we are given that the first toss is a head, our sample space becomes:
(H,H,H)
(H,H,T)
(H,T,H)
(H,T,T)
Of these four possibilities, we want to know how many have exactly 2 heads
\(= \frac{3}{4}\)
The probability of two sisters sharing the same birth-month is
Akilesh Kharvi ? Dec 8 '2016 at 21:6
Answer: \(\frac{1}{12}\)
Explanation:
The first sister can be born any month, it makes no difference.
The second sister has 1/12 chance of being born in the same month.
Which of the following is not true about recursion when compared to iteration ?
The best method to rearrange books in a library shelf at the end of the day is
Akilesh Kharvi ? Dec 8 '2016 at 20:31
Answer : insertion sort
Explanation:
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time.
Library sort, or gapped insertion sort is a sorting algorithm that uses an insertion sort, but with gaps in the array to accelerate subsequent insertions.Reference :https://en.wikipedia.org/wiki/Insertion_sort
https://en.wikipedia.org/wiki/Library_sort