3.4 (9 ratings)
49 students enrolled
Wishlisted Wishlist

A guide to solving any recursion program, or recurrence relation.
3.4 (9 ratings)
49 students enrolled
Created by Rodney Anderson
Last updated 7/2017
English
Current price: \$12 Original price: \$40 Discount: 70% off
3 days left at this price!
30-Day Money-Back Guarantee
Includes:
• 1 hour on-demand video
• 1 Article
• 3 Supplemental Resources
• Access on mobile and TV
• Certificate of Completion

### Training 5 or more people?

What Will I Learn?
• solve the running time of algorithms and programs
• change a recursive function into a recurrence relation
View Curriculum
Requirements
• Students should have a basic understanding of programming and algebra
Description

This course is a simplified course for solving recursive functions using different methods to solve them such as the Master Theorem, Iterative Substitution, and Induction. In this course the student will be able to solve the running time of a recursive function or algorithm using terms like Big-Oh, Big-Theta, or Big Omega. This course is great for anyone taking a course in computer science, computer engineering, mathematics, Information Technology or anyone who wants to understand how programmers compare code.

This course is targeted to computer science, computer engineering and Information Technology students wanting to learn how to solve recurrence relations and gain a deeper understanding about asymptotic such as Big-Oh, Big-Theta, and Big –Omega, or anyone in a technical field.

Included in the course are video lessons, quizzes, and PDF documents with examples of recurrence relation problems, and examples of how to solve them. Each quiz is a multiple-choice quiz, and each answer has an explanation for reasons why it’s wrong or right. Each document comes from the video lesson, so while the student is watching the videos s/he will be able to pause read over and review the document.

The student will learn how solve recurrence relations and come out with an understanding of Asymptotic within just 63min. that's about the time it would take for one day of a computer science class!

This course is structured first by a video lesson on the subject at hand and then a quiz afterwards to make sure the student understood the material in the video lesson. The lessons start off with an introductory lesson on recurrence relation and then each preceding lesson will build upon the previous.

Students should take this course for an easy to understand explanation of recurrence relations and different ways to solve them in less then the time it would take for a professor at a university to teach the subject.

Who is the target audience?
• Any computer science, computer engineering, or IT student should take this course
Compare to Other recurrence relation Courses
Curriculum For This Course
9 Lectures
01:22:57
+
Understanding Recurrence Relations
2 Lectures 12:28

This is an introductory video on recurrence relation, here I define a recurrence relation and give examples.

Preview 02:08

It's always good to be able to identify a recurrence relation

Quiz: What are recurrence relations ?
3 questions

Learn how to convert a recursion function into a recurrence relation.

Preview 10:20

These are quizzes on converting a recursion function into a recurrence relation

Quiz: Convert more recursion functions
3 questions
+
Solve Asymptotics (Big-Oh, Big-Theta, and Big-Omega)
3 Lectures 27:26

Learn what the terms like Big O, Big Theta, and Big Omega mean.

Big -O
07:12

These quizzes will help students to better understand Big Oh.

Quiz: Asymptotic - Big-Oh
5 questions

This video gives an understanding of Big - Omega

Big - Omega
12:06

This lecture is on Big - Theta and how to solve it.

Big - Theta
08:08

Quizzes on Big Theta

Quiz: Asymptotic - Big Theta
5 questions
+
Solve Recurrence Relation Running TIme
4 Lectures 27:38

Learn how to solve recurrence relation running time using the iterative substitution method.

Solve recurrence relation by Iterative substitution
20:01

Learn how to solve recurrence relation running time using the Master Theorem.

Solve recurrence relation using the Master Theorem
03:26

In this quiz you will solve recurrence relations.

Quiz: Solving Recurrence Relations
6 questions

This is a ebook guide from all of the lectures put into one, with some more advance solutions to solve recurrence relations, enjoy !

Summary
16 pages