Recurrence Relation Made Easy
What you'll learn
- solve the running time of algorithms and programs
- change a recursive function into a recurrence relation
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 this course is for:
- Any computer science, computer engineering, or IT student should take this course
Course content
- Preview02:08
- 3 questionsQuiz: What are recurrence relations ?
- Preview10:20
- 3 questionsQuiz: Convert more recursion functions
Instructor
![Rodney Anderson](data:image/svg+xml,%3Csvg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64"%3E%3C/svg%3E){kind=avatar}
- 3.5 Instructor Rating
- 37 Reviews
- 236 Students
- 2 Courses
Hi ,
I am a Programmer Analyst. I got my bachelors of science degree in Computer Science and am currently taking master courses in computer science with a speciality in data analytics. I have worked in the IT department for over 5 years now, and have learned so much about the business and IT. With my experience, I have created my own website where I share information on computer science topics to students for free,and all in one place. At the same time I was able to improve my web programming skills. I have made videos on mathematics and programming online.
I enjoy playing basketball, football, volleyball, tennis, biking, making videos and exercising in general. I watch allot of videos on mathematics, physics, and technology for leisure time. I would like to travel around the world someday soon. Programming allows me to create my own world using my own rules. Usually if I am not at work or at the gym I am helping friends and family to program. My future plans are to create an android game for fun, have my masters degree in computer science / data analytics, making tutorial videos at home, and spend more time with friends and family.