Artificial Intelligence & Data Science is coming soon
We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.
Artificial Intelligence & Data Science
Design and Analysis of Algorithms
Introduction; analysis framework, divide and conquer and greedy techniques; dynamic programming, graph algorithms and advanced search techniques.
Notes for Design and Analysis of Algorithms are being written and reviewed. Until they're up, Aria teaches every topic — ask for any part of the syllabus, with worked numericals.
Coming next in Design and Analysis of Algorithms
- What makes a good algorithm· notes coming
- Space and time complexity· notes coming
- Asymptotic notations: big-O, omega and theta· notes coming
- Best, worst and average-case analysis· notes coming
- Analysing non-recursive algorithms· notes coming
- Recurrences: substitution and recursion-tree methods· notes coming
- Divide and conquer and the master theorem· notes coming
- Merge sort and quick sort analysis· notes coming
- Strassen's matrix multiplication· notes coming
- Greedy method: fractional knapsack and Huffman coding· notes coming
- Minimum spanning trees: Prim's and Kruskal's· notes coming
- Dynamic programming: 0/1 knapsack and LCS· notes coming
- Matrix chain multiplication and optimal BSTs· notes coming
- Shortest paths: Bellman-Ford and Floyd-Warshall· notes coming
- BFS, DFS and topological sorting· notes coming
- Dijkstra's algorithm with priority queues· notes coming
- Backtracking and state-space trees· notes coming
- N-queens and sum of subsets· notes coming
- Graph colouring and Hamiltonian cycles· notes coming
- Branch and bound: FIFO and least-cost search· notes coming
- Travelling salesperson by branch and bound· notes coming
- P, NP and NP-complete problems· notes coming
- Approximation algorithms· notes coming
- Solving recurrences by the characteristic equation· notes coming
- Amortised analysis· notes coming
- Job sequencing with deadlines· notes coming
- Multistage graphs· notes coming
- Travelling salesperson by dynamic programming· notes coming
- Cook's theorem and polynomial-time reduction· notes coming
- Optimal merge patterns· notes coming
- Non-deterministic algorithms and NP-hard graph problems· notes coming
- Convex hull and large-integer multiplication by divide and conquer· notes coming
- Optimal storage on tapes· notes coming