Tricks to Solve Necklace Based Problems

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/general-mental-ability-logical-reasoning/permutation-and-combination/circular-grouping-permutations/asset-tricks-to-solve-necklace-based-problems after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, 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), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, 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, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, 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, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length 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 solving problems related to arranging objects in a circle, such as a necklace. The instructor begins by introducing the core concepts of permutation and combination, using a visual metaphor of a detective trying to unlock a door with a permutation or combination lock. The main topic is a problem involving a necklace with 5 red, 6 green, and 3 yellow stones. The video presents two scenarios: one where the stones are not identical (distinct) and another where they are identical. For the distinct case, the instructor explains that the total number of arrangements is 13! (13 factorial), but because the necklace is circular, the formula is 13!/13, which simplifies to 12!. For the identical stones case, the formula is 13! divided by the product of the factorials of the counts of each color (5! for red, 6! for green, and 3! for yellow), and then divided by 13 for the circular arrangement. The instructor uses a whiteboard to write out the formulas and calculations, and 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 that visually contrasts 'PERMUTATION' with a casino theme (dice, roulette) and 'COMBINATION' with a pizza and office theme. It then transitions to a slide titled 'Confused' which poses the question 'Should I unlock with Permutation or Combination?'. The slide features a cartoon detective with a magnifying glass, standing between two doors labeled 'Permutation' and 'Combination', both of which are locked. The instructor, Yash Jain, is visible in a small window, and the video is branded with 'Knowledge Gate Educator'. This segment sets up the core confusion between permutation and combination that the lecture will address.

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

    The video displays a problem statement on a yellow background with a pattern of small shapes. The text reads: 'a) Necklace 5 Red, 6 Green and 3 Yellow, not identical stone.' and 'b) Stones are identical'. The instructor begins to solve the problem for the first case (a), where the stones are not identical. He writes on the screen, '13!' to represent the total number of stones, and then writes '13 stones' to confirm the total count. He explains that for a linear arrangement, the number of ways to arrange 13 distinct items is 13!. He then draws a circle to represent the necklace, indicating that the arrangement is circular.

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

    The instructor continues to solve the problem. For the circular arrangement of 13 distinct stones, he writes the formula '13! / 13', which simplifies to '12!'. He then moves to the second case (b), where the stones are identical within their colors. He writes the formula for the number of distinct arrangements as '13! / (5! * 6! * 3!)'. He then applies the circular arrangement correction by dividing this result by 13, writing the final formula as '13! / (5! * 6! * 3! * 13)'. He explains that this accounts for the rotational symmetry of the necklace. The video ends with a 'Thanks for Watching' screen.

The video provides a clear, step-by-step explanation of how to solve a classic permutation problem involving a circular arrangement. It begins by establishing the fundamental difference between permutation and combination. The core of the lesson is a worked example of arranging a necklace with colored stones. The instructor methodically breaks down the problem into two cases: one with distinct stones and one with identical stones of the same color. For the distinct case, he applies the formula for circular permutations (n!/n). For the case with identical items, he uses the multinomial coefficient (n! / (n1! * n2! * ... * nk!)) and then applies the circular correction. The visual aids, including the whiteboard calculations and the initial title card, effectively reinforce the concepts being taught.

Loading lesson…