Algorithms Computer Science Engineering (CSE) - Notes & Study Material for Computer Science Engineering (CSE)
Get access to free study material for Algorithms of Computer Science Engineering (CSE) for 2026 exams, with Revision Notes, PPTs, Flashcards, Question & Answer, & more.
Searching & Sorting
| Linear Search & Binary Search- 1 5 pages |  |
| Linear Search & Binary Search- 2 11 pages | |
| Linear Search & Binary Search- 3 10 pages | |
| Mind Map: Searching & Sorting 1 page | |
| Formula Sheets: Searching & Sorting 2 pages | |
| Handwritten notes: Searching & Sorting 23 pages | |
| Sorting Algorithms 25 pages | |
| Searching Algorithms 3 pages | |
| Sorting Algorithms- 1 6 pages | |
| Sorting Algorithms- 2 22 pages | |
| Sorting Algorithms- 3 15 pages | |
| Sorting Algorithms- 4 18 pages | |
| Sorting Algorithms- 5 16 pages | |
| Sorting Algorithms- 6 23 pages | |
| Flashcards: Searching & Sorting 48 cards | |
Hashing
| Hash Table and STL 7 pages | |
| Short Notes: Hashing 7 pages | |
| Extendible Hashing 7 pages | |
| Formula Sheets: Hashing 2 pages | |
| Handwritten notes: Hashing 15 pages | |
| Flashcards: Hashing 30 cards | |
Asymptotic Analysis of Algorithms
| Asymptotic Analysis 3 pages | |
| Short Notes: Space and Time Complexity 6 pages | |
| Solving Recurrences 3 pages | |
| Mind Map: Asymptotic Analysis of Algorithms 1 page | |
| Flashcards: Asymptotic Analysis of Algorithms 20 cards | |
| Formula Sheets: Asymptotic Analysis of Algorithms 2 pages | |
| Handwritten notes: Asymptotic Analysis of Algorithms 27 pages | |
| Worst, Average & Best Cases 5 pages | |
| Asymptotic Notations 6 pages | |
| Analysis of Loops 8 pages | |
| Different Types of Recurrence Relations & Their Solutions 2 pages | |
Recurrence Relations
| Different Types of Recurrence Relations & Their Solutions 2 pages | |
| Solving Recurrences 3 pages | |
| Formula Sheets: Recurrence Relations 1 page | |
| Handwritten notes: Recurrence Relations 26 pages | |
| PPT: Recurrence Relations 16 pages | |
| Mind Map: Recurrence Relations 1 page | |
| Flashcards: Recurrence Relations 20 cards | |
Divide & Conquer
| Short Notes: Algorithms-Divide & Conquer 6 pages | |
| Introduction: Divide & Conquer 6 pages | |
| K-th Element of Two Sorted Arrays 7 pages | |
| K-th Smallest/Largest element in an Unsorted Array 4 pages | |
| Formula Sheets: Divide & Conquer 2 pages | |
| PPT: Divide & Conquer 13 pages | |
| Mind Map: Divide & Conquer 1 page | |
| Flashcards: Divide & Conquer 20 cards | |
| 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 | |
Greedy Techniques
| Activity Selection Problem 4 pages | |
| Short Notes: Shortest Paths 5 pages | |
| Short Notes: Greedy Algorithms (Part-2) 7 pages | |
| Short Notes: Greedy Algorithms (Part-1) 4 pages | |
| Mind Map: Greedy Techniques 1 page | |
| Flashcards: Greedy Techniques 50 cards | |
| Formula Sheets: Greedy Techniques 2 pages | |
| Handwritten notes: Greedy Techniques 31 pages | |
| PPT: Greedy Techniques 14 pages | |
| Dijkstra’s Shortest Path Algorithm 7 pages | |
| Job Sequencing Problem 1 page | |
| 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 | |
| Bridges in a graph 1 page | |
| Graph and its representations 2 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 | |
| Kruskal's Algorithm 5 pages | |
| Formula Sheets: Graph Based Algorithms 2 pages | |
| Handwritten notes: Graph Based Algorithms 60 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 | |
| Formula Sheets: Dynamic Programming 2 pages | |
| Handwritten notes: Dynamic Programming 104 pages | |
| PPT: Dynamic Programming 16 pages | |
| Mind Map: Dynamic Programming 1 page | |
| Flashcards: Dynamic Programming 34 cards | |
| 0-1 Knapsack Problem 3 pages | |
| Dynamic Programming 7 pages | |
Revision Notes
| Sorting Algorithms 25 pages | |
| Asymptotic Worst Case Time & Space Complexity 7 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 10 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 | |
Quick Revision
| Cheatsheet: Algorithms 7 pages | |
| Full Syllabus Mind Maps: Algorithms 1 page | |
