The Design and Analysis of Algorithm Masterclass

Name: The Design and Analysis of Algorithm Masterclass
Rating: 4.2 (668 reviews)

Algorithm & Data Structures will help you to Crack Coding Interviews (C/C++Java/Python) Learn Algorithm Data Structures

Created byUp Degree

Last updated 6/2023

English

What you'll learn

Enhance Your Logical Thinking Abilities
Learn various Popular Data Structures and their Algorithms.
Knowing Algorithm Well helps you to Solve the Problem in a Better Way.
Learn Big O, Big Omega Big Theta Notation
Linear Search, Recurrence Relations
Factorial, Tail Recursion
Towers of Hanoi
Merge Sort, Quick Sort, Heap Sort
Knapsack Problem, Minimum Spanning Tree: Kruskal's Algorithm, Minimum Spanning Tree: Prim's Algorithm
Huffman's Codes - Building Huffman Tree, Dijkstra's Algorithm,Bellman Ford Algorithm, Floyd Warshall Algorithm
Brute Force Matcher
Pattern Pre-Processing
The Knuth Morris Pratt Algorithm
n-Queens Algorithm
Graph Coloring, Hamiltonian Cycles
0/1 Knapsack Problem
15 Puzzle Problem
NP Completeness and Approximation Algorithms
Will get to know Real time uses of all Algorithm
Get the answer of your "WHY" part behind use of every Algorithm

Course content

13 sections • 62 lectures • 12h 33m total length

About The Instructor3:30
Meet the instructor for the design and analysis masterclass, Dr. Tamal Chakravarty, who spent years in IT and academia teaching data structures, algorithms, C, C++, Java, AI, and mobile computing.
Objective of the Course2:33
Prerequisite to take the Course2:31
The course outlines good-to-have prerequisites—programming, basic mathematics including matrices and linear algebra, recurrence relations and induction, plus data structures and graphs—and emphasizes must-haves, including video-based learning.
Course Curriculum Overview5:15

Knapsack Problem13:32
Minimum Spanning Tree: Kruskal's Algorithm9:15
Disjoint Sets and Kruskal's Algorithm27:03
Job Sequencing with Deadlines20:50
Heap15:36
Heap Sort7:05
Build a max heap from the input array, swap the root with the last unsorted element, and repeatedly max-heapify the remainder to achieve heap sort in O(n log n).
Priority Queue14:03
Minimum Spanning Tree: Prim's Algorithm12:32
Apply greedy prim's algorithm to build a minimum spanning tree from a start vertex using a priority queue, initializing d and p, and performing extract-min and decrease-key operations.
Huffman's Codes - Building Huffman Tree13:03
Huffman's Codes - Printing Huffman Codes11:12
Quiz : Greedy Algorithm

Dijkstra's Algorithm Part #110:47
Explore the single source shortest path problem with Dijkstra's algorithm on a weighted directed graph, updating distances and routes to reveal the shortest paths from the source to all vertices.
Dijkstra's Algorithm Part #210:41
Dijkstra's Algorithm Part #35:50
Bellman Ford Algorithm11:02
Topological Sort8:11
Learn to compute a topological sort on a directed acyclic graph by visiting vertices with recursion and a stack, producing an order where each edge's source precedes its destination.
Shortest Path by Topological Sort7:08
Floyd Warshall Algorithm13:10
Quiz : Shortest Path Algorithm

Brute Force Matcher12:37
String Matching with Finite Automaton14:09
Pattern Pre-Processing8:21
Explore pattern preprocessing by building the failure/border array F for a pattern, identifying the longest border lengths of prefixes to enable efficient string matching with finite automata.
The Knuth Morris Pratt Algorithm10:28
Learn how the Knuth Morris Pratt string matching algorithm uses pattern preprocessing to guide matching, scans the text efficiently, and finds all pattern occurrences in linear time.
Quiz : The Problem of String Matching

Rat in Maze6:18
n-Queens Algorithm Part #114:52
n-Queens Algorithm Part #212:08
Explore the n-queens problem on an n by n chessboard using a place algorithm and backtracking to place all queens and enumerate all solutions.
Graph Coloring Part #115:53
Explore the graph coloring problem with backtracking to produce proper colorings, minimize colors, and understand the chromatic number, using an adjacency matrix and a seating example.
Graph Coloring Part #28:45
Hamiltonian Cycles I12:59
presents backtracking to solve the hamiltonian cycles problem on a graph, modeling with an n by n adjacency matrix, visiting every vertex exactly once and returning to the start.
Hamiltonian Cycles II10:08
Subset Sum14:55
Explore the subset sum problem with a backtracking approach, maximize total calories under 700, and relate it to knapsack ideas and branch-and-bound pruning.
Quiz : Backtracking

Requirements

Idea of Programming (Good To Have - NOT Mandatory)
Some Basic Mathematics (Good To Have - NOT Mandatory)
Basic Concepts of Data Structures (Good To Have - NOT Mandatory)
Little Familiarity with Graph Theory (Good To Have - NOT Mandatory)

Description

The algorithm is used everywhere. People Don't know how Complex algorithms they are executing when doing there day to day tasks like Riding a Bi-Cycle, Travelling from one place to another even Watering Gardens.

If you are Coder then the Knowledge of algorithms is Very much important for you. The knowledge of Algorithm teach you How to Think to solve a Problem?

The algorithm is the concept that differentiates one average software engineer and one better software engineer. In our daily life in the industry, we used different kinds of algorithms to make the system faster, better, and more efficient.

But the problem is 90% of the freshers and graduates don’t have the basic knowledge of algorithms. That is the reason we make this Design and Analysis of algorithm Masterclass.

What you are Going to Learn?

Asymptotic Notations, Recursion, Divide and Conquer, Dynamic Programming, Dijkstra's, Bellman-Ford, Floyd Warshall Algorithm, Kruskal's Algorithm, Knapsack Problem, String Matching with Finite Automaton, Heap sort, Huffman Codes, n-Queens Algorithm, Rat in Maze, 0/1 Knapsack Problem, 15 Puzzle Problem, NP-Completeness, Approximation Algorithms

12 hours of HD content [Updated on 2022 December]
Assignment [Updated]
Study Note [Updated]
Certificate

Every Single Day we will check your questions and solve your queries.

Topics covered :

Enhance Your Logical Thinking Abilities
Learn various Popular Data Structures and their Algorithms.
Knowing Algorithm Well helps you to Solve the Problem in a Better Way.
Learn Big O, Big Omega Big Theta Notation
Linear Search, Recurrence Relations
Factorial, Tail Recursion
Towers of Hanoi
Merge Sort, Quick Sort, Heap Sort
Knapsack Problem, Minimum Spanning Tree: Kruskal's Algorithm, Minimum Spanning Tree: Prim's Algorithm
Huffman's Codes - Building Huffman Tree, Dijkstra's Algorithm, Bellman-Ford Algorithm, Floyd Warshall Algorithm
Brute Force Matcher
Pattern Pre-Processing
The Knuth Morris Pratt Algorithm
n-Queens Algorithm
Graph Coloring, Hamiltonian Cycles
0/1 Knapsack Problem
15 Puzzle Problem
NP-Completeness and Approximation Algorithms
Will get to know Real-time uses of all Algorithm
Get the answer of your "WHY" part behind the use of every Algorithm

Who this course is for:

Computer science students
Software working professionals who wants to learn better way to Solve a Problem

The Design and Analysis of Algorithm Masterclass

What you'll learn

Explore related topics

Course content

Introduction & Overview4 lectures • 14min

Introduction to Algorithms1 lecture • 8min

Asymptotic Notations3 lectures • 35min

Recursion4 lectures • 51min

Divide and Conquer6 lectures • 1hr 27min

Dynamic Programming4 lectures • 1hr 18min

Greedy Algorithms10 lectures • 2hr 24min

Shortest Path Algorithms7 lectures • 1hr 7min

The Problem of String Matching4 lectures • 46min

Backtracking8 lectures • 1hr 36min

Requirements

Description

Who this course is for: