Tricks to Solve The Famous MISSISSIPPI Problem in P&C

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-2-primary-maths/permutation-and-combination/permutations-with-without-repetition/asset-tricks-to-solve-the-famous-mississippi-problem-in-pc after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि और वर्ण, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, पद-भेद और रूप-विकार, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, शब्द-भंडार, अपठित बोध, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): رسم الخط، حروفِ تہجی اور املا / Script, Alphabet and Spelling, اسم، ضمیر اور صفت / Nouns, Pronouns and Adjectives, الفاظ، محاورے اور ضرب الامثال / Vocabulary, Idioms and Proverbs, تفہیمِ عبارت، انشا اور ترجمہ / Comprehension, Writing and Translation, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): শব্দার্থ, বাগধারা ও ভাষাশুদ্ধি / Meaning, Idioms and Correct Usage, বাক্য ও বাচ্য / Sentences and Voice, শব্দগঠন ও শব্দভান্ডার / Word Formation and Vocabulary, অনুবাদ, বোধপরীক্ষণ ও রচনা / Translation, Comprehension and Composition
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Pronoun, Verb, Adverb, Prepositions and Conjunctions, Parts of Speech, Determiner, Conjunction, Modals, Transformation of Sentences, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Structure and Common Errors, Reading Comprehension, Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, अशाब्दिक तर्क / Non-Verbal Reasoning, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Trigonometry, 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, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, Chemistry, History, Geography, Indian Economy, Environment, समसामयिकी / Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, कंप्यूटर नेटवर्क / Computer Networks, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), Terms & Abbreviations, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References, OOPS with Java
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a comprehensive lecture on permutations and combinations, focusing on the word "MISSISSIPPI" as a primary example. The instructor begins by introducing the core concepts of permutation and combination, using a visual metaphor of a lock to illustrate the difference: permutation is order-sensitive (like a combination lock), while combination is not (like a permutation lock). The main body of the lecture systematically works through a series of problems related to arranging the letters of "MISSISSIPPI". It first calculates the total number of distinct permutations, accounting for repeated letters (M:1, I:4, S:4, P:2), using the formula 11! / (4! * 4! * 2! * 1!). The video then applies this foundation to solve more complex conditional problems, such as finding the number of permutations where all 'S's are together (treating them as a single unit), where no two 'S's are together (using the gap method), and where the two 'P's are separated. The instructor uses a digital whiteboard to write out the formulas and calculations step-by-step, providing a clear, methodical approach to solving these combinatorial problems. The video concludes with a thank you message.

Chapters

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

    The video opens with a title card that visually distinguishes 'PERMUTATION' and 'COMBINATION' using a dice and a fruit basket, setting the stage for the topic. It then transitions to a slide titled 'Confused' which poses the question, 'Should I unlock with Permutation or Combination?'. This is illustrated with a cartoon detective character standing before two locked doors, one labeled 'Permutation' and the other 'Combination', each with a keypad. The instructor, Yash Jain, introduces the concept of permutations as arrangements where order matters, and combinations as selections where order does not. The slide also displays the 'Knowledge Gate Educator' logo and the instructor's name.

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

    The lecture progresses to a new slide titled 'Permutation / Arrangement (Limited Repetition Case)'. The instructor then presents a humorous meme featuring a laughing man with the text: 'the word "MISSISSIPPI" was made only to teach permutations and combinations.' This is followed by a slide showing a picture of the Mississippi state capitol building with the text 'Mississippi is a state located in the southeastern region of the United States.' The instructor uses this to transition into the main problem: 'How many ways can we arrange the letters in the word MISSISSIPPI?'. The slide then lists several sub-questions (a) through (g) that will be solved, including 'All the 'S' together', 'No two 'S' are together', and 'The two P's are separated'.

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

    The instructor begins solving the first part of the problem, (a) 'How many ways can we arrange the letters in the word MISSISSIPPI?'. He identifies the letters and their frequencies: M (1), I (4), S (4), P (2), for a total of 11 letters. He writes the formula for permutations with repetition: 11! / (4! * 4! * 2! * 1!). He then moves to part (b) 'All the 'S' together'. He explains that this can be solved by treating the four 'S's as a single unit, reducing the problem to arranging 8 units (SSSS, M, I, I, I, I, P, P). He writes the formula 8! / (4! * 2! * 1!) and calculates the result. He then proceeds to part (c) 'Number of permutation which do not start with 'M''. He explains this is found by subtracting the number of permutations that do start with 'M' from the total number of permutations, writing the formula as (11! / (4! * 4! * 2! * 1!)) - (10! / (4! * 4! * 2! * 1!)).

  4. 10:00 – 13:10 10:00-13:10

    The instructor tackles part (d) 'No two 'S' are together'. He explains the method of first arranging the non-'S' letters and then placing the 'S's in the gaps. He identifies the non-'S' letters as M, I, I, I, I, P, P, which are 7 letters. He calculates the number of ways to arrange these as 7! / (4! * 2! * 1!). He then identifies the 8 possible gaps (before, between, and after the 7 letters) where the 'S's can be placed. He calculates the number of ways to choose 4 gaps out of 8 for the 'S's as 8C4. The final answer is the product of these two values. He then moves to part (f) 'The two P's are separated'. He explains this is found by subtracting the number of permutations where the two P's are together from the total. He treats the two P's as a single unit, reducing the problem to 10 units, and calculates the number of permutations as 10! / (4! * 4! * 1! * 1!). The final answer is the total permutations minus this value. The video ends with a 'THANKS FOR WATCHING' screen.

The video provides a structured and methodical lesson on permutations and combinations, using the word 'MISSISSIPPI' as a central, practical example. It begins by establishing the fundamental difference between permutations (order matters) and combinations (order does not), using a clear visual analogy. The core of the lecture is a step-by-step demonstration of how to solve a complex problem by breaking it down into smaller, manageable parts. It covers the basic formula for permutations with repetition and then applies it to more advanced scenarios, such as 'all together', 'no two together', and 'separated' conditions. The instructor's use of a digital whiteboard to write out the formulas and calculations makes the logical progression of the solutions easy to follow, effectively teaching a systematic approach to solving combinatorial problems.

Loading lesson…