ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

622,290 results

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,203,163 views

6 years ago

People also watched

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

New DSA Sheet : https://bit.ly/dsa-sheet-apnacollege Share your DSA progress on LinkedIn : https://bit.ly/Ln-ac { #50Day DSA ...

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

903,015 views

1 year ago

CS Dojo
Introduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7)

Big O notation and time complexity, explained. Check out Brilliant.org (https://brilliant.org/CSDojo/), a website for learning math ...

36:22
Introduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7)

2,221,205 views

7 years ago

HackerRank
Big O Notation

Learn about Big O notation, an equation that describes how the run time scales with respect to some input variables. This video is ...

8:37
Big O Notation

1,752,020 views

9 years ago

Gate Smashers
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example

In this video, Varun sir will explain First Come First Serve (FCFS) which is an operating system scheduling algorithm that ...

10:34
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example

3,881,986 views

7 years ago

Himanshu Kaushik | DigiiMento GATE, NET, CSE Prep
How to Find Time Complexity of an Algorithm Complete Concept Compilation in Hindi

These videos are helpful for the following Examinations - GATE Computer Science, GATE Electronics and Communication, NTA ...

6:20:42
How to Find Time Complexity of an Algorithm Complete Concept Compilation in Hindi

68,509 views

7 years ago

Gate Smashers
Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure

Subscribe to our new channel:https://www.youtube.com/@varunainashots 0:00 - Introduction 0:50 -When Binary Search tree is ...

10:46
Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure

1,614,196 views

6 years ago

Abdul Bari
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1

Asymptotic Notations #1 Big - Oh Omega Theta PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on Udemy ...

15:46
1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1

2,391,180 views

8 years ago

Prof. Ravindrababu Ravula
Algorithms | Time and Space Analysis | Introduction to asymptotic notations | Ravindrababu Ravula

For Course Registration Visit: https://ravindrababuravula.in/ . For Any Queries, You can contact RBR on LinkedIn: ...

22:27
Algorithms | Time and Space Analysis | Introduction to asymptotic notations | Ravindrababu Ravula

2,110,014 views

11 years ago

Gate Smashers
L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm

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

9:31
L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm

775,919 views

4 years ago

Gaurav Sen
What is Time Complexity Analysis? - Basics of Algorithms ⌛

Time Complexity Analysis is a basic function that every computer science student should know about. This fundamental concept is ...

9:57
What is Time Complexity Analysis? - Basics of Algorithms ⌛

167,405 views

8 years ago

Gate Smashers
Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

Subscribe to our new channel:https://www.youtube.com/@varunainashots ▻Artificial Intelligence (Complete Playlist): ...

14:34
Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

2,580,679 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,639,744 views

6 years ago

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,147,273 views

6 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,190,391 views

7 years ago

Gate Smashers
L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

n this video, Varun sir will explain Dijkstra's Algorithm step-by-step to help you understand how it finds the shortest path from a ...

15:49
L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

3,455,047 views

4 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,328,044 views

6 years ago

Gate Smashers
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

In this video, Varun sir will explain how Quick Sort actually works using simple examples you can easily follow. You'll understand ...

13:27
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

3,381,773 views

6 years ago