Ending In:

access

lifetime

content

3 Hours

**Description**

- Access 32 lectures & 3 hours of content 24/7
- Learn the concepts behind the most popular algorithms used in computer science
- Understand how algorithms work w/ the help of diagrams, examples & pseudocode
- Practice algorithm implementation w/ the help of included programs in C language
- Understand how to use algorithms to implement logic in any programming

Engineering Mentor is an online educational start-up, providing educational resources to IT and non-IT students. At Engineering Mentor, we create high quality resources in clear and easy to understand methods.

We have a team of qualified engineers who create resources to guide students through the toughest aspects of technical and non-technical education.

We have a team of qualified engineers who create resources to guide students through the toughest aspects of technical and non-technical education.

Details & Requirements

- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: all levels, but a basic knowledge of C would be helpful

Compatibility

- Internet required

**Terms**

- Unredeemed licenses can be returned for store credit within 15 days of purchase. Once your license is redeemed, all sales are final.

- Introduction
- Course Introduction and Author Bio (3:33)
- Course Curriculum & Upcoming lectures

- Brute Force Approach
- Selection Sort Algorithm (4:35)
- Bubble Sort Algorithm (5:27)
- Sequential Search Algorithm (6:11)
- Brute Force String Matching Algorithm (6:40)
- Brute Force Quiz

- Divide and Conquer Approach
- Merge Sort Algorithm (8:59)
- Quick Sort Algorithm (8:03)
- Divide and Conquer Quiz

- Decrease and Conquer Approach
- Binary Search Algorithm (11:40)
- Insertion Sort Algorithm (4:48)
- Depth First Search Algorithm (6:18)
- Breadth First Search Algorithm (8:04)
- Decrease and Conquer Quiz

- Transform and Conquer Approach
- Heaps (6:25)
- Heap Construction bottom-up approach
- Heap Sort Algorithm (7:18)

- Dynamic Programming
- Warshall's Algorithm (9:29)
- Floyd's Algorithm (14:18)
- Dynamic Programming Quiz

- Greedy Technique
- Prim's Algorithm (10:10)
- Kruskal's Algorithm (3:52)
- Greedy Technique Quiz

- Bonus Section : Time Complexity
- Introduction to Analysis of Algorithms (7:38)
- Asymptotic Notations (6:15)
- Time Complexity - Selection Sort Algorithm (3:22)
- Time Complexity - Bubble Sort Algorithm (3:46)
- Time Complexity - Sequential Search Algorithm (2:52)
- Time Complexity - String Matching Algorithm (3:48)
- Time Complexity - Insertion Sort Algorithm (3:36)
- Time Complexity - Warshall's Algorithm (1:59)
- Time Complexity - Floyd's Algorithm (2:14)
- Master Theorem (8:26)
- Time Complexity Quiz

- Number Theoretic Algorithms
- Euclid's Algorithm GCD of two numbers
- C Program on Euclid's Algorithm
- RSA Algorithm (6:23)
- Number Theory Quiz

access

lifetime

content

3 Hours