Important Questions on Derangements

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/arithmetical-numerical-ability/permutation-and-combination/advanced-counting-theorems/asset-important-questions-on-derangements after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, समसामयिकी / Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Analytical Reasoning (Counting Figures Reasoning), रक्त संबंध / Blood Relations, Syllogisms, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, दिशा एवं दूरी / Direction and Distance, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, Data Arrangement, Inequality, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, आँकड़ा निर्वचन / Data Interpretation, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय और कार्य / Time and Work, Pipe and Cistern, घन क्षेत्रमिति / Solid Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Reading Comprehension, Parts of Speech, Sentence Construction, Prepositions and Conjunctions, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Structure and Common Errors, Modals, Transformation of Sentences, Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि और वर्ण, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, पद-भेद और रूप-विकार, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, शब्द-भंडार, अपठित बोध, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: वृद्धि और विकास / Growth and Development, Concept of Pedagogy, विकास के सिद्धांत / Theories of Development, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, शिक्षण योजना और शिक्षण कौशल / Teaching Planning and Teaching Skills, Personality Development, शिक्षण विधियाँ / Teaching Methods, अधिगम और व्यवहारवादी सिद्धांत / Learning and Behavioural Theories, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, आकलन एवं मूल्यांकन / Assessment and Evaluation, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / 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, प्रतिचयन / Sampling
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, प्रबंध के सिद्धांत एवं कार्य / Principles and Functions of Management, लेखांकन के आधार एवं लेन-देनों का अभिलेखन / Accounting Fundamentals and Recording of Transactions, Business Economics, ह्रास, अंतिम खाते व कंप्यूटरीकृत लेखांकन / Depreciation, Final Accounts and Computerised Accounting, Knowledge Management & New Economy
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

  1. 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. 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.

  3. 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.

Loading lesson…