ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

621,378 results

Related queries

daa aktu playlist gateway classes

daa aktu imp questions

gate smashers dsa

gate smashers ai

gate smashers os

gate smashers digital electronics

daa playlist hindi

queue gate smashers

gate smashers coa

gate smashers toc

gate smashers graph

gatehub daa

gate smashers number system

gate smashers dbms

da aktu playlist

daa aktu playlist unit 1

Gate Smashers
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

In this video, Varun sir will simplify the most important concepts in Algorithm Analysis – Big O, Big Omega (Ω), and Theta (Θ) ...

14:25
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

3,021,146 views

5 years ago

People also watched

Apna College
Time & Space Complexity - DSA Series by Shradha Ma'am

New *DSA Sheet* Link: https://dsa.apnacollege.in/ Lecture 12 of DSA Series : Time & Space Complexity in Detail Share your ...

1:25:41
Time & Space Complexity - DSA Series by Shradha Ma'am

790,430 views

1 year ago

Abdul Bari
1.5.1 Time Complexity #1

Finding Time Complexity of Different kind of snippets PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on ...

9:44
1.5.1 Time Complexity #1

2,954,346 views

7 years ago

KnowledgeGATE by Sanchit Sir
Complete DAA Design and Analysis of Algorithm in one shot | Semester Exam | Hindi

KnowledgeGate Website: https://www.knowledgegate.ai For free notes on University exam's subjects, please check out our ...

9:23:20
Complete DAA Design and Analysis of Algorithm in one shot | Semester Exam | Hindi

1,302,910 views

2 years ago

Abdul Bari
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search

Breadth First Search Depth First Search PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

18:31
5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search

4,640,162 views

7 years ago

Shradha Khapra
Quick Sort Algorithm - Lecture 51 of Complete DSA Placement Series

Lecture 51 onwards, DSA Series will now be uploaded on Shradha Khapra channel. This lecture was made with a lot of love❤️ ...

26:23
Quick Sort Algorithm - Lecture 51 of Complete DSA Placement Series

295,752 views

1 year ago

Apna College
Sorting Algorithms | Bubble Sort, Selection Sort & Insertion Sort | DSA Series by Shradha Ma'am

Lecture 24 of DSA Placement Series Company wise DSA Sheet Link : https://docs.google.com/spreadsheets/d ...

34:33
Sorting Algorithms | Bubble Sort, Selection Sort & Insertion Sort | DSA Series by Shradha Ma'am

1,109,952 views

1 year ago

John Bowers
Solved Recurrence Tree Method

An example of solving this recurrence using the substitution or "plug-and-chug" method can be found here: ...

6:30
Solved Recurrence Tree Method

557,203 views

9 years ago

Gate Smashers
L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams

In this video, Varun sir will break down the time complexities of all major searching and sorting algorithms—perfectly tailored for ...

12:52
L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams

1,150,071 views

7 years ago

Abdul Bari
2.8.1  QuickSort Algorithm

Quick Sort Algorithm Explained PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

13:43
2.8.1 QuickSort Algorithm

3,814,451 views

7 years ago

GATE Applied Course
Recursion tree method | Solving Recurrences | Data Structure & Algorithm | Gate Applied Course

gatecse #ds #algorithm #recursiontree #recurrences #appliedgate #gate2022 Subject Name: Data Structures and Algorithms ...

14:15
Recursion tree method | Solving Recurrences | Data Structure & Algorithm | Gate Applied Course

271,074 views

6 years ago

Gate Smashers
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

In this video, Varun sir will break down the basics of what an algorithm is and why it's so important in computer science. You'll also ...

7:51
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

1,567,349 views

5 years ago

Gate Smashers

2.6M subscribers

Gate Smashers
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)

Confused between Greedy Algorithms and Dynamic Programming? In this video, Varun sir will explain the key differences with ...

9:08
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)

1,023,450 views

5 years ago

Gate Smashers
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques

Greedy techniques are one of the most intuitive and powerful problem-solving approaches in algorithms. In this video, Varun sir ...

7:32
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques

1,281,617 views

5 years ago

Gate Smashers
L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them

In this video, Varun sir will explain what a recurrence relation is, how to write one for Binary Search, and most importantly — how ...

7:15
L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them

1,617,692 views

5 years ago

Gate Smashers
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

In this video, Varun sir will solve the recurrence relation T(n)= 8T(n/2) + n^2 in a simplest way possible. This video will give you the ...

6:34
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

1,687,222 views

5 years ago

Gate Smashers
L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm

In the knapsack problem, you need to pack a set of items, with given values and sizes (such as weights or volumes), into a ...

11:41
L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm

1,800,019 views

5 years ago

Gate Smashers
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA

In this session, Varun sir will introduce you to the world of Design and Analysis of Algorithms (DAA) — a crucial subject for GATE, ...

11:27
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA

3,054,674 views

5 years ago