Playlist Duration

Playlist · Gate Smashers

Design and Analysis of algorithms (DAA)

by Gate Smashers · 79 videos

Listed in Best free GATE CSE courses on YouTube, ranked by total hours

Total watch time

13h 1m

at 1× speed · exactly 13 hours, 53 seconds at 1×

At an hour a day you'd finish in 14 days

The shape of the course

79 videos in blocks of 10 · each column is a block's total, to scale

1h 30m
1h 18m
1h 32m
1h 53m
1h 49m
2h 14m
1h 27m
1h 17m

WatchedTo watch

Compare Open on YouTube JSON

Next time, skip the copying: change youtube.com to playlistduration.com in any playlist, video or channel address and it opens here. Or see the total on YouTube itself, with our extension for Chrome, Firefox or Edge.

Your plan

Plan to finish

About 14 days at an hour a day

Pick a daily pace and the days you'll watch. Ticked videos are skipped.

Days

At one hour a day, every day, this playlist takes about 14 days. Turn on JavaScript to plan around your week.

Videos (79)

13h 1m in total · tick what you've watched

Tick videos you've watched — progress is saved in this browser. Titles open on YouTube in a new tab.

Videos to
Watched
1 L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA 11:27 2020-01-07
2 L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA 7:51 2020-01-08
3 L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm 14:25 2020-01-15
4 L-1.4: Various Properties of Asymptotic Notation with Example | Algorithm | DAA 8:56 2020-01-16
5 L-1.5: Comparison of Various Time Complexities | Different types in Increasing Order| Must Watch 9:41 2020-01-16
6 L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams 12:52 2018-12-05
7 L-1.7: Question#1 on Comparison of Various Time Complexities | GATE Questions 6:34 2020-01-17
8 L-1.8: Question#2 on Comparison of Various Time Complexities | GATE Questions 5:26 2020-01-19
9 L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them 7:15 2020-01-19
10 L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm 5:38 2020-01-19
11 L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm 7:40 2020-01-19
12 L-2.4: Recurrence Relation [ T(n)= 2T(n/2) +n] | Substitution Method | Algorithm 8:57 2021-09-02
13 L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm 10:23 2021-09-04
14 L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm 6:34 2020-01-20
15 L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm 3:58 2020-01-22
16 L-2.8: Recurrence Relation T(n)=T(√n)+logn | Master Theorem 6:26 2021-04-25
17 L-2.9: Recurrence Relation [T(n)= 2T(n/2) +cn] | Recursive Tree method | Algorithm 7:14 2021-10-11
18 L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm 9:31 2021-10-12
19 L-3.0: Divide and Conquer | Algorithm 4:03 2021-03-12
20 L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer 13:27 2020-01-20
21 L-3.2: Performance of Quick Sort | Worst Case Time Complexity with Example | Algorithm 8:16 2020-01-21
22 L-3.3: How Merge Sort Works?? Full explanation with example 9:52 2022-07-28
23 L -3.4: Merge Sort Pseudocode | Merge Sort with example 8:09 2022-07-29
24 L-3.5: Imp. Question on Merge Sort | Divide and Conquer | Algorithm 6:00 2019-01-07
25 L-3.6: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example | Algorithm 8:34 2020-01-22
26 L-3.7: Insertion Sort | Time Complexity Analysis | Stable Sort | Inplace Sorting 15:32 2020-08-05
27 L-3.8: Selection Sort | Time Complexity(Best, Avg & Worst) Analysis | Stable or Not | Inplace or Not 11:37 2020-08-06
28 L-3.9: Radix Sort | Easiest explanation with example 6:05 2022-03-29
29 L-3.10: Counting Sort | Easiest explanation with example 7:37 2022-04-01
30 L-3.11: Bucket Sort | Easiest explanation with examples | Time Complexity analysis with Pseudocode 10:21 2022-04-02
31 L-3.12: Introduction to Trees (Binary Tree, Almost Complete Binary Tree, Full BT, Complete BT, BST) 10:45 2020-08-22
32 L-3.13: Introduction to Heap Tree with examples | Max Min Heap 7:45 2021-03-04
33 L-3.14: Insertion in Heap Tree | Max-Heap & Min-Heap Creation | Time Complexities 11:33 2021-03-09
34 L-3.15: Imp Question on Max Heap | GATE Question on Max/Min Heap | Algorithm 10:19 2019-01-27
35 L-3.16: Build Heap in O(n) time complexity | Heapify Method | Full Derivation with example 21:05 2021-03-10
36 L-3.17: Deletion in Heap tree | Time complexity 6:15 2021-03-12
37 L-3.18: Heap sort with Example | Heapify Method 13:38 2021-03-13
38 L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques 7:32 2020-01-28
39 L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm 11:41 2020-01-23
40 L-4.3: Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm) 12:30 2020-01-28
41 L-4.4: Huffman Coding Question in Greedy Technique | Imp Question for all competitive exams 7:50 2019-01-03
42 L-4.5: Job Sequencing Algorithm with Example | Greedy Techniques 10:39 2020-01-24
43 L-4.6: Optimal Merge Pattern using Greedy Method in Hindi | Algorithm 10:51 2020-01-31
44 L-4.7: What is Spanning Tree with Examples in Hindi | Algorithm 7:12 2020-01-29
45 L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm 11:17 2020-02-01
46 L-4.9: Prim's Algorithm for Minimum Cost Spanning Tree | Prims vs Kruskal 9:55 2021-04-01
47 L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method 15:49 2021-03-29
48 L-4.11: Dijkstra's Algorithm Analysis | Time Complexity | Pseudocode Explanation 11:23 2021-03-30
49 L-4.12: Why does Dijkstra fail on Negative Weights?? Full Explanation with examples 7:54 2021-03-31
50 L-4.13: Bellman Ford Algorithm | Dijkstra's Vs Bellman Ford | Single Source Shortest Path 16:32 2021-04-02
51 L-4.14: Bellman Ford pseudo code and Time complexity | Single Source Shortest Path 7:50 2021-04-03
52 L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA 11:16 2022-09-15
53 L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA) 9:08 2020-02-04
54 L-5.2: 0/1 Knapsack failed using Greedy approach 9:54 2020-02-23
55 L-5.3: 0/1 Knapsack Problem |Dynamic Programming |Recursive Equation |Recursion Tree Time Complexity 17:04 2021-04-04
56 L-5.4: Traveling Salesman Problem | Dynamic Programming 14:12 2021-04-05
57 L-5.5: Sum of Subsets Problem | Dynamic Programming 15:06 2021-04-08
58 L-5.6: Multistage Graph | Dynamic Programming 17:32 2021-04-10
59 L-5.7: Introduction to All Pair Shortest Path (Floyd Warshall Algorithm) 6:24 2021-05-20
60 L-5.8: Floyd Warshall Working with example | All Pair Shortest Path Algorithm 25:31 2021-05-26
61 L-5.9: Floyd Warshall Time & Space complexity | All Pair Shortest Path 9:14 2021-05-27
62 L-6.1: What is hashing with example | Hashing in data structure 5:53 2021-01-16
63 L-6.2: Collision Resolution Techniques in Hashing | What are the collision resolution techniques? 5:33 2021-01-17
64 L-6.3: Chaining in Hashing | What is chaining in hashing with examples 6:42 2021-01-19
65 L-6.4: Linear Probing in Hashing with example 12:40 2021-01-20
66 L-6.5: Imp Question on Hashing | Linear Probing for Collision in Hash Table | GATE Questions 9:29 2019-01-28
67 L-6.6: Quadratic Probing in Hashing with example 7:41 2021-01-20
68 L-6.7: Double Hashing | Collision Resolution Technique 10:28 2021-01-21
69 L- 6.8:Topological Sorting with examples | Topological Sorting using DFS 11:33 2022-09-12
70 L-6.9:Kahn's Algorithm | Topological Sorting | DAA | Imp for Placements 7:31 2022-09-14
71 Lec-41: Branch & Bound Algorithm with Example | Easiest Explanation of B&B with example 13:13 2022-11-26
72 Lec-42 : 0/1 Knapsack using Branch and Bound with example 11:20 2022-11-27
73 Shortcut for Swaps🔁 in Bubble🫧 Sorting📶| Best Case | Worst Case 3:06 2023-06-01
74 Optimized Bubble Sort | Best Case | O(n) Time Complexity | Sorting Algorithms |DAA 8:32 2023-06-02
75 Recurrence Relation [T(n) = 2T(n/2) + 2] | Min-Max Algorithm 10:05 2023-06-28
76 Min-Max Algorithm without Divide & Conquer🏆 | Linear Approach | Find Max & Min 6:46 2023-06-29
77 Min Max Algorithm with Divide & Conquer🏆 8:37 2023-07-01
78 Time complexity and Comparison of All Data Structures 8:13 2021-01-14
79 Bubble Sort Pseudocode | Performance & Time Complexity 7:34 2026-05-02
For your README

Embed a badge

Show the watch time in a README or course description — it links back here and updates itself

Watch time: 13h 1m · 79 videos

Markdown
[![Watch time: 13h 1m · 79 videos](https://playlistduration.com/badge/playlist/PLxCzCOWd7aiHcmS4i14bI0VrMbZTUvlTa.svg)](https://playlistduration.com/playlist/PLxCzCOWd7aiHcmS4i14bI0VrMbZTUvlTa)
HTML
<a href="https://playlistduration.com/playlist/PLxCzCOWd7aiHcmS4i14bI0VrMbZTUvlTa"><img src="https://playlistduration.com/badge/playlist/PLxCzCOWd7aiHcmS4i14bI0VrMbZTUvlTa.svg" alt="Watch time: 13h 1m · 79 videos" width="203" height="20"></a>

Add ?speed=1.5 to the image URL for the time at that speed, ?label=Course to change the left text, or ?style=flat-square for square corners.

Want the numbers themselves? GET https://playlistduration.com/api/v1/playlist/PLxCzCOWd7aiHcmS4i14bI0VrMbZTUvlTa returns them as JSON — free, no key. API docs →

Data from the YouTube Data API as of 2026-10-22 (cached). Private or deleted videos are excluded from totals.