Concept & Short Tricks of Derangement in P&C
Duration: 11 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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
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: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.
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.
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.

