About this Live Course
This Live course will cover all the concepts of Algorithms under the Computer Science/IT/IS branch syllabus for 2nd year. This course is specially designed to help you understand the concepts you need help in. This course will help you in solving numerical, answer questions, understand concepts & help you prepare for internal/exams.
Online Classes Advantage with Great Learning Academy:
- Live Interactive Classes
- Structured Classes & Schedule
- Access recording of missed classes
- PYQs and Practice questions
Concepts covered
-
Performance Analysis
-
Asymptotic Notations
-
Problem Types
-
Divide/Decrease & Conquer
-
Greedy Method
-
Prim’s/Kruskal’s/Dijkstra's Algorithms
-
Huffman Trees & Codes
-
Transform & Conquer
-
Dynamic Programming
-
Backtracking
-
Transitive Closure
-
0/1 Knapsack problem
-
...
Class Schedule
-
Introduction to Algorithms and Asymptotic NotationsFri, 16 Oct, 5:00 PM IST 1 hr
-
Computation of Time ComplexityMon, 19 Oct, 5:00 PM IST 1 hr
-
Computation of Time Complexity Part 2Tue, 20 Oct, 5:00 PM IST 1 hr
-
Computation of Time Complexity Part 3Wed, 21 Oct, 5:00 PM IST 1 hr
-
Merge Sort and It's Time Complexity AnalysisFri, 23 Oct, 3:00 PM IST 1 hr
-
Quick Sort and It's Time Complexity AnalysisFri, 23 Oct, 5:00 PM IST 1 hr
-
Bubble Sort and It's Time Complexity AnalysisMon, 26 Oct, 5:00 PM IST 1 hr
-
Selection Sort and It's Time Complexity AnalysisTue, 27 Oct, 5:00 PM IST 1 hr
-
Insertion Sort and It's Time Comlexity AnalysisWed, 28 Oct, 5:00 PM IST 1 hr
-
Heap Sort and It's Time Complexity AnalysisMon, 02 Nov, 5:00 PM IST 1 hr
-
Sorting in Linear Time - Counting Sort, Radix SortTue, 03 Nov, 5:00 PM IST 1 hr
-
Binary Search Process - Algorithm and ProgramWed, 04 Nov, 5:00 PM IST 1 hr
-
Greedy Algorithms - Job Sequencing Problem, Knapsack ProblemThu, 05 Nov, 5:00 PM IST 1 hr
-
Optimal Merge Pattern, Huffman CodingFri, 06 Nov, 5:00 PM IST 1 hr
-
Minimal Spanning Tree - Prim's and Kruskal's AlgorithmsMon, 09 Nov, 5:00 PM IST 1 hr
-
Dijkstra AlgorithmTue, 10 Nov, 5:00 PM IST 1 hr
-
Travelling Salesman ProblemWed, 11 Nov, 5:00 PM IST 1 hr
-
Dynamic Programing Problems - Knapsack 0/1, Longest Common SubsequenceThu, 12 Nov, 7:30 PM IST 1 hr
-
Matrix Chain MultiplicationFri, 13 Nov, 11:00 AM IST 1 hr
-
Matrix Chain Multiplication -2Tue, 17 Nov, 5:00 PM IST 1 hr
-
Graph Based Algorithms - Travsersal Methods (BFS and DFS)Wed, 18 Nov, 5:00 PM IST 1 hr
-
Hamiltoneon Path, Euler Path, Graph ColoringThu, 19 Nov, 5:00 PM IST 1 hr
-
NP CompletenessFri, 20 Nov, 5:00 PM IST 1 hr
About the Mentor
Mr. Setu Maheshwari
M.Tech. Computer Science & Engineering
Faculty for Computer Science Engineering