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.
Jan 07, 2026
01 Intro To Algorithms
Jan 07, 2026
02 Star Search
Jan 07, 2026
03 Max Subarray Sum
Jan 07, 2026
04 Searching and Sorting
Jan 07, 2026
05 Sorting, Data Structures
Jan 07, 2026
06 Abstract Data Types, Binary AVL Search Trees
Jan 07, 2026
07 Dynamic Programming, Jump Game, Longest Common Subsequence, Edit Distance
Jan 07, 2026
08 Subset Sum, Knapsack, Longest Increasing Subsequence
Jan 07, 2026
09 Graph Theory, Eulerian Cycle Algorithm
Jan 07, 2026
10 Topological Ordering, Directed Graphs, Representing Graphs on Computers, Topological Sort Algorithm
Jan 07, 2026
11 Shortest Path Algorithms, Cheapest Walks in Weighted Graphs, Acyclical Graphs and Topological Sort, Dijkstra's Algorithm
Jan 07, 2026
12 Cheapest Path Problem, Negative Cost, Bellman-Ford, Minimum Spanning Trees, Boruvka's Algorithm, Prim's Algorithm, Priority Queues
Jan 07, 2026
13 Kruskal's Algorithm, Union Find, Self-Adapting Data Structures and Amortized Analysis
Jan 07, 2026
14 All Source Shortest Paths, Floyd-Warshall, Johnson's Algorithm, Matrices and Graphs, Connected Components in Digraphs, Efficient Matrix Operations
Jan 07, 2026
15 Quick Select and Finding the Median