У нас вы можете посмотреть бесплатно Recursion, Recursive Sequences, Sets & Structures | Lecture 32 | 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 discuss the basics of recursive definitions and recursively defined functions. We then look into several examples, which include generating sequences and forming definitions from problem statement. We then look into recursively defined sets, and look into two special recursive definitoins: length of a string and concatenation of two strings. Finally as an extra we talk about the closed form formula for the fibonacci sequence, the Binet's Formula. 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:24 Recursive Definitions 6:02 Recursively Defined Functions: Generating sequences 7:55 Recursive Functions: Forming Definitions 12:25 Recursively Defined Sets 15:21 Recursive Defintion of Length of String 16:53 Recursive Concatenation 20:18 Binet's Formula ------ 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: • Well Ordering Principle, Problems and Solu... Next Video: • More Recursive Structures: Well Formed For... 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, induction and recursion, induction, recursion, recursive defintions, recursive functions, recursive sets, recursive sequences, recursive structures, recursive length of string, recursive concatenation, binet's formula