Open App

Index

Searching & Sorting

Hashing

Asymptotic Analysis of Algorithms

Recurrence Relations

Divide & Conquer

Greedy Techniques

Graph Based Algorithms

Dynamic Programming

Revision Notes

Previous year Questions-(Algorithm)

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

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

Searching & Sorting

Linear Search & Binary Search- 1

5 pages

Linear Search & Binary Search- 2

11 pages

Linear Search & Binary Search- 3

10 pages

Sorting Algorithms

26 pages

Searching Algorithms

3 pages

Sorting Algorithms- 1

6 pages

Sorting Algorithms- 2

14 pages

Sorting Algorithms- 3

9 pages

Sorting Algorithms- 4

13 pages

Sorting Algorithms- 5

16 pages

Sorting Algorithms- 6

16 pages

Merge Sort

5 pages

Quick Sort

12 pages

Join for Free

Join for Free

Hashing

Hashing

8 pages

Hash Table and STL

4 pages

Extendible Hashing

6 pages

Asymptotic Analysis of Algorithms

Asymptotic Analysis

3 pages

Solving Recurrences

3 pages

Worst, Average & Best Cases

5 pages

Asymptotic Notations

7 pages

Analysis of Loops

8 pages

Different Types of Recurrence Relations & Their Solutions

2 pages

Space Complexity

1 page

Time Complexity

4 pages

Recurrence Relations

Different Types of Recurrence Relations & Their Solutions

2 pages

Solving Recurrences

3 pages

Divide & Conquer

Binary Search

2 pages

Introduction: Divide & Conquer

5 pages

Merge Sort

5 pages

Quick Sort

12 pages

Quick Sort & Merge Sort Comparison

2 pages

Count Inversions in Array

3 pages

Closest Pair of Points

2 pages

Strassen’s Matrix Multiplication

1 page

Divide & Conquer Recurrence Relations

3 pages

K-th Element of Two Sorted Arrays

7 pages

K-th Smallest/Largest element in an Unsorted Array

4 pages

Greedy Techniques

Activity Selection Problem

4 pages

Dijkstra’s Shortest Path Algorithm

7 pages

Job Sequencing Problem

1 page

Huffman Coding

4 pages

Greedy Algorithm to Find Minimum Number of Coins

1 page

Strongly Connected Components

3 pages

Fractional Knapsack

9 pages

Fractional Knapsack

2 pages

Optimal File Merge Patterns

2 pages

Minimum Spanning Tree

10 pages

Graph Based Algorithms

Transitive Closure of a Graph

1 page

Undirected Graph

4 pages

Bridges in a graph

1 page

Graph and its representations

2 pages

Graph Searching

5 pages

Directed Acyclic Graphs (DAG)

5 pages

Topological Sorting

2 pages

Bellman-Ford Algorithm

3 pages

Floyd Warshall Algorithm

1 page

Kosaraju using DFS

2 pages

BFS (Breadth-first search) Algorithm

7 pages

Prim's Algorithm

9 pages

Kruskal's Algorithm

5 pages

Dynamic Programming

Longest Common Subsequence

3 pages

Matrix Chain Multiplication

3 pages

Overlapping Subproblems Property in Dynamic Programming

3 pages

Traveling Salesman Problem

5 pages

Subset Sum Problem

2 pages

Min Cost Path

2 pages

0-1 Knapsack Problem

3 pages

Dynamic Programming

7 pages

Revision Notes

Sorting Algorithms

26 pages

Asymptotic Worst Case Time & Space Complexity

12 pages

Hashing

4 pages

Minimum Spanning Trees

13 pages

Searching Algorithms

3 pages

Greedy Algorithm

33 pages

Dynamic Programming & Divide and Conquer

14 pages

Graph Search Algorithm

14 pages

Shortest Path Algorithm

14 pages

Previous year Questions-(Algorithm)

Previous Year Questions: Asymptotic Notation

26 pages

Previous Year Questions: Recurrence Relation

14 pages

Previous Year Questions: Divide and Conquer

2 pages

Previous Year Questions: Sorting

25 pages

Previous Year Questions: Greedy Technique

12 pages

Previous Year Questions: Minimum Spanning Tree

35 pages

Previous Year Questions: Shortest Path

16 pages

Previous Year Questions: Graph Traversal

19 pages

Previous Year Questions: Dynamic Programming

14 pages

Algorithms

81 videos|80 docs|33 tests

Top Courses Computer Science Engineering (CSE)

Explore Courses

Signup to see your scores go up within 7 days!

Study with 1000+ FREE Docs, Videos & Tests

Continue with Google

10M+ students study on EduRev

Revision notes for Algorithms 2025 is part of Computer Science Engineering (CSE) exam preparation. The notes have been prepared according to the Computer Science Engineering (CSE) exam syllabus. The revision 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.

Notes 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 to see your scores go up within 7 days!

Access 1000+ FREE Docs, Videos and Tests

Continue with Google

Takes less than 10 seconds to signup