Open App

Index

Searching & Sorting

Hashing

Asymptotic Analysis of Algorithms

Recurrence Relations

Divide & Conquer

Greedy Techniques

Graph Based Algorithms

Dynamic Programming

All Exams > Computer Science Engineering (CSE) > Algorithms > All Videos

All videos of Algorithms for Computer Science Engineering (CSE) Exam

Searching & Sorting

Binary Search Recursive Method

07:11 min

Heap - Heap Sort - Heapify - Priority Queues

51:08 min

Two Way MergeSort - Iterative method

20:19 min

Merge Sort Algorithm

24:07 min

MergeSort in-depth Analysis

13:28 min

QuickSort Algorithm

13:43 min

QuickSort Analysis

11:37 min

Searching in an Array

09:10 min

Sorting - Concluding Remarks

08:08 min

Selection Sort

12:12 min

Insertion Sort

13:52 min

Binary Search Iterative Method

19:36 min

Join for Free

Hashing

Introduction: Hashing

06:55 min

Separate Chaining

07:49 min

Open Addressing

11:29 min

Rabin-Karp Algorithm

11:32 min

Count Pairs with Given Sum

04:28 min

Convert An Array to Reduced Form

04:16 min

Advantages of BST over Hash Table

01:59 min

Print a Binary Tree in Vertical Order

05:05 min

Asymptotic Analysis of Algorithms

Characteristics of Algorithm

05:37 min

How Write and Analyze Algorithm

10:37 min

Frequency Count Method

12:22 min

Time Complexity - 1

10:08 min

Time Complexity Example - 2

14:13 min

Time Complexity of While and if - 3

21:54 min

Classes of functions

03:10 min

Compare Class of Functions

05:11 min

Asymptotic Notations Big Oh - Omega - Theta 1

15:46 min

Asymptotic Notations - Big Oh - Omega - Theta 2

10:07 min

Properties of Asymptotic Notations

11:58 min

Comparison of Functions - 1

09:28 min

Comparison of Functions - 2

10:26 min

Best Worst and Average Case Analysis

18:56 min

81 videos|113 docs|34 tests

Join course for free

Join course for free

Recurrence Relations

Recurrence Relation (T(n)= T(n-1) + 1)

13:48 min

Recurrence Relation (T(n)= T(n-1) + n)

16:00 min

Recurrence Relation (T(n)= T(n-1) + log n)

12:25 min

Recurrence Relation T(n)=2 T(n-1)+1

10:42 min

Masters Theorem Decreasing Function

08:10 min

Recurrence Relation Dividing Function T(n)=T(n/2)+1

08:41 min

Recurrence Relation Dividing Function T(n)=T(n/2)+1

08:41 min

Recurrence Relation [ T(n)= 2T(n/2) +n]

11:20 min

Masters Theorem in Algorithms for Dividing Function

16:50 min

Examples for Master Theorem

05:41 min

Root function (Recurrence Relation)

05:37 min

Divide & Conquer

Divide And Conquer

07:04 min

Greedy Techniques

Knapsack Problem - Greedy Method

15:30 min

Optimal Merge Pattern - Greedy Method

09:33 min

Prims and Kruskals Algorithms - Greedy Method

20:12 min

Greedy Method - Introduction

12:02 min

Job Sequencing with Deadlines - Greedy Method

13:29 min

Huffman Coding - Greedy Method

17:44 min

Dijkstra Algorithm - Single Source Shortest Path - Greedy Method

18:35 min

Graph Based Algorithms

Representing Graphs

13:47 min

Introduction to Graphs

12:03 min

Depth first search (DFS)

12:44 min

Breadth first search (BFS)

20:39 min

Applications of BFS and DFS

22:25 min

Directed acylic graphs: topological sort

20:26 min

Directed acylic graphs: longest paths

14:01 min

Dijkstras algorithm: analysis

14:22 min

Negative edge weights: Bellman-Ford algorithm

16:42 min

All pairs shortest paths

19:36 min

Minimum Cost Spanning Trees

11:59 min

Prims Algorithm

21:11 min

Kruskals algorithm

14:38 min

Dynamic Programming

Principle of Optimality - Dynamic Programming Introduction

14:52 min

MultiStage Graph - Dynamic Programming

21:07 min

MultiStage Graph (Program) - Dynamic Programming

14:26 min

All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming

14:13 min

Matrix Chain Multiplication - Dynamic Programming

23:00 min

Matrix Chain Multiplication using Dynamic Programming Formula

52:02 min

Matrix Chain Multiplication (Program) - Dynamic Programming

18:40 min

Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming

17:12 min

0/1 Knapsack - Two Methods - Dynamic Programming

28:24 min

0/1 Knapsack Problem (Program) - Dynamic Programming

17:00 min

Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming

30:19 min

Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming

57:00 min

Traveling Salesman Problem - Dynamic Programming using Formula

17:18 min

Reliability Design - Dynamic Programming

26:32 min

Reliability Design - Dynamic Programming

26:32 min

Algorithms

81 videos|113 docs|34 tests

Top Courses Computer Science Engineering (CSE)

Explore Courses

Video lectures for Algorithms 2025 is part of Computer Science Engineering (CSE) exam preparation. The videos have been prepared according to the Computer Science Engineering (CSE) exam syllabus. The Video lectures, notes, tests & MCQs are made for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests here.

Video lectures of Algorithms in English & Hindi are available as part of Computer Science Engineering (CSE) exam. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

© EduRev

Education Revolution

Signup on EduRev and stay on top of your study goals

Signup with Google

10M+ students crushing their study goals daily