IRG60303 - ALGORITHM COMPLEXITY ANALYSIS
IRG60303 ALGORITHM COMPLEXITY ANALYSIS
WEEK 3 - B TREE
WEEK 4 - REMAINING TOPICS (Presentation & Test)
IRG60303 - ALGORITHM COMPLEXITY ANALYSIS
This
course is related to the study of computational complexity of algorithms and
data structures in computer science. Topics covered include the roles of
algorithms in computing, functions’ growth, divide-and-conquer, probabilistic
analysis and randomised algorithms, sorting algorithms, advanced data
structures, dynamic programming, greedy algorithms, amortized analysis, graph
algorithms, linear programming, approximation algorithms, primal-dual
algorithms, semi-definite programming and streaming algorithms.