8-12 marks3 formulas
Algorithms
Master theorem
T(n)=aT(n/b)+f(n)Dijkstra
O((V+E) log V)Quick revision sheetOpen sheet
Select a subject to revise formulas.
T(n)=aT(n/b)+f(n)O((V+E) log V)floor(log2 n)h(k,i)=(h(k)+i) mod mX -> Y implies X is a superkeyAcyclic precedence graphcompletion - arrivalhit*time + miss*penalty2^h - 2packet size / bandwidth2^n subset constructionmultiple parse treesP(A|B)=P(B|A)P(A)/P(B)det(A-lambda I)=0change/original x 100work = rate x time