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.
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
- Asymptotic notation: Big-O, Omega and Theta· notes coming
- Growth of functions· notes coming
- The master method· notes coming
- Analysis of selection and insertion sort· notes coming
- Divide and conquer· notes coming
- Merge sort· notes coming
- Quick sort· notes coming
- Analysis of binary search· notes coming
- The greedy method· notes coming
- Dijkstra's single-source shortest paths· notes coming
- Fractional knapsack· notes coming
- Kruskal's and Prim's minimum spanning trees· notes coming
- Dynamic programming· notes coming
- Multistage graphs· notes coming
- Floyd-Warshall all-pairs shortest paths· notes coming
- 0/1 knapsack· notes coming
- Travelling salesperson by dynamic programming· notes coming
- Longest common subsequence· notes coming
- Backtracking· notes coming
- N-queens problem· notes coming
- Sum of subsets· notes coming
- Graph colouring by backtracking· notes coming
- Branch and bound· notes coming
- 15-puzzle and TSP by branch and bound· notes coming
- Naive string matching· notes coming
- Rabin-Karp algorithm· notes coming
- Knuth-Morris-Pratt algorithm· notes coming
- Recurrences: substitution, iteration and recursion tree· notes coming
- Heap sort· notes coming
- Strassen's matrix multiplication· notes coming
- Hamiltonian cycles by backtracking· notes coming
- Optimal merge patterns and Huffman coding· notes coming
- Activity selection and job sequencing· notes coming
- Matrix chain multiplication· notes coming
- Bellman-Ford algorithm· notes coming
- P, NP and NP-complete problems· notes coming
- Optimal binary search trees· notes coming
- Tournament method for the largest and second-largest element· notes coming
- Polynomial evaluation: Horner's rule and preprocessing of coefficients· notes coming
- Randomised algorithms: Las Vegas and Monte Carlo· notes coming
- Randomised quick sort and its analysis· notes coming
- Karger's min-cut algorithm· notes coming
- Amortised analysis· notes coming
- NP-completeness reductions: vertex cover, 3-CNF SAT, clique and Hamiltonian cycle· notes coming
- Approximation algorithms: vertex cover and TSP· notes coming
- Finding maximum and minimum by divide and conquer· notes coming
- Connected components with BFS and DFS· notes coming
- Convex hull and large-integer multiplication by divide and conquer· notes coming
- Optimal storage on tapes· notes coming
- Reliability design· notes coming
- Flow shop scheduling: Johnson's rule· notes coming
- 0/1 knapsack by LC and FIFO branch and bound· notes coming
- Non-deterministic algorithms and Cook's theorem· notes coming
- Biconnected components and articulation points· notes coming