Short Trick to find total outcomes in an experiment

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/probability/basic-concepts-and-terminology/asset-short-trick-to-find-total-outcomes-in-an-experiment 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
  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, presented by Yash Jain from Knowledge Gate, is a lecture on the fundamental concept of probability, specifically focusing on calculating total outcomes in experiments. The video begins with an introduction to the topic, followed by a series of worked examples. The first example asks for the total outcomes when three coins are tossed, which is solved by listing all possible combinations (HHH, HHT, HTH, HTT, THH, THT, TTH, TTT) to arrive at 8 total outcomes. The second example calculates the total outcomes when a die is rolled four times, using the formula m^n where m is the number of outcomes per roll (6) and n is the number of rolls (4), resulting in 6^4 = 1296. The video concludes by presenting a general formula for such problems: if an experiment has 'm' total outcomes and is repeated 'n' times, the total number of outcomes is m^n. The instructor uses a digital whiteboard to write out the problems and solutions, and the video includes a copyright notice from Knowledge Gate Eduventures.

Chapters

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

    The video opens with a title slide featuring the word "PROBABILITY" in a purple box, surrounded by four images: a dice on a green table, a basket of fruit, a pizza, and a business meeting. This transitions to a presentation slide with a pink background and a word cloud related to business and risk. The title "PROBABILITY" is at the top, and the instructor, Yash Jain, is visible in a small window. The slide also includes the text "- BY YASH JAIN" and a copyright notice at the bottom. The instructor begins the lecture, introducing the topic of probability.

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

    The video displays a new slide with a yellow background and the text "Let's Play With Some Questions Now". The instructor then presents the first question: "Find the total outcomes when 3 coins are tossed together?". He begins to solve this by writing out the possible outcomes on a digital whiteboard, starting with H H H and then systematically listing all combinations of Heads (H) and Tails (T) for three coins, such as H H T, H T H, H T T, T H H, T H T, T T H, and T T T. He is explaining the process of finding the total number of possible results.

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

    The instructor continues to list the outcomes for the three-coin toss problem, completing the list of 8 possible combinations. He then transitions to the second question: "Find the total outcomes when a dice is rolled 4 times?". He explains that a die has 6 faces, so there are 6 possible outcomes for a single roll. He then applies the formula for repeated experiments, writing 6 * 6 * 6 * 6 and calculating it as 6^4, which equals 1296. He also shows the calculation 1296 = 16 * 81. The instructor uses a digital whiteboard to write out the equations and calculations.

  4. 10:00 – 11:56 10:00-11:56

    The video presents a slide titled "Yash Sir Special Short Trick". The instructor explains the general formula for calculating total outcomes when an experiment is repeated multiple times. He writes the formula: "Total outcomes when an experiment is done = m" and "Total outcomes if this experiment is repeated 'n' times = m^n". He uses the previous examples to illustrate this: for the coin toss, m=2 (H or T) and n=3, so 2^3 = 8. For the dice roll, m=6 and n=4, so 6^4 = 1296. The video ends with a final slide that says "THANKS FOR WATCHING".

The video provides a clear, step-by-step tutorial on calculating total outcomes in probability experiments. It starts with a conceptual introduction and then moves to practical examples. The first example, tossing three coins, is solved by exhaustive listing, which is a fundamental method. The second example, rolling a die four times, introduces the multiplicative principle, which is then generalized into a powerful formula (m^n). The instructor effectively uses a digital whiteboard to demonstrate the calculations, making the process easy to follow. The lesson progresses from a specific, manual method to a general, efficient formula, providing students with both a foundational understanding and a practical tool for solving similar problems.

Loading lesson…