Discrete Math I (Entire Course) - Discrete Math - 5.4.1 Recursive Algorithms
Unlock the Logic: Master Discrete Math with Kimberly Brehm – From Propositions to Graphs, Equip Yourself with Essential Problem-Solving Skills!
5.0(2)
18 learners
What you'll learn
Understand and apply logical operations and connectives in propositions.
Construct truth tables to evaluate compound statements and logical equivalences.
Translate complex logic statements into predicate logic with quantifiers.
Utilize set theory and functions in solving mathematical and real-world problems.
This course includes
18.5 hours of video
Certificate of completion
Access on mobile and TV
Summary
Full Transcript
Revisiting writing algorithms, this time related to recursive definitions. We also look at how to prove an algorithm.
Video Chapters:
Introduction 0:00
Recursive Algorithms 0:12
Pseudocode for GCD 1:32
Pseudocode for Computing n! 4:49
Pseudocode for computing a^n 6:58
Prove Algorithm for a^n 8:48
Up Next 10:09
Textbook: Rosen, Discrete Mathematics and Its Applications, 7e
Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
