Tricks to Solve The Famous MISSISSIPPI Problem in P&C
Duration: 13 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 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
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: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'.
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!)).
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.

