Circular Arrangements on Groups
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
- Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
- Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
- Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
- Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
- Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
- Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
- Section B | Networking: 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
- Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
- Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
- Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- 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, specifically focusing on circular arrangements. The instructor begins by introducing the topic of circular arrangements on groups, using a problem involving 6 boys and 7 girls. The first problem presented is to find the number of ways to arrange them in a circle such that all girls sit together. The solution involves treating the group of 7 girls as a single unit, which is then arranged with the 6 boys in a circle. The formula for circular arrangement of n distinct objects is (n-1)!, so the 7 units (6 boys + 1 girl group) are arranged in (7-1)! = 6! ways. The girls within their group can be arranged among themselves in 7! ways. The total number of arrangements is the product of these two values: 6! × 7!. The video then presents a second problem where only 2 specific girls must sit together, treating them as a single unit, resulting in 12 units (6 boys + 1 unit of 2 girls + 5 other girls) to be arranged in a circle, leading to (12-1)! = 11! arrangements, with the 2 girls arranged in 2! ways within their unit, for a total of 11! × 2!. The third problem is to arrange them such that no two girls are seated together. The solution involves first arranging the 6 boys in a circle (5! ways), which creates 6 gaps between them. The 7 girls are then placed in these gaps, one in each, which can be done in 7! ways. The total is 5! × 7!. The final problem is to arrange them such that no two boys are seated together. This is solved by first arranging the 7 girls in a circle (6! ways), creating 7 gaps, and then placing the 6 boys in these gaps, one in each, which can be done in 6! ways. The total is 6! × 6!. The video concludes with a final example of alternating boys and girls, which is not fully explained. The lecture uses a digital whiteboard to write out the problems and solutions, with the instructor providing a step-by-step explanation.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card for a lesson on 'PERMUTATION' and 'COMBINATION', using visual metaphors of a dice game and a fruit basket to represent the concepts. The instructor, Yash Jain, introduces the topic of 'Circular Arrangement on Groups'. The first problem is presented on screen: 'q: 6 Boys and 7 Girls Circular AND all girls want to sit together?'. The instructor begins to explain the solution by treating the 7 girls as a single unit, which is a key concept in solving such problems.
2:00 – 5:00 02:00-05:00
The instructor continues to solve the first problem. He writes on the digital board that the 7 girls form a single unit, so there are 6 boys + 1 unit = 7 units to arrange in a circle. He explains that the number of ways to arrange n distinct objects in a circle is (n-1)!, so the 7 units can be arranged in (7-1)! = 6! ways. He then writes '6!'. He explains that the girls within their unit can be arranged among themselves in 7! ways. He writes '7!' and then the total number of arrangements is the product: 6! × 7!. He also draws a circle to represent the circular arrangement.
5:00 – 10:00 05:00-10:00
The instructor moves to the second problem: 'q: 6 Boys and 7 Girls Circular AND 2 girls want to sit together?'. He treats the 2 specific girls as a single unit, so the total number of units is 6 boys + 1 unit of 2 girls + 5 other girls = 12 units. He writes '12 units' and then '12-1 = 11!'. He explains that the 12 units can be arranged in a circle in (12-1)! = 11! ways. The 2 girls within their unit can be arranged in 2! ways. The total is 11! × 2!. He then presents the third problem: 'q: 6 Boys and 7 Girls Circular AND no two girls are seated together?'. He explains that first, the 6 boys are arranged in a circle, which can be done in (6-1)! = 5! ways. This creates 6 gaps between the boys. The 7 girls are then placed in these 6 gaps, but since there are 7 girls and only 6 gaps, this is impossible. He then corrects himself, realizing the problem is to place the girls in the gaps such that no two are together, which requires the boys to be arranged first. He writes '6!'. He then explains that the 6 boys create 6 gaps, and the 7 girls must be placed in these gaps, but since there are more girls than gaps, it's impossible to have no two girls together. He then presents the fourth problem: 'q: 6 Boys and 7 Girls Circular AND no two boys are seated together?'. He explains that first, the 7 girls are arranged in a circle, which can be done in (7-1)! = 6! ways. This creates 7 gaps between the girls. The 6 boys are then placed in these 7 gaps, one in each, which can be done in 6! ways. The total is 6! × 6!.
10:00 – 10:16 10:00-10:16
The video concludes with a final problem: 'q: 6 Boys and 7 Girls Circular AND alternatively?'. The instructor begins to write a diagram of a circle with alternating B and G, but the video ends before the solution is fully explained. The final frame is a black screen with the text 'THANKS FOR WATCHING'.
The video provides a comprehensive, step-by-step tutorial on solving circular arrangement problems with constraints. It systematically progresses from a basic problem (all girls together) to more complex ones (specific girls together, no two of a gender together). The core method demonstrated is the 'unit method', where a group of people who must sit together is treated as a single entity. The instructor clearly explains the fundamental formula for circular permutations, (n-1)!, and applies it to different scenarios. The video effectively uses visual aids on a digital whiteboard to illustrate the arrangement of people and the creation of gaps, which is crucial for solving problems where certain individuals cannot sit together. The progression of problems demonstrates a logical teaching strategy, building from simple to more challenging concepts, making it a valuable resource for students learning permutations and combinations.