Important Questions on Derangements
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- 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
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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
- General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
- English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
- Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
- Full Mock Test:
- Previous Year Papers:
- GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video is a lecture on permutations and combinations, specifically focusing on derangements. The instructor begins by clarifying the difference between permutations and combinations using a visual metaphor of a detective trying to unlock a door, where the order of the combination matters. The core of the lecture is on derangements, which are permutations where no element appears in its original position. The instructor presents several problems to illustrate the concept. The first problem involves placing 5 gems into 5 boxes such that no gem is in its corresponding box, which is a classic derangement problem. The solution is derived by calculating the total number of permutations (5!) and subtracting the number of permutations where at least one gem is in the correct box, which is found using the principle of inclusion and exclusion. The second problem asks for the number of ways to place 4 letters into 4 envelopes so that at least one letter is in the correct envelope, which is solved by subtracting the number of derangements from the total permutations. The final problem is a trick question about a typist inserting 42 letters into 42 envelopes, asking for the number of ways to have exactly one letter in the wrong envelope. The instructor explains that this is impossible because if one letter is in the wrong envelope, another must also be misplaced to accommodate it, making the answer zero. The video uses a whiteboard for calculations and includes a brief, unrelated meme at the beginning.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a four-panel graphic illustrating the concepts of permutation and combination. The top-left panel shows a craps table with dice, labeled 'PERMUTATION'. The top-right panel shows a basket of fruit, labeled 'COMBINATION'. The bottom-left panel shows a pizza, and the bottom-right shows two men in suits. The instructor then transitions to a slide with a meme and a picture of a man with yellow teeth, introducing the topic. The main content begins with a slide titled 'Confused' that asks, 'Should I unlock with Permutation or Combination?'. This slide features a cartoon detective with a magnifying glass, standing between two doors labeled 'Permutation' and 'Combination', each with a lock. The instructor explains that in a permutation, the order matters, while in a combination, it does not, using the example of a lock where the sequence of numbers is crucial.
2:00 – 5:00 02:00-05:00
The lecture progresses to the core topic of derangements. A slide titled 'Derangements' is shown, displaying a table of permutations of the numbers 1, 2, 3, 4, with some highlighted as derangements (where no number is in its original position). The instructor then presents a problem: '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 placed in box b(i) for all i={1,2,3,4,5)?'. The instructor explains that this is asking for the number of ways where all gems are in their correct boxes, which is only 1 way. He then changes the question to find the number of ways such that at least one gem is in an incorrect box. He writes the formula '# total - # all in correct box' and calculates 5! - 1 = 119. He then introduces the concept of derangements, which is a permutation where no element is in its original position, and writes the formula for the number of derangements of n objects as !n = n! * (1 - 1/1! + 1/2! - 1/3! + ... + (-1)^n/n!). He applies this to the 5-gem problem, calculating !5 = 5! * (1 - 1/1! + 1/2! - 1/3! + 1/4! - 1/5!) = 120 * (1 - 1 + 1/2 - 1/6 + 1/24 - 1/120) = 120 * (0 + 0.5 - 0.1667 + 0.04167 - 0.00833) = 120 * 0.36667 = 44.0004, which he rounds to 44.
5:00 – 9:43 05:00-09:43
The instructor moves to a new problem: 'There are 4 different letters and 4 addressed envelopes. In how many ways can the letters be put in the envelopes so that at least one letter goes to the correct address?'. He explains that this is the total number of ways to arrange the letters minus the number of derangements. He writes the formula '# total - # all incorrect' and calculates 4! - !4. He calculates !4 = 4! * (1 - 1/1! + 1/2! - 1/3! + 1/4!) = 24 * (1 - 1 + 1/2 - 1/6 + 1/24) = 24 * (0 + 0.5 - 0.1667 + 0.04167) = 24 * 0.375 = 9. So, the answer is 24 - 9 = 15. He then presents a final, trick question: 'After a typist types 42 letters and addresses 42 envelopes, she inserts the letters randomly into envelopes (1 letter per envelope). In how many ways can she insert exactly one letter in an improper envelope?'. He explains that this is impossible because if one letter is in the wrong envelope, it must have taken the place of another letter, which means at least two letters are in the wrong envelopes. Therefore, the number of ways to have exactly one letter in the wrong envelope is 0. The video ends with a 'THANKS FOR WATCHING' screen.
The video provides a structured and clear explanation of permutations, combinations, and the specific concept of derangements. It begins by establishing the fundamental difference between permutations and combinations using a relatable analogy. The core of the lecture is dedicated to derangements, a topic in combinatorics where no element is in its original position. The instructor effectively uses the principle of inclusion and exclusion to solve problems involving derangements, demonstrating the calculation of the number of derangements for a set of n elements. The lecture progresses from a simple problem of placing gems in boxes to a more complex one involving letters and envelopes, and concludes with a clever trick question that reinforces the logical understanding of the concept. The use of a whiteboard for step-by-step calculations and clear, concise language makes the complex topic accessible to students.

