Permutation of Indistinguishable Objects and Boxes | Lecture 43 | Discrete Structures | CSIT, TU скачать в хорошем качестве

Permutation of Indistinguishable Objects and Boxes | Lecture 43 | Discrete Structures | CSIT, TU

Welcome to The Digital Nerds, your premier source for comprehensive Computer Science courses, meticulously curated from prestigious Nepalese universities. I'm Anjesh Kafle, a computer engineer and seasoned educator dedicated to delivering a tailored educational experience that meets your academic aspirations. While our focus is on bringing Nepalese universities' expertise to the forefront, our content's universal relevance ensures its value extends globally. Here at The Digital Nerds, we're not just about teaching – we're about inspiring curiosity, fostering a learning environment, and preparing you for a world that's increasingly digital. Let's embark on this exciting journey of learning together! ------ In this video, we begin the discussion of Permutations of objects in which certain indistinguishable groups might be present. The first section elaborates the general technique and formula used to solve this kind of problem, and demonstrates how the formula originates. Then a couple of related problems are solved, one involving permutations of a word, and another involving dealing cards to players for a card game. Then we offer two more problems, one that involves placing indistinguishable objects into distinguishable boxes, and demonstrate that this class of probem is the same as the problem of combination with repitition allowed. The final probelm involves placing indistinguishable objects in indistinguishable boxes, for which we reveal that there is no closed form formula, and adapt a solution that involves exhaustive listing. This video belongs to the playlist: Discrete Structures Full Course for Tribhuwan University, under the BSc CSIT programme. ------ Chapters: 0:00 Scope of the Video 0:57 Permutations of Indistinguishable Objects: Concept 6:29 Numerical 1 (Permutations of "SUCCESS") 10:45 Numerical 2 (Permutations of Dealing Cards) 15:34 Numerical 3 (Indistinguishable Objects, Distinguishable Boxes) 20:12 Numerical 4 (Indistinguishable Objects And Boxes) ------ Make sure to like, share and subscribe! ------ Credits: Text-Book: Kenneth H. Rosen | Discrete Mathematics and its Applications Kolman | Discrete Mathematical Structures ------ References: Previous Video:    • Permutation & Combination | Circular | Wit...   Next Video:    • Generating Permutations, Combinations, Nex...   My Freelancing Profile: https://www.fiverr.com/googlesheetspro Our Facebook Page:   / 100095563598803   ------ All content is for educational purposes only. ------ Keywords: discrete structures, discrete mathematics, csit, course series, computer science, counting and discrete probability, counting, discrete probability, generalized permutations and combinations, permutations of indistinguishable objects, distinguishable objects and boxes, combination with repitition