У нас вы можете посмотреть бесплатно Basics of Counting, Sum, Product Rule, Numericals | Lecture 38 | Discrete Structures | CSIT, TU или скачать в максимальном доступном качестве, видео которое было загружено на ютуб. Для загрузки выберите вариант из формы ниже:
Если кнопки скачивания не
загрузились
НАЖМИТЕ ЗДЕСЬ или обновите страницу
Если возникают проблемы со скачиванием видео, пожалуйста напишите в поддержку по адресу внизу
страницы.
Спасибо за использование сервиса ClipSaver.ru
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 start a new topic of Counting and Discrete Probability, with this video covering the basic principles of counting. We introduce the Sum and Product Rules, and provide six different numericals that relate to these rules. Next we introduce and solve a problem under the subtraction rule, or the Inclusion Exclusion Principle. Finally we look into a problem that demonstrates the process of counting, using trees. 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 1:21 Sum and Product Rules 5:42 Numerical 1 (Product Rule) 9:19 Numerical 2 (Product Rule) 11:40 Numerical 3 (Bit Strings, Product Rule) 14:26 Numerical 4 (Counting Functions) 17:10 Numerical 5 (Sum Rule) 18:37 Numerical 6 (Sum and Product Rule) 23:10 Numerical 7 (Subtraction Rule) 27:54 Numerical 8 (Counting with trees) ------ 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: • Proving Recursive Algorithms Correct | Lec... Next Video: • (Generalized) Pigeonhole Principle | Proof... 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, basic principle of counting, sum rule, product rule, subtraction rule, inclusion exclusion principle, counting with trees