CS Notes
Search
Search
Dark mode
Light mode
Explorer
Home
❯
01 Semesters (BSc)
❯
Semester 1
❯
Algorithms and Data Structures
❯
Lecture Notes
Folder: 01-Semesters-(BSc)/Semester-1/Algorithms-and-Datastructures/Lecture-Notes
15 items under this folder.
Dec 15, 2025
01 Intro To Algorithms
Dec 15, 2025
02 Star Search
Dec 15, 2025
03 Max Subarray Sum
Dec 15, 2025
04 Searching and Sorting
Dec 15, 2025
05 Sorting, Data Structures
Dec 15, 2025
06 Abstract Data Types, Binary AVL Search Trees
Dec 15, 2025
07 Dynamic Programming, Jump Game, Longest Common Subsequence, Edit Distance
Dec 15, 2025
08 Subset Sum, Knapsack, Longest Increasing Subsequence
Dec 15, 2025
09 Graph Theory, Eulerian Cycle Algorithm
Dec 15, 2025
10 Topological Ordering, Directed Graphs, Representing Graphs on Computers, Topological Sort Algorithm
Dec 15, 2025
11 Shortest Path Algorithms, Cheapest Walks in Weighted Graphs, Acyclical Graphs and Topological Sort, Dijkstra's Algorithm
Dec 15, 2025
12 Cheapest Path Problem, Negative Cost, Bellman-Ford, Minimum Spanning Trees, Boruvka's Algorithm, Prim's Algorithm, Priority Queues
Dec 15, 2025
13 Kruskal's Algorithm, Union Find, Self-Adapting Data Structures and Amortized Analysis
Dec 15, 2025
14 All Source Shortest Paths, Floyd-Warshall, Johnson's Algorithm, Matrices and Graphs, Connected Components in Digraphs, Efficient Matrix Operations
Dec 15, 2025
15 Quick Select and Finding the Median