Odds in Favour of an event & Odds Against An Event

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/probability/basic-concepts-and-terminology/asset-odds-in-favour-of-an-event-odds-against-an-event after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on the concept of probability, specifically focusing on odds in favor and odds against an event. The instructor begins by defining the fundamental components of probability: favorable outcomes (fav), unfavorable outcomes (unfav), and the total number of outcomes. He establishes the relationship that fav + unfav = total. Using this, he derives the formulas for the probability of an event (P(E) = fav/total) and the probability of its complement (P(E') = unfav/total). The core of the lecture is the definition of odds: odds in favor of an event A are the ratio of favorable cases to unfavorable cases (fav/unfav), which is equivalent to P(A)/P(A'). Conversely, odds against an event are the ratio of unfavorable cases to favorable cases (unfav/fav), which is P(A')/P(A). The video demonstrates that the product of these two odds is always 1. The lecture concludes with two worked examples. The first example calculates the probability of an event given its odds in favor are 2:7. The second example finds the odds in favor of one event given that the probability of one event is two-thirds of the other and that one of the two events must occur. The video uses a digital whiteboard for all explanations and includes a small video feed of the instructor.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title card featuring the word "PROBABILITY" over a collage of images including dice, fruit, and a pizza. The main content begins with a title slide that reads "Odds in Favour of an Event & Odds Against an Event". The instructor, Yash Jain Sir, appears in a small window in the bottom right corner. He starts by defining the basic components of probability on a digital whiteboard: E = dice = prime = {2,3,5} → 3 fav, and 5,1,4,6 → 3 unfav. He writes the equation "fav + unfav = total" and explains that the total number of outcomes is the sum of favorable and unfavorable outcomes.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues to build the foundation for the lesson. He writes the formulas for the probability of an event and its complement: P(E) = fav/total and P(E') = unfav/total. He then introduces the concept of odds in favor of an event, defining it as the ratio of favorable cases to unfavorable cases. He writes the formula: Odds in favour of Event A = Number of Favorable Cases / Number of Failures = P(A) / P(A'). He then defines odds against an event as the ratio of unfavorable cases to favorable cases, writing: Odds against an Event A = Number of Failures / Number of Favorable Cases = P(A') / P(A). He notes that the product of these two odds is 1.

  3. 5:00 – 10:00 05:00-10:00

    The instructor presents the first worked example. The question is: "The odds in favour of an event are 2:7. Find the probability of occurrence of the event." He sets up the ratio fav/unfav = 2/7. To find the total, he uses the relationship fav + unfav = total, substituting 2x and 7x for fav and unfav respectively, which gives total = 9x. He then calculates P(E) = fav/total = 2x/9x = 2/9. He then presents a second example: "Given that the chance of happening of one event is two-third of the other & one of the two must happen, find the odds in favour of the other." He defines event E1 with probability p and E2 with probability q, stating p = (2/3)q. Since one of the two must happen, p + q = 1. He solves the system of equations to find p = 2/5 and q = 3/5, and then calculates the odds in favor of E2 as 3:2.

  4. 10:00 – 10:52 10:00-10:52

    The video concludes with a final slide that displays the text "THANKS FOR WATCHING" in white letters on a dark, gradient background. The instructor's video feed is no longer visible. This marks the end of the lecture.

The video provides a clear and structured lesson on the relationship between probability and odds. It begins by establishing the fundamental definitions of favorable, unfavorable, and total outcomes, which are used to derive the basic probability formula. The core of the lesson is the distinction between odds in favor and odds against an event, with the instructor clearly showing that odds in favor are P(A)/P(A') and odds against are P(A')/P(A). The key insight is that these two values are reciprocals, and their product is always 1. The lecture effectively transitions from theory to practice by solving two distinct problems, demonstrating how to convert between odds and probability and how to use the condition that one of two mutually exclusive events must occur to find the required odds. The use of a digital whiteboard allows for a clean, step-by-step presentation of the mathematical reasoning.

Loading lesson…