Total Outcomes, MCQ Paper Solving, Unlimited Repetitions

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-1-basic-numeracy/permutation-and-combination/combinations-with-without-repetition/asset-total-outcomes-mcq-paper-solving-unlimited-repetitions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, Statistics, Probability, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समय और कार्य / Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Paper-1 & 2 | Data Interpretation: आँकड़ा निर्वचन / Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Data Arrangement, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making
  7. Paper-1 | General Science: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, समसामयिकी / Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर नेटवर्क / Computer Networks
  22. Paper 2 | Pedagogy: वृद्धि और विकास / Growth and Development, विकास के सिद्धांत / Theories of Development, Concept of Pedagogy, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on combinatorics, specifically focusing on the concepts of permutations and combinations. The instructor begins by introducing the fundamental difference between the two: permutations are concerned with the order of elements, while combinations are not. This is illustrated with a visual metaphor of a combination lock, where the order of numbers matters, versus a permutation lock where order does not. The lecture then transitions to the core principle of counting outcomes, introducing the formula for the total number of possible outcomes when each event has a fixed number of choices. This is demonstrated with the example of flipping coins, where each coin has 2 possible outcomes (Heads or Tails), leading to the formula 2^n for n coins. The concept is further generalized to a multiple-choice question paper, where each of the 65 questions has 4 options, resulting in 4^65 possible ways to answer. The final segment of the video introduces the concept of combinations with unlimited repetition, using the example of selecting 3 characters from a set of 6 (a, b, c, d, e, f) where repetition is allowed. The instructor uses a visual method of placing 'stars' (choices) and 'bars' (dividers) to explain the formula C(n+r-1, r), where n is the number of types of items and r is the number of items to be selected. The video concludes with a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title slide that visually contrasts 'PERMUTATION' and 'COMBINATION' using a four-quadrant image: a roulette table with dice for permutation, a fruit basket for combination, a pizza for combination, and two men shaking hands for permutation. The scene then transitions to a lecture slide titled 'Confused' with the question 'Should I unlock with Permutation or Combination?'. This slide features a cartoon detective with a magnifying glass, standing between two locked doors labeled 'Permutation' and 'Combination', each with a four-digit lock. The instructor, Yash Jain, is visible in a small window in the bottom right corner. The slide also includes the 'Knowledge Gate Educator' logo and the text 'Basic To Advance'. The instructor begins by explaining the difference between permutations and combinations, emphasizing that in permutations, the order of selection matters, while in combinations, it does not.

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

    The video transitions to a new slide with a pink background and space-themed graphics, titled 'Total Number of Outcomes Possible'. The instructor introduces the concept of calculating the total number of possible outcomes for a series of events. A question appears on screen: 'Q: If we have 20 coins, then how many outcomes are possible?'. The instructor then begins to solve this by building up from simpler cases. He writes on the screen: '1 coin = H/T → 2 outcomes', '2 coins = HH, HT, TH, TT → 4 outcomes', and '3 coins = HHH, HHT, HTH, HTT, THH, THT, TTH, TTT → 8 outcomes'. He points out the pattern: 2, 4, 8, which are powers of 2. He then generalizes this to 'n coins = 2^n outcomes'. For the specific case of 20 coins, he writes '2 * 2 * 2 ... 20 times = 2^20'. The instructor explains that this is a fundamental principle of counting, where the total number of outcomes is the product of the number of choices for each event.

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

    The video presents a new problem on the same yellow background: 'Q: If we have a MCQ question paper with 65 questions, each having 4 options (a,b,c,d), find number of ways a student can answer the question paper?'. The instructor explains that for each question, there are 4 possible choices. He writes '4' for each of the 65 questions and then shows the multiplication: '4 x 4 x 4 ... 65 times = 4^65'. He emphasizes that this is a direct application of the multiplication principle. The video then transitions to a new topic with a title slide: 'Combinations with Unlimited Repetition'. The next problem is presented: 'Q: {a,b,c,d,e,f} Select 3 character with unlimited repetitions?'. The instructor begins to explain the method for this type of problem, which involves selecting items where order does not matter and repetition is allowed. He uses a visual method, drawing a diagram with 'p's and 'm's to represent the choices and dividers, and then introduces the formula C(n+r-1, r) for combinations with unlimited repetition, where n is the number of types of items and r is the number of items to be selected.

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

    The video concludes with a black screen featuring a large orange box with the text 'THANKS' in white. Below this, the text 'FOR WATCHING' appears in white. This is a standard closing screen for the educational video, signaling the end of the lecture.

The video provides a structured and progressive lesson on combinatorics. It begins by establishing the foundational distinction between permutations and combinations, using a relatable visual metaphor. The core of the lesson is the application of the multiplication principle to calculate the total number of possible outcomes, demonstrated through the classic examples of coin flips and multiple-choice questions. This establishes a clear formula: if there are 'n' independent events, and the i-th event has 'k_i' possible outcomes, the total number of outcomes is the product k_1 * k_2 * ... * k_n. The video then builds upon this by introducing a more complex scenario: combinations with unlimited repetition. It uses a visual, intuitive method (stars and bars) to explain the formula C(n+r-1, r), which is a key concept in combinatorics. The progression moves from basic definitions to practical problem-solving, making the concepts accessible to students.

Loading lesson…