Computer Engineering 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.

Computer Engineering

Analysis of Algorithms

Asymptotic analysis and the master method, divide and conquer, greedy, dynamic programming, backtracking and branch and bound, string matching.

Interview questions
Notes for 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 Analysis of Algorithms

  1. Asymptotic notation: Big-O, Omega and Theta· notes coming
  2. Growth of functions· notes coming
  3. The master method· notes coming
  4. Analysis of selection and insertion sort· notes coming
  5. Divide and conquer· notes coming
  6. Merge sort· notes coming
  7. Quick sort· notes coming
  8. Analysis of binary search· notes coming
  9. The greedy method· notes coming
  10. Dijkstra's single-source shortest paths· notes coming
  11. Fractional knapsack· notes coming
  12. Kruskal's and Prim's minimum spanning trees· notes coming
  13. Dynamic programming· notes coming
  14. Multistage graphs· notes coming
  15. Floyd-Warshall all-pairs shortest paths· notes coming
  16. 0/1 knapsack· notes coming
  17. Travelling salesperson by dynamic programming· notes coming
  18. Longest common subsequence· notes coming
  19. Backtracking· notes coming
  20. N-queens problem· notes coming
  21. Sum of subsets· notes coming
  22. Graph colouring by backtracking· notes coming
  23. Branch and bound· notes coming
  24. 15-puzzle and TSP by branch and bound· notes coming
  25. Naive string matching· notes coming
  26. Rabin-Karp algorithm· notes coming
  27. Knuth-Morris-Pratt algorithm· notes coming
  28. Recurrences: substitution, iteration and recursion tree· notes coming
  29. Heap sort· notes coming
  30. Strassen's matrix multiplication· notes coming
  31. Hamiltonian cycles by backtracking· notes coming
  32. Optimal merge patterns and Huffman coding· notes coming
  33. Activity selection and job sequencing· notes coming
  34. Matrix chain multiplication· notes coming
  35. Bellman-Ford algorithm· notes coming
  36. P, NP and NP-complete problems· notes coming
  37. Optimal binary search trees· notes coming
  38. Tournament method for the largest and second-largest element· notes coming
  39. Polynomial evaluation: Horner's rule and preprocessing of coefficients· notes coming
  40. Randomised algorithms: Las Vegas and Monte Carlo· notes coming
  41. Randomised quick sort and its analysis· notes coming
  42. Karger's min-cut algorithm· notes coming
  43. Amortised analysis· notes coming
  44. NP-completeness reductions: vertex cover, 3-CNF SAT, clique and Hamiltonian cycle· notes coming
  45. Approximation algorithms: vertex cover and TSP· notes coming
  46. Finding maximum and minimum by divide and conquer· notes coming
  47. Connected components with BFS and DFS· notes coming
  48. Convex hull and large-integer multiplication by divide and conquer· notes coming
  49. Optimal storage on tapes· notes coming
  50. Reliability design· notes coming
  51. Flow shop scheduling: Johnson's rule· notes coming
  52. 0/1 knapsack by LC and FIFO branch and bound· notes coming
  53. Non-deterministic algorithms and Cook's theorem· notes coming
  54. Biconnected components and articulation points· notes coming