Chocolate Picking Problem

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/digital-logic-circuits-discrete-math-structures/permutation-and-combination/special-applied-problems/asset-chocolate-picking-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…