Generating Permutations, Combinations, Next Bit String | Lecture 44 | Discrete Structures | CSIT, TU скачать в хорошем качестве

Generating Permutations, Combinations, Next Bit String | Lecture 44 | 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 discuss the topic of generation of permutations and combinations. First the core idea and a few examples are discussed related to the generation of permutations of objects taken all at a time. This is followed by generalizing the concepts into an algorithm, described using proper pseudocode. The next section of the video discusses combinations taking a subset of a given size at a time, and provides the pseudocode to generate C(n,r). We then quickly discuss an auxiliary algorithm used to generate all possible combinations form a set, of all possible sizes. This algorithm is shown to be analogous to binary counting and the algorithm to generate the next binary string is provided. The final section deals with the missing part of the puzzle, generating P(n,r) which is demonstrated to be a direct result from the past two algorithms, namely C(n, r) and P(n,n). 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 2:38 Generating Permutations: Core Concept 11:12 Generating Permutations: Pseudocode 24:25 Generating Combinations: Core Concept 33:42 Generating Combinations: Pseudocode 40:01 Generating the Next Bit String (All Combinations) 48:05 Generating r-Permutations ------ 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 of Indistinguishable Objects a...   Next Video: Coming Soon 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, generating permutations, generating combinations, generating next bit string, permutation algorithm, combination algorithm