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.

Interview questions
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

  1. What makes a good algorithm· notes coming
  2. Space and time complexity· notes coming
  3. Asymptotic notations: big-O, omega and theta· notes coming
  4. Best, worst and average-case analysis· notes coming
  5. Analysing non-recursive algorithms· notes coming
  6. Recurrences: substitution and recursion-tree methods· notes coming
  7. Divide and conquer and the master theorem· notes coming
  8. Merge sort and quick sort analysis· notes coming
  9. Strassen's matrix multiplication· notes coming
  10. Greedy method: fractional knapsack and Huffman coding· notes coming
  11. Minimum spanning trees: Prim's and Kruskal's· notes coming
  12. Dynamic programming: 0/1 knapsack and LCS· notes coming
  13. Matrix chain multiplication and optimal BSTs· notes coming
  14. Shortest paths: Bellman-Ford and Floyd-Warshall· notes coming
  15. BFS, DFS and topological sorting· notes coming
  16. Dijkstra's algorithm with priority queues· notes coming
  17. Backtracking and state-space trees· notes coming
  18. N-queens and sum of subsets· notes coming
  19. Graph colouring and Hamiltonian cycles· notes coming
  20. Branch and bound: FIFO and least-cost search· notes coming
  21. Travelling salesperson by branch and bound· notes coming
  22. P, NP and NP-complete problems· notes coming
  23. Approximation algorithms· notes coming
  24. Solving recurrences by the characteristic equation· notes coming
  25. Amortised analysis· notes coming
  26. Job sequencing with deadlines· notes coming
  27. Multistage graphs· notes coming
  28. Travelling salesperson by dynamic programming· notes coming
  29. Cook's theorem and polynomial-time reduction· notes coming
  30. Optimal merge patterns· notes coming
  31. Non-deterministic algorithms and NP-hard graph problems· notes coming
  32. Convex hull and large-integer multiplication by divide and conquer· notes coming
  33. Optimal storage on tapes· notes coming