Permutations with Limited Repetitions

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/engineering-mathematics/permutation-and-combination/permutations-with-without-repetition/asset-permutations-with-limited-repetitions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  2. 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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  13. 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
  14. 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
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive lecture on permutations and combinations, specifically focusing on the case of limited repetition. The video begins with an introductory slide that visually distinguishes between permutations (where order matters) and combinations (where order does not matter), using examples like a combination lock and a pizza. The main content is a step-by-step derivation of the formula for arranging items with limited repetition. The instructor presents a problem: 'In how many ways can we arrange 5 items in 5 slots where 2 identical items are of type 1 and 3 identical items are of type 2?'. He then demonstrates the solution by first considering the total permutations of 5 distinct items (5!), and then dividing by the factorials of the counts of identical items (2! and 3!) to account for the indistinguishability. This leads to the general formula: N! / (N1! * N2! * ... * Nk!), where N is the total number of items and N1, N2, etc. are the counts of identical items. The video concludes with a summary of the general formula and a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title slide that introduces the concepts of 'PERMUTATION' and 'COMBINATION' with illustrative images: a roulette table and dice for permutation, and a basket of fruit and a pizza for combination. This is followed by a slide titled 'Confused' which poses the question, 'Should I unlock with Permutation or Combination?'. The slide visually contrasts the two concepts with two locked doors, one labeled 'Permutation' and the other 'Combination', each with a detective character pondering the choice. The instructor, Yash Jain, is visible in a small window, introducing the topic. The slide also features the 'Knowledge Gate Educator' logo and branding.

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

    The video transitions to a new slide titled 'Permutation / Arrangement (Limited Repetition Case)'. The instructor presents a specific problem: 'In how many ways can we arrange 5 items in 5 slots where 2 identical items are of type 1 and 3 identical items are of type 2?'. He begins to solve this by writing the formula for permutations of 5 distinct items, which is 5!. He then explains that since the items are not all distinct, we must divide by the factorials of the counts of identical items to avoid overcounting. He writes the full formula as 5! / (2! * 3!). He also provides a visual analogy using 2 red balls and 3 black balls to illustrate the concept of identical items.

  3. 5:00 – 9:20 05:00-09:20

    The instructor continues to solve the problem, writing out the calculation: 5! / (2! * 3!) = 120 / (2 * 6) = 120 / 12 = 10. He then generalizes the formula for any number of items with limited repetition: N! / (N1! * N2! * ... * Nk!), where N is the total number of items and N1, N2, etc. are the counts of identical items. To reinforce the concept, he draws a table showing all 10 possible arrangements of the 5 items (r1, r2, b1, b2, b3), demonstrating that the order of the identical items (r1 and r2, or b1, b2, b3) does not create a new arrangement. The video concludes with a final slide summarizing the general formula and a 'Thanks for Watching' screen.

The video provides a clear and structured lesson on permutations with limited repetition. It effectively uses visual aids, such as the initial comparison of permutation and combination, and the problem-solving walkthrough with the 5-item arrangement, to explain the core concept. The instructor's methodical approach, from a specific example to a general formula, makes the topic accessible. The key takeaway is that when arranging items where some are identical, the total number of unique arrangements is found by dividing the total permutations of distinct items by the factorials of the counts of each set of identical items.

Loading lesson…