Short Trick to find total outcomes in an experiment
Duration: 12 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- Paper 2 | 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 Run Time Environment
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
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
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: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.
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.
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.

