Concept & Short Tricks of Derangement in P&C

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/UP-POLICE-COMPUTER-OPERATOR/reasoning/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 the course: About the Course
  2. General Knowledge: Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, GK- Current Affairs, Indian Economy, Static General Knowledge, Environment, Evolution of Indian Banking (Banking & Financial Awareness)
  3. Mental Aptitude and Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Number System, 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), Vocabulary, Profit and Loss, Arithmetic, Mental Ability, Percentage, Algebra, Mensuration and Geometry, Age Problems, Clock, Calendar, Verbal Analogy (Word Based Analogy), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analogy, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Selection Decision Table (Decision Making), Cubes & Dices, Blood Relations, Venn Diagram, Logical Sequence Of Words, Inequality, Directions (Direction Test), Data Arrangement, Facts, Inference and Judgements, Syllogisms, Seating Arrangements, Ranking, Order and Sequence
  4. CS | Computer Fundamentals: Basics of COA, Number System, Number Representation, C Fundamentals, Algorithm Analysis, Input Output Organisation
  5. CS | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
  6. CS | Workplace productivity Tools: MS Office Applications, Keyboard Shortcuts
  7. CS | Computer Networks: Introduction to CN, Data Communication, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, Application Layer, Hardware Basics, Network Security
  8. CS | The Internet: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Server Side & Security, Emerging Technologies
  9. CS | Emerging Technologies: Artificial Intelligence, Emerging Tech Trends, Introduction to OS, Windows OS, Linux OS, Unix OS, JavaScript-Basics
  10. CS | Boolean algebra: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware
  11. CS | Data Structures: Introduction to DS, Array, Stack, Queue
  12. CS | Cryptography: 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
  13. UP Police Previous Year Papers:
  14. UP Police Full Mock Tests:
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…