Demo: Permutations with Unlimited Repetitions

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/quantitative-aptitude/permutation-and-combination/permutations-with-without-repetition/asset-demo-permutations-with-unlimited-repetitions 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 systematically derives formulas for permutations, beginning with arrangements without repetition and progressing to those with unlimited repetition. The instructor first clarifies the distinction between permutation and combination, defining permutation as the arrangement of 'n' distinct items in 'k' slots. The initial problem focuses on arranging 'n' items into 'n' slots where repetition is not allowed. Through algebraic derivation using the general formula nPk = n! / (n-k)!, and by substituting k=n, the video demonstrates that the result simplifies to n! because (n-n)! equals 0!, which is defined as 1. This concept is reinforced by a visual counting method where the first slot has 'n' choices, the second has 'n-1', continuing down to 1, resulting in the product n(n-1)(n-2)...(1) = n!. The lecture then transitions to a new scenario involving 'k' slots with unlimited repetition allowed. Here, the instructor assumes objects are distinct if not specified and illustrates that each of the 'k' slots independently offers 'n' choices. Applying the multiplication principle across all slots yields the final formula n^k.

Chapters

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

    The video opens by addressing the common confusion between permutation and combination, using visual cues like a detective character to symbolize problem-solving. The instructor defines Permutation as the arrangement of 'n' distinct items in 'k' slots, explicitly stating on-screen text: "ARRANGE 'N' DISTINCT ITEMS IN 'K' SLOTS". The segment introduces a specific problem: "In how many ways can we arrange 'n' items in 'n' slots if repetition is NOT allowed??". The instructor begins the derivation by presenting the general permutation formula nPk = n! / (n-k)! on a digital whiteboard. By substituting k=n, the expression becomes n! / (n-n)!. The derivation highlights that (n-n)! equals 0!, and the instructor explicitly defines 0! = 1. This leads to the simplification nPn = n! / 0! = n!, with the final answer circled to emphasize the result.

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

    The instructor reinforces the concept of arranging 'n' distinct items into 'n' slots without repetition using a visual counting method. The screen displays a row of boxes representing slots labeled 1, 2, 3... n. Above these slots, the instructor assigns choices: 'n' for the first slot, 'n-1' for the second, and so on down to 1. The text "a1 a2 ... an" represents the items available. By crossing out used items, the video visually demonstrates that no repetition is allowed. The sequence of choices n(n-1)(n-2)...(1) is multiplied to derive the total number of arrangements. The final formula n! is circled as the answer, confirming the algebraic derivation from the previous segment. This section solidifies the understanding that arranging 'n' distinct items in 'n' slots without repetition always results in n factorial.

  3. 5:00 – 7:36 05:00-07:36

    The lecture transitions to a new problem involving arrangements with unlimited repetition. The on-screen text poses the question: "In how many ways can we arrange 'n' items in 'k' slots if unlimited repetition is allowed?? (k<=n)". The instructor assumes objects are distinct if not specified, a key constraint noted on screen. Visual aids show 'n' items (a1, a2... an) and 'k' slots. The instructor explains that for each of the 'k' slots, there are 'n' possible choices because repetition is unlimited. This is visually represented as "n . n . n . n ... k times". Applying the multiplication principle across all 'k' slots, the total number of permutations is derived as n^k. The final formula n^k is circled, distinguishing this result from the previous n! case and completing the comparison between permutations without repetition and those with unlimited repetition.

The video provides a clear pedagogical progression from basic permutation definitions to specific formula derivations. It first establishes the scenario of arranging 'n' items in 'n' slots without repetition, deriving n! through both algebraic substitution (using 0!=1) and visual counting. It then contrasts this with the scenario of arranging 'n' items in 'k' slots with unlimited repetition, deriving n^k. The distinction relies heavily on whether the number of items equals the number of slots and whether repetition is permitted. The visual aids, including crossed-out items for no-repetition scenarios and repeated 'n' choices for unlimited repetition, effectively illustrate the underlying logic of the multiplication principle. The assumption that objects are distinct unless specified is a critical rule highlighted during the transition to the second problem.

Loading lesson…