Solving Some Basic Questions on Permutation & Combination

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/engineering-mathematics/permutation-and-combination/combinations-with-without-repetition/asset-solving-some-basic-questions-on-permutation-combination after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | 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
  13. 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
  14. 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
  15. Paper 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 Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on permutations and combinations, presented by an instructor from Knowledge Gate Educator. The video begins with an introduction to the topic, using visual metaphors of a roulette wheel and a fruit basket to illustrate the difference between permutations (order matters) and combinations (order does not matter). The core of the lecture consists of several worked examples. The first problem asks for the number of ways to seat 10 people in 4 chairs, which is solved using the permutation formula P(n,r) = n! / (n-r)!, resulting in 10P4 = 10 × 9 × 8 × 7 = 5040. The second example calculates the total number of 5-lettered words from the 26 alphabets, first without repetition (26P5 = 26 × 25 × 24 × 23 × 22) and then with repetition allowed (26^5). The third problem involves finding the number of 3-digit numbers between 100 and 999 that do not contain the digit 7, which is solved by considering the available digits for each place value (8 choices for the hundreds, 9 for tens, and 9 for units, resulting in 8 × 9 × 9 = 648). The final example asks for the number of 5-lettered words that start with 'a' and end with 'z' without repetition, which is calculated as 24P3 = 24 × 23 × 22 = 12144. The video concludes with a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title card for a lesson on 'PERMUTATION & COMBINATION'. The title is split into two parts, with 'PERMUTATION' over a roulette table and dice, and 'COMBINATION' over a fruit basket and a pizza. This visual metaphor illustrates the core concept: permutations are about ordered arrangements (like a lock combination), while combinations are about unordered selections (like a fruit basket). The scene then transitions to a presentation slide titled 'Confused' with the question 'Should I unlock with Permutation or Combination?'. This slide features a cartoon detective with a magnifying glass, standing between two locked doors labeled 'Permutation' and 'Combination', visually representing the confusion students often feel. The instructor, Yash Jain Sir, is shown in a small window, and the video title 'APTITUDE PROBLEMS ON PERMUTATION & COMBINATION' is displayed on a large yellow background.

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

    The instructor presents the first problem: 'If we have 10 people and 4 chairs, what are the number of ways to seat them?'. The on-screen text clearly states the question. The instructor explains that this is a permutation problem because the order of seating matters. He writes the permutation formula P(n,r) = n! / (n-r)! and substitutes n=10 and r=4, writing 10P4. He then expands the formula as 10! / (10-4)! = 10! / 6!. He further simplifies this by writing out the factorial as 10 × 9 × 8 × 7 × 6! / 6!, and the 6! terms cancel out, leaving the final calculation of 10 × 9 × 8 × 7.

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

    The second problem is introduced: 'Find the total number of 5 lettered words??'. The instructor presents two sub-questions: a) No repetition allowed, and b) Repetition allowed. For part (a), he explains that there are 26 alphabets (A-Z) and 5 slots. He writes the calculation as 26 × 25 × 24 × 23 × 22, which is 26P5. For part (b), he explains that with repetition allowed, each of the 5 slots can be filled with any of the 26 letters, so the total is 26^5. The instructor then moves to the third problem: 'Number of numbers between 100-999 which does not contain 7?'. He explains that this is a 3-digit number problem. He identifies the available digits for each place: for the hundreds place, digits 1-9 are available, but 7 is excluded, so 8 choices (1,2,3,4,5,6,8,9). For the tens and units places, digits 0-9 are available, but 7 is excluded, so 9 choices each (0,1,2,3,4,5,6,8,9). He writes the calculation as 8 × 9 × 9.

  4. 10:00 – 13:54 10:00-13:54

    The final problem is presented: 'In how many ways can we form a 5 lettered word? No repetition, starting with 'a' and ending with 'z'.'. The instructor explains that the first and last positions are fixed. The first letter is 'a' and the last is 'z', so the middle three positions are the only ones that can vary. He states that there are 24 letters left to choose from (26 total minus 'a' and 'z'). He then calculates the number of ways to fill the 3 middle slots as 24P3, which is 24 × 23 × 22. He performs the multiplication to get the final answer of 12144. The video concludes with a black screen displaying the text 'THANKS FOR WATCHING' in an orange and white box.

The video provides a structured and practical introduction to permutations and combinations. It begins by establishing the fundamental difference between the two concepts using relatable visual analogies. The core of the lesson is a series of progressively challenging, real-world problems. The instructor methodically applies the permutation formula P(n,r) to problems involving seating arrangements and word formation, clearly demonstrating the step-by-step calculation. He also addresses the case of repetition allowed, which is a key variation. The final problem integrates multiple constraints (fixed start and end letters), reinforcing the application of the concepts. The overall teaching style is clear, with a focus on problem-solving methodology, making it a useful resource for students preparing for aptitude tests.

Loading lesson…