Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Algorithms
Lecture 1
1.1 Time complexity (38:53)
1.2 Space Complexity (26:39)
1.3 Algorithms Comparison (17:09)
Solution
Quiz on Lecture 1
Lecture 2
2.1 Asymtotic Analysis (24:49)
2.2 Computing Complexity (30:48)
Solution
Quiz on Lecture 2
Lecture 3
3.1 Sorting Introduction (12:02)
3.2 Sorting Algorithms (28:08)
3.3 Quicksort (32:53)
3.4 Counting Sort (21:08)
Solution
Quiz on Lecture 3
Lecture 4
4.1 Radix Sort and Bubble Sort (8:08)
4.2 Introduction to Heap (14:38)
4.3 Heap Sort (26:18)
Solution
Quiz on Lecture 4
Lecture 5
5.1 Fractional Knapsack (13:57)
5.2 Huffman Encoding (34:44)
5.3 Activity Selection Problem (10:55)
5.4 Task Scheduling (12:55)
5.5 Task Scheduling with Deadline and Penalty (10:50)
Solution
Quiz on Lecture 5
Lecture 6
6.1 Graph - Introduction (16:50)
6.2 Breadth First Search (16:42)
6.3 Depth First Search (28:18)
6.4 Minimal Spanning Tree (26:08)
6.5 Djikstra's Algorithm (5:22)
Solution
Quiz on Lecture 6
Lecture 7
7.1 Divide and Conquer (29:05)
7.2 Dynamic Programming (28:31)
7.3 0/1 Knapsack (20:01)
7.3 Subset Sum Problem and Longest Common Subsequence (11:45)
Solution
Quiz on Lecture 7
Lecture 8
8.1 Hashing - Introduction (22:18)
8.2 Collision Resolving - Chaining (21:59)
8.3 Collision Resolving - Open Addressing (31:41)
Solution
Quiz on Letcure 8
Subject Test
Full subject Quiz
GATE Previous Year Questions
New Lecture
2014_S1_14_QUICK-SORT(C) (0:40)
2014_S2_14_BFS(B) (0:35)
2014_S1_42_Time-Complexity(C) (3:01)
2014_S2_37_DP(34-34) (1:56)
2014_S1_39_SORTING(147.1-148.1) (1:43)
2014_S2_13_RecurrenceRelation(A) (0:28)
2014_S1_40_HASH-TABLE(A) (0:52)
2014_S1_11_DFS(C) (0:59)
2014_S1_14_MST(A) (1:33)
2015_S3_17_HASHING (0:26)
2015_S1_31_TC (1:11)
2014_S3_37_DP(150-150) (1:24)
2014_S3_40_HASH-TABLE(A) (1:23)
2015_S1_2_TC (0:37)
2015_S1_43_MST (2:11)
2014_S2_38_HUFFMAN(358-358) (1:01)
2015_S1_6_GRAPH (0:37)
2015_S1_45_BFS (0:43)
2015_S3_4_COMPLEXITY (0:36)
2016_S2_11_BFS(31.0-31.0) (1:13)
2016_S1_13_SORTING(D) (1:24)
2017_S2_30_TC(B) (0:43)
2016_S2_14_GRAPH(C) (0:11)
2016_S1_38_GRAPH(12.0-12.0) (1:15)
2016_S1_40_GRAPH(B) (2:13)
2016_S2_35_LIC(C) (0:54)
2016_S1_11_SORTING(6.0-6.0) (0:12)
2016_S2_13_SORTING(D) (1:07)
2015_S3_42_TIME-COMPLEXITY (0:59)
2019_Q37 (1:07)
2016_S2_39_FLOWCHART(2.2-2.4) (0:54)
2017_S1_26_MST(A).png (0:58)
2017_S1_5_GRAPHS(C).png (0:13)
2017_S1_48_(5.0-5.0) (1:48)
2018_47_MST(4-4) (2:34)
2017_S2_15_BFS(D) (0:58)
2017_S2_50_HUFFMAN(225.0-225.0) (1:53)
2019_Q46 (2:20)
2019_Q38 (1:36)
2015_S3_40_MST (0:33)
2018_30_GRAPH(A) (1:42)
2017_S2_3_TC(C) (0:21)
2014_S2_52_MST(6-6) (1:55)
2019_Q20 (1:13)
2019_Q25 (2:56)
2017_S1_4_TC(B) (0:31)
2018_31_GRAPH(C) (4:11)
2018_48_GREEDY(16-16) (1:36)
2016_S1_39_GRAPH(7.0-7.0) (0:53)
2014_S3_13_DFS(19-19) (0:54)
4.1 Radix Sort and Bubble Sort
Complete and Continue
