Demo: Permutation & Combination (Quick Revision & Practice Questions)

Duration: 1 hr 11 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/mathematics-i-ii-iii-iv/permutation-and-combination/basic-concepts-counting-principles/asset-demo-permutation-combination-quick-revision-practice-questions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. 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, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. 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)
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. 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
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, 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, प्रतिशत / Percentage, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, अनुपात और समानुपात / Ratio and Proportion
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: आँकड़ा निर्वचन / Data Interpretation
  18. Basis of Physics: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. Previous Year Paper:
  20. 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 provides a comprehensive quick revision and practice session on Permutation and Combination, fundamental topics in combinatorics. The instructor begins by establishing the core definitions: Permutation is defined as selection plus arrangement, whereas Combination is strictly about selection. The lesson progresses through the mathematical formulas for nPr and nCr, explaining factorial notation (n!) as a prerequisite. A significant portion of the video is dedicated to solving diverse practice problems that apply these concepts in various contexts. These include arranging books by subject, handling identical items like colored balls or repeated letters in words (e.g., 'FUZZTONE', 'MARKER'), forming numbers within specific ranges, and calculating travel routes using the multiplication principle. The instructor emphasizes critical distinctions such as when to use permutations versus combinations, particularly in scenarios involving directionality (train tickets) or identical items. The session concludes with complex combination problems involving repeated alphabets and case-based enumeration, reinforcing the systematic approach required to solve non-standard combinatorial questions.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the topic of 'Basic Concepts' focusing on Permutation and Combination. He begins by writing 'Permutation' and defining it as arrangement, specifically noting the formula involving selection plus arrangement. He then writes 'Combination' below it and starts drawing a symbol, likely to contrast the two concepts. The board displays 'BASIC CONCEPTS' with 'Permutation -> arrange X (Selection + arrangement)' and 'Combination'. The instructor underlines key terms like 'arrange' to emphasize the distinction between the two mathematical operations.

  2. 2:00 – 5:00 02:00-05:00

    The instructor is distinguishing between permutation and combination on a whiteboard. He defines permutation as selection plus arrangement, underlining 'arrange' and crossing it out to emphasize the difference. He then begins writing that combination is solely about selection, drawing a visual analogy involving 'n balls' and selecting 'r balls'. The formulas for nPr and nCr are written out, along with a visual representation of selecting r balls from n balls. The concept of factorials is introduced with examples like 7!, 5!, and n! to explain the mathematical notation used in the formulas.

  3. 5:00 – 10:00 05:00-10:00

    The video segment spans from 365 to 500 seconds. The instructor is teaching permutation and combination concepts, specifically focusing on the formula for combinations (nCr). He demonstrates how to calculate 8C3 by expanding it into a fraction of products. The lesson then transitions to a practice problem involving arranging books of different subjects together, requiring the application of grouping concepts. The board shows '8C3 = 3 terms / 3 terms' and the question about Babita's bag containing books of History, Science, and Maths.

  4. 10:00 – 15:00 10:00-15:00

    The instructor is solving a permutation problem involving arranging books of different subjects together. He initially demonstrates the concept using individual book slots (B1, B2, etc.) and calculates 7! for total arrangements. He then transitions to a new method where books of the same subject are treated as single units or 'blocks' (Sci, Math) to solve for arrangements where subjects stay together. The visual focus moves between solving a word arrangement problem and illustrating the formula for permutations with repetition.

  5. 15:00 – 20:00 15:00-20:00

    The instructor transitions from a permutation problem involving arranging books by subject to a new question about arranging the letters in the word 'FUZZTONE' with vowels together. He then shifts to explaining a different permutation concept involving arranging 9 balls of different colors (4 red, 3 blue, 2 green) where items within the same color are identical. The visual focus moves between solving a word arrangement problem and illustrating the formula for permutations with repetition.

  6. 20:00 – 25:00 20:00-25:00

    The instructor transitions to a new permutation problem involving the word 'MARKER' with a specific constraint regarding vowels. He writes down the total number of arrangements as the sum of cases where vowels are together and not together, then begins to list specific conditions for arranging the letters. The problem asks for arrangements where three vowels are not together. The board displays options a. 500, b. 720, c. 240, d. 360.

  7. 25:00 – 30:00 25:00-30:00

    The instructor transitions from a permutation problem involving the word 'MARKER' to a new question about forming numbers between 500 and 1000 using specific digits without repetition. He initially writes 'with repetition' but then corrects the approach to solve for 'without repetition' as per the question text. The solution involves calculating permutations by considering the constraints on the hundreds, tens, and units places. He arrives at the final answer of 90 ways.

  8. 30:00 – 35:00 30:00-35:00

    The instructor is solving a permutation and combination problem involving forming groups of members. The question asks for the number of ways to form a group of 4 from 8 members under two conditions: including two particular members and excluding two particular members. The instructor demonstrates the calculation for the second condition, showing that selecting 2 members from the remaining 6 results in 15 ways. The board shows 'm1 m2 (m3) m4 m5 (m6) m7'.

  9. 35:00 – 40:00 35:00-40:00

    The instructor is solving a permutation and combination problem involving travel routes between three cities: Mirzapur, Delhi, and Jaunpur. He explains that to find the total number of ways to travel from Mirzapur to Jaunpur via Delhi, one must multiply the number of routes for each leg of the journey (8 routes from Mirzapur to Delhi and 6 routes from Delhi to Jaunpur). The calculation shown on the board is 8 multiplied by 6, resulting in 48 different ways.

  10. 40:00 – 45:00 40:00-45:00

    The instructor solves two distinct combinatorics problems involving permutations and combinations. First, he calculates the number of handshakes among 15 students using the combination formula 15C2, arriving at 105. Next, he addresses a railway ticket problem with 20 stops, initially calculating 20C2 as 190 but then correcting the logic to account for directionality (permutations), resulting in an answer of 380. The board shows 'CSK vs MI, MI vs CSK' to illustrate directionality.

  11. 45:00 – 50:00 45:00-50:00

    The instructor is solving a permutation and combination problem involving the alphabets A, B, A, B, B. He breaks down the solution by categorizing combinations based on the number of alphabets selected (0 to 5). He systematically lists the possible unique combinations for each category, such as 'AA', 'BB', 'AB' for two alphabets. The board shows options a) 10, b) 12, c) 11, d) None of these.

  12. 50:00 – 55:00 50:00-55:00

    The video segment covers a period from 3965 to 4250 seconds, likely focusing on a specific topic or event within this timeframe. The instructor is solving a permutation and combination problem involving the alphabets A, B, A, B, B. He breaks down the solution by categorizing combinations based on the number of alphabets selected (0 to 5). He systematically lists the possible unique combinations for each category, such as 'AA', 'BB', 'AB' for two alphabets.

  13. 55:00 – 60:00 55:00-60:00

    The video segment covers a period from 3965 to 4250 seconds, likely focusing on a specific topic or event within this timeframe. The instructor is solving a permutation and combination problem involving the alphabets A, B, A, B, B. He breaks down the solution by categorizing combinations based on the number of alphabets selected (0 to 5). He systematically lists the possible unique combinations for each category, such as 'AA', 'BB', 'AB' for two alphabets.

  14. 60:00 – 65:00 60:00-65:00

    The video segment covers a period from 3965 to 4250 seconds, likely focusing on a specific topic or event within this timeframe. The instructor is solving a permutation and combination problem involving the alphabets A, B, A, B, B. He breaks down the solution by categorizing combinations based on the number of alphabets selected (0 to 5). He systematically lists the possible unique combinations for each category, such as 'AA', 'BB', 'AB' for two alphabets.

  15. 65:00 – 70:00 65:00-70:00

    The video segment covers a period from 3965 to 4250 seconds, likely focusing on a specific topic or event within this timeframe. The instructor is solving a permutation and combination problem involving the alphabets A, B, A, B, B. He breaks down the solution by categorizing combinations based on the number of alphabets selected (0 to 5). He systematically lists the possible unique combinations for each category, such as 'AA', 'BB', 'AB' for two alphabets.

  16. 70:00 – 70:56 70:00-70:56

    The video segment covers a period from 3965 to 4250 seconds, likely focusing on a specific topic or event within this timeframe. The instructor is solving a permutation and combination problem involving the alphabets A, B, A, B, B. He breaks down the solution by categorizing combinations based on the number of alphabets selected (0 to 5). He systematically lists the possible unique combinations for each category, such as 'AA', 'BB', 'AB' for two alphabets.

The lecture systematically builds understanding of Permutation and Combination through definition, formula derivation, and extensive problem-solving. The instructor establishes that Permutation involves both selection and arrangement (nPr), while Combination is strictly about selection (nCr). This distinction is reinforced through visual aids like selecting balls from a set and writing out factorial expansions. The practice section covers a wide array of scenarios: arranging items with constraints (books by subject, vowels in words), handling identical items (colored balls, repeated letters), and applying the multiplication principle to travel routes. A key pedagogical moment occurs when distinguishing between combinations (handshakes) and permutations (train tickets), highlighting the importance of directionality. The final problems involve complex enumeration with repeated alphabets, requiring case-by-case analysis to count unique combinations. The instructor consistently uses board work to visualize constraints and calculations, ensuring students can follow the logical steps from problem statement to solution.

Loading lesson…