Tricks to Solve Grouping Type Questions in P&C

Duration: 12 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/permutation-and-combination/circular-grouping-permutations/asset-tricks-to-solve-grouping-type-questions-in-pc after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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: Basics of COA, 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, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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 a title slide that visually distinguishes between permutations and combinations using examples like a dice game and a fruit basket. The main content starts with a problem: "In how many ways can we arrange 4 boys and 5 girls?" The instructor explains that this is a permutation problem because the order of arrangement matters. He calculates the total number of arrangements as 9! (362,880), representing the permutation of 9 distinct individuals. The lecture then transitions to a more complex problem involving 5 boys and 4 girls, with four different constraints: (a) no two girls are together, (b) no two boys are together, (c) a particular pair of girls always sits together, and (d) a particular pair of girls do not sit together. For each case, the instructor uses the fundamental principles of permutations, including treating a group as a single unit and applying the formula nPk = n! / (n-k)!. The video concludes with a final 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title slide that introduces the topic of permutations and combinations. The slide is divided into four quadrants: the top-left shows a dice game, the top-right shows a fruit basket, the bottom-left shows a pizza, and the bottom-right shows two people in an office. The words "PERMUTATION" and "COMBINATION" are prominently displayed. 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 character and two lockboxes labeled "Permutation" and "Combination". The instructor, Yash Jain, is visible in a small window in the bottom right corner. The slide also includes the branding for "Knowledge Gate Educator" and the text "Basic To Advance".

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

    The video displays a problem on a yellow background with a pattern of small shapes. The problem is: "q: In how many ways can we arrange 4 boys and 5 girls?" The instructor begins to solve this by identifying the total number of students as 9. He explains that since the question is about arranging people, the order matters, which makes it a permutation problem. He writes the formula for the total number of arrangements as 9!, which he calculates as 362,880. He also notes that the arrangement of the 4 boys is 4! and the arrangement of the 5 girls is 5!, but clarifies that for the total arrangement of all 9 individuals, it is simply 9!.

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

    The video presents a new problem: "q: 5 Boys and 4 Girls" with four sub-questions. The instructor begins to solve the first part, (a) "No two girls are together". He explains that to ensure no two girls are together, the boys must be arranged first, creating spaces between them where the girls can be placed. He writes the arrangement of 5 boys as B1 B2 B3 B4 B5, which creates 6 possible spaces (before, between, and after the boys). He then explains that the 4 girls must be placed in 4 of these 6 spaces, which is a permutation of 6 items taken 4 at a time, written as 6P4. He calculates this as 6! / (6-4)! = 6! / 2! = 360. He then multiplies this by the number of ways to arrange the 5 boys, which is 5!, to get the total number of arrangements for this condition.

  4. 10:00 – 12:22 10:00-12:22

    The instructor continues to solve the remaining parts of the problem. For part (b) "No two boys are together", he explains that the girls must be arranged first, creating spaces for the boys. He writes the arrangement of 4 girls as G1 G2 G3 G4, which creates 5 spaces. He then calculates the number of ways to place 5 boys in these 5 spaces as 5P5, which is 5!. He multiplies this by the number of ways to arrange the 4 girls, which is 4!, to get the total. For part (c) "Particular pair of girls always sit together", he treats the pair as a single unit, so there are 8 items to arrange (the pair and the other 7 individuals). He calculates the number of arrangements as 8! and multiplies it by 2! (the number of ways the pair can be arranged within their unit). For part (d) "A particular pair of girls do not sit together", he explains that this is the total number of arrangements minus the number of arrangements where the pair sits together. He writes the formula as #total - #sit together, which is 9! - (8! x 2!). The video ends with a black screen that says "THANKS FOR WATCHING".

The video provides a structured and progressive lesson on permutations and combinations. It begins by establishing the fundamental difference between the two concepts using visual metaphors. The core of the lesson is a series of worked examples that build in complexity. The first example is a straightforward permutation of 9 distinct individuals. The second example, involving 5 boys and 4 girls, systematically applies the principles of permutations to solve four different constrained arrangement problems. The instructor demonstrates key problem-solving techniques, such as treating a group as a single unit and using the principle of subtraction to find the number of arrangements where a condition is not met. The progression from simple to complex problems effectively reinforces the core concepts of permutation and combination.

Loading lesson…