Chocolate Picking Problem

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/quantitative-ability/permutation-and-combination/special-applied-problems/asset-chocolate-picking-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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 Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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 card and a slide that introduces the confusion between permutations and combinations, using a visual metaphor of a detective trying to unlock a door with a combination lock. The instructor then presents a specific problem: calculating the number of ways to choose 10 balls from three jars containing 6 green, 6 blue, and 5 red balls respectively. The solution is derived by setting up a system of equations for the number of balls taken from each jar (g, b, r) and solving for the number of non-negative integer solutions, which is a classic stars and bars problem. The final answer is calculated as 12 choose 10, which equals 66. 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 featuring the words 'PERMUTATION' and 'COMBINATION' over images of a dice game and a fruit basket. It then transitions to a presentation slide titled 'Confused' with the question 'Should I unlock with Permutation or Combination?'. The slide uses a visual metaphor of a detective with a magnifying glass trying to unlock two doors labeled 'Permutation' and 'Combination', both of which are locked. The instructor, Yash Jain, is visible in a small window in the bottom right corner. The slide also includes the 'Knowledge Gate Educator' logo and the text 'Basic To Advance'.

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

    The video displays a problem statement on a whiteboard: 'There are 3 jars, the first jar contains 6 identical green balls, the second jar contains 6 identical blue balls and third jar contains 5 identical red balls. Number of ways in which we can choose 10 balls from these 3 jars?'. The instructor then begins to solve it by defining variables: g for green, b for blue, and r for red. He sets up the equation g + b + r = 10, with the constraints 0 ≤ g ≤ 6, 0 ≤ b ≤ 6, and 0 ≤ r ≤ 5. He explains that this is a problem of finding the number of non-negative integer solutions to the equation with constraints. He then proceeds to calculate the total number of solutions without constraints (12 choose 10) and subtracts the invalid cases where the constraints are violated, such as g=7,8,9,10, b=7,8,9,10, and r=6,7,8,9,10. The final answer is shown as 12C10 = 66.

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

    The video concludes with a black screen featuring a large orange rectangle with the text 'THANKS FOR WATCHING' in white. The text is centered on the screen, and the video ends on this frame. This is a standard closing screen for the educational content.

The video provides a clear, step-by-step explanation of a combinatorics problem. It starts by establishing the context of permutations and combinations, then presents a specific problem involving selecting balls from jars. The core of the lesson is the application of the stars and bars method to find the number of non-negative integer solutions to an equation, with a focus on handling upper bounds by subtracting invalid cases. The instructor uses a combination of on-screen text, diagrams, and verbal explanation to guide the viewer through the logical process, culminating in the final answer of 66 ways.

Loading lesson…