Concept & Short Tricks of Derangement in P&C

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/digital-logic-circuits-discrete-math-structures/permutation-and-combination/advanced-counting-theorems/asset-concept-short-tricks-of-derangement-in-pc after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: 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
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on combinatorics, specifically focusing on permutations, combinations, and derangements. The instructor begins by introducing the concepts of permutation and combination using a visual metaphor of a locked box, clarifying that permutation is order-sensitive while combination is not. The main topic is derangements, which are permutations where no element appears in its original position. The video presents a problem involving 5 gems and 5 boxes, where no gem can be placed in its corresponding box. The instructor explains the formula for derangements, denoted as d_n, which is d_n = n! * Σ((-1)^k / k!) for k from 0 to n. He demonstrates the calculation for d_4 and d_5, using a table of values for n, d_n, and n! to find the final answer. The lecture uses a digital whiteboard for writing equations and diagrams, and includes a brief, humorous meme to illustrate a point about the problem's complexity.

Chapters

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

    The video opens with a title card that visually contrasts 'PERMUTATION' and 'COMBINATION' using a dice and a fruit basket. It then transitions to a slide titled 'Confused' which poses the question 'Should I unlock with Permutation or Combination?' and shows two locked boxes labeled 'Permutation' and 'Combination'. The instructor, Yash Jain, is visible in a small window, introducing the topic of permutations and combinations as part of a 'Basic To Advance' course. The slide also features a logo for 'Knowledge Gate Educator'.

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

    The instructor presents a problem on a digital whiteboard: 'There are 5 gems {g1,g2,g3,g4,g5} and 5 boxes {b1,b2,b3,b4,b5}. We are supposed to place exactly one gem in each box. Find number of ways to do so such that gem g(i) is not placed in box b(i) for all i={1,2,3,4,5}.' He explains that this is a classic problem of derangements, where no element is in its original position. He begins to write the formula for derangements, d_n = n! * Σ((-1)^k / k!) for k from 0 to n, and then starts to calculate d_4 as an example.

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

    The instructor continues the calculation for the derangement of 4 items, d_4. He writes out the formula: d_4 = 4! * [(-1)^0/0! + (-1)^1/1! + (-1)^2/2! + (-1)^3/3! + (-1)^4/4!]. He simplifies this to 24 * [1 - 1 + 1/2 - 1/6 + 1/24], which evaluates to 24 * [12/24 - 4/24 + 1/24] = 24 * [9/24] = 9. He then refers to a table of values for n, d_n, and n! to find that d_5 = 44. He concludes that the number of ways to place the 5 gems such that no gem is in its corresponding box is 44.

  4. 10:00 – 10:36 10:00-10:36

    The video concludes with a black screen displaying the text 'THANKS FOR WATCHING' in an orange and white box. The instructor's voice is heard saying 'Thank you for watching.' This is the final frame of the video, serving as an outro.

The video provides a clear and structured lesson on derangements, a key concept in combinatorics. It begins by establishing the foundational difference between permutations and combinations, using a relatable visual analogy. The core of the lecture is the application of the derangement formula to solve a specific problem. The instructor methodically breaks down the calculation, demonstrating the use of the formula for a smaller case (d_4) before applying it to the main problem (d_5). The use of a table of pre-calculated values for d_n and n! is a practical teaching aid. The overall progression is logical, moving from concept to formula to application, making the complex topic accessible to students.

Loading lesson…