Course Summary
#dsa #algorithms #course #study
Summary
Section titled “Summary”Course Started : 19/03/202 Link
Studying algorithms dates back to 300BC Euclid, it was formalised by Church and Turing in the 1930’s (at Princeton) with its impacts going beyond computer science being applied in a multitude of fields.
- Algorithms are methods for solving a problem
- Data Structures are methods for storing information
- Computational models are replacing math models in scientific inquiry.
” Bad programmers worry about the code. Good programmers worry about data structures and their relationships. ” - Linus Torvalds (creator of Linux)
Course Guide
Section titled “Course Guide”The course is broken up into two parts.
| Topic | DSA | Part |
|---|---|---|
| Data Types | Stack, Queue, Bag, Unionfind, Priority queue | Part 1 |
| Sorting | Quicksort, Mergesort, Heapsort | |
| Searching | BST, Red Black BST, Hash Table | |
| Graphs | BFS, DFS, Prim, Kruskal, Djikstra | Part 2 |
| Strings | Radix, Sorts, Tries, KMP, Regexps, Data Compression | |
| Advanced | B-Tree, Suffx, Array, Maxflow |