Subjective Approach to Probability Data Science and A.I. Lecture Series Author: Bindeshwar Singh Kushwaha What is the Subjective Approach? The subjective approach to probability is based on personal judgment, intuition, wisdom, and expertise. Unlike the classical or frequency-based approaches, it focuses on individual beliefs about the likelihood of an event. When to Use the […]
Subjective Approach to Probability Read More »
Relative Frequency Approach in Probability Data Science and A.I. Lecture Series Author: Bindeshwar Singh Kushwaha Relative Frequencies and Probabilities So, in general, if \( X \) is a variable having the values \( x_1, x_2, \dots, x_n \) with frequencies \( f_1, f_2, \dots, f_n \), respectively, then: \[ \frac{f_1}{\sum f_i}, \frac{f_2}{\sum f_i}, \dots,
Relative Frequency Approach in Probability Read More »
Probability Examples Related to Combinations Data Science and A.I. Lecture Series Author: Bindeshwar Singh Kushwaha Example: Drawing Two Cards from a Well-Shuffled Pack of Cards Find the probability of the following scenarios: One red and one black card. Both cards of the same suit. One jack and one king. One red card and one card
Probability Examples Related to Combinations Read More »
Examples and Theorem Related to Combinations Data Science and A.I. Lecture Series Author: Bindeshwar Singh Kushwaha Theorem: Relationship Between Permutations and Combinations Theorem: The number of permutations of \(n\) different objects taken \(r\) at a time is related to the number of combinations by: \[ P^n_r = C^n_r \cdot r! \] where \(0 < r
Theorem Related to Combinations Read More »
Understand Combinations Data Science and A.I. Lecture Series Introduction to Combinations A combination is a selection of items where the order does not matter. Example: Selecting 2 players from a group of 3 players (X, Y, Z). Possible combinations: XY, XZ, YZ. Formula for combinations: \[ \binom{n}{r} = \frac{n!}{r!(n-r)!}, \quad 0 \leq r \leq
Understand Combinations Read More »
Examples from Permutations Data Science and A.I. Lecture Series By Bindeshwar Singh Kushwaha, PostNetwork Academy Example 1 How many 4-digit numbers can be formed by using the digits 1 to 9 if repetition of digits is not allowed? Solution: Total digits: 9 Required 4-digit numbers: \[ P(9, 4) = \frac{9!}{(9-4)!} = 9 \times 8
Examples of Permutations Read More »
Permutations and Their Theorems Data Science and A.I. Lecture Series Author: Bindeshwar Singh Kushwaha Institute: PostNetwork Academy Theorem 1: Permutations of Distinct Objects The number of permutations of n different objects taken r at a time is: \[ P(n, r) = \frac{n!}{(n-r)!} \] Explanation: First position: n choices. Second position: n-1 choices. Continue until the
More on Permutations Read More »
Understanding Permutations Data Science and A.I. Lecture Series Author: Bindeshwar Singh Kushwaha PostNetwork Academy Introduction to Permutations A permutation is an arrangement of objects in a specific order. The order of arrangement is crucial in permutations. Example: Arranging the letters of the word “ABC”. Total permutations = $3! = 6$. Key Formula for Permutations The
Understanding Permutations Read More »
Concept of Odds in Favor and Against Data Science and A.I. Lecture Series Author: Bindeshwar Singh Kushwaha Institute: PostNetwork Academy Concept of Odds Odds in Favor and Against Odds in Favor: Ratio of favorable cases to unfavorable cases:\[ \text{Odds in favor of } A = m : (n – m) \] Odds Against: Ratio of
Concept of Odds in Favor and Against Read More »
Probability Problems Based on Classical Definition of Probability Data Science and A.I. Lecture Series Questions What is the total number of outcomes (sample space)? How do we determine favorable cases? How do probability rules apply to the problem? Example: Throwing Two Dice Find the probability of: A doublet (same number on both dice) Sum
Probability Problems based on the Classical Definition of Probability Read More »