Concept & Short Tricks of Derangement in P&C

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/quantitative-aptitude/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. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. 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
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
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…