Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Independent and Dependent Events
Two events A and B are independent events if the occurrence of event A is in no way related to the occurrence or non-occurrence of event B. Likewise for independent events, the occurrence of event B is in no way related to the occurrence of event A.
Two events A and B are dependent events if the occurrence of one event say A is related to the occurrence of another event, say B.
MULTIPLICATION RULE: INDEPENDENT EVENTS
The joint probability of two outcomes that are independent is equal to the probability of the first outcome multiplied by the probability of the second outcome (the second outcome may be occurring simultaneously or some time in future), i.e. joint probability of two independent events is equal to the product of their marginal probabilities.
P(A and B) = P(A) . P(B)
A man invest ?13500 partly in shares paying 6% at ?140 and partly in 5% at 125.If he is tolal income is 560, how much has he invested in each?
what is fraction?
why modi method is used in operation research
S IMILAR TRIANGLES : Geometry is the right foundation of all painting, I have decided to teach its rudiments and principles to all youngsters eager for ar
examples of construction of excircles
In parallelogram ABCD, ∠A = 5x + 2 and ∠C = 6x - 4. Find the evaluation of ∠A. a. 32° b. 6° c. 84.7° d. 44° a. Opposite angles of a parallelogram are same in measu
Five more than the quotient of a number and 2 is at least that number. What is the greatest value of the number? Let x = the number. Notice that quotient is a key word for div
an insurance salesman sells policies to 5 men, all of identical age in good health. the probability that a man of this particular age will be alive 20 years hence is 2/3.Find the p
What is minimum spanning tree? Determine a railway network of minimal cost for the cities in the following graph using Kruskal's algorithm. Ans: Minimum spanning tree in a con
LAST COST METHOD
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd