Design and Analysis of Algorithms in Hindi (Gate Smashers)
- Course audio
- Course audio: Hindi
- Level
- Intermediate
- Length
- 15 lessons
What you'll be able to do
- Analyse algorithms with Big O, Omega and Theta
- Solve recurrences with the master theorem
- Apply greedy and dynamic programming techniques
About this course
Gate Smashers' design and analysis of algorithms playlist in Hindi. It opens with the syllabus, what an algorithm is and how to analyse one, and asymptotic notations (Big O, Omega, Theta), then covers time complexity, recurrence relations and the master theorem, sorting algorithms, divide and conquer, greedy methods such as Huffman coding and minimum spanning trees, dynamic programming, shortest paths, and NP-completeness. It suits BS CS students preparing for exams and placements; MIT 6.006 is a deeper English follow-up.
Before you start: Programming and basic data structures
Syllabus
Sabaq lists the first 15 videos of this playlist; the rest continue on YouTube. Full playlist on YouTube
- 1L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA
- 2L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA
- 3L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm
- 4L-1.4: Various Properties of Asymptotic Notation with Example | Algorithm | DAA
- 5L-1.5: Comparison of Various Time Complexities | Different types in Increasing Order| Must Watch
- 6L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams
- 7L-1.7: Question#1 on Comparison of Various Time Complexities | GATE Questions
- 8L-1.8: Question#2 on Comparison of Various Time Complexities | GATE Questions
- 9L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them
- 10L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm
- 11L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm
- 12L-2.4: Recurrence Relation [ T(n)= 2T(n/2) +n] | Substitution Method | Algorithm
- 13L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm
- 14L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm
- 15L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm
What to take next
Related courses
Videos by Gate Smashers, played from their official YouTube channel. Subscribe on YouTube
Official upload by the teacher or institution on their own channel, shown with YouTube's embedded player.
Sabaq lists the first 15 videos of this playlist; the rest continue on YouTube. Full playlist on YouTube
Lessons last checked Oct 2026. Course summary and lesson structure by Sabaq.
Report a problem or a rights request