Tricks to Solve The Famous MISSISSIPPI Problem in P&C

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-1-discrete-structures-and-theory-of-logic/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 Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, हिन्दी की रूप रचना, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, Multi-Topic Content (Cross-Concept Material), हिन्दी की ध्वनि और स्वनिम व्यवस्था, प्राचीन और मध्यकालीन भारतीय आर्यभाषाएँ, काव्य के लक्षण, हेतु और प्रयोजन, हिन्दी शब्द रचना, हिन्दी साहित्येतिहास दर्शन, भक्तिकालीन काव्यधाराएँ, भारतीय काव्यशास्त्र की परंपरा, भारतीय नवजागरण और स्वाधीनता आंदोलन, अन्य गद्य विधाएँ एवं प्रवासी साहित्य, निर्धारित उपन्यासों का तुलनात्मक अध्ययन, गोदान, हिन्दी कहानी का विकास, स्वातंत्र्योत्तर और नयी कहानी, हिन्दी निबंध का विकास, शुक्लोत्तर निबंध, द्विवेदी और शुक्ल युग के निबंध, हिन्दी की संवैधानिक स्थिति, आधुनिक भारतीय आर्यभाषाएँ और हिन्दी का उद्भव, हिन्दी भाषा प्रयोग के विविध रूप, रीतिकाल, जीवनी, द्विवेदी युग और छायावाद, रीति, वक्रोक्ति और औचित्य सिद्धान्त, शब्दशक्ति और ध्वनि सिद्धान्त, रस सिद्धान्त और साधारणीकरण, उत्तर आधुनिकतावाद, लोहिया दर्शन, हिन्दी उपन्यास का विकास, हिन्दी नवजागरण, अंबेडकर दर्शन, आदिकाल, प्रयोगवाद और नयी कविता, छायावादी काव्य: प्रसाद और निराला, प्रगतिवाद से समकालीन कविता, निर्गुण भक्ति काव्य, द्विवेदीयुगीन काव्य, रीतिकालीन काव्य, आरंभिक हिन्दी उपन्यास, स्वातंत्र्योत्तर उपन्यास, आत्मकथा, स्वाधीनता-पूर्व प्रेमचंदोत्तर उपन्यास, निर्धारित कहानियों का तुलनात्मक अध्ययन, साठोत्तरी नाटक, प्रसाद और प्रसादोत्तर युग के नाटक, भारतेन्दु युगीन नाटक, स्वातंत्र्योत्तर नाटक, भारतेन्दु युगीन निबंध, संस्मरण और रेखाचित्र, व्यंग्य, एक साहित्यिक की डायरी, संस्कृति के चार अध्याय, सगुण भक्ति काव्य, हिन्दी नाटक, एकांकी और रंगमंच, आधुनिक गद्य और हिन्दी नवजागरण, अलंकार सिद्धान्त, हिन्दी आलोचना का विकास, भक्ति आंदोलन, कल्पना, बिम्ब, प्रतीक, मिथक और फंतासी, नयी कविता का विस्तार और साठोत्तरी कविता, उत्तर-छायावादी और प्रगतिवादी काव्य, काव्यगुण और काव्यदोष, प्लेटो, अरस्तू और पाश्चात्य परंपरा, मार्क्सवाद, स्वच्छन्दतावादी काव्यशास्त्र, आधुनिक पाश्चात्य आलोचना, भाषा और भाषा परिवार, देवनागरी लिपि
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: 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, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: कंप्यूटर की मूल बातें और हार्डवेयर / Computer Fundamentals and Hardware, प्रत्यक्ष बोध / Literal Comprehension, कंप्यूटर सॉफ्टवेयर / Computer Software, निष्कर्षात्मक बोध / Inferential Comprehension, आलोचनात्मक बोध / Critical Comprehension, इंटरनेट और वर्ल्ड वाइड वेब / Internet and World Wide Web, ई-मेल और ऑनलाइन संचार / Email and Online Communication, साइबर सुरक्षा / Cyber Security, अपशिष्ट प्रबंधन / Waste Management, डिजिटल नैतिकता, बौद्धिक संपदा और समाज / Digital Ethics, IPR and Society, डिजिटल एवं नव माध्यम / Digital and New Media, शोध नैतिकता / Research Ethics, उभरती प्रौद्योगिकियाँ / Emerging Technologies, शिक्षा और शासन में ICT / ICT in Education and Governance, Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking, भौगोलिक संकेतों का संरक्षण / Protection of Geographical Indications
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: Introduction to CN, Data Communication, 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, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: क्रमचय, संचय एवं प्रायिकता / Permutation, Combination and Probability, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, क्लाउड और वितरित कंप्यूटिंग / Cloud and Distributed Computing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. 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

  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…