Data Structures 67109

Exercises:

Ex1 - Asymptotic analysis

Ex1 solution

Ex2 - Little-O and recurrence [example for 3.b]

Ex2 solution

Ex3 - Linear time sorting and Randomized algorithms[a hint for question 3]

Ex3 solution

Ex4 - Sorting and trees

Ex4 solution and updated solution

Ex5 - Heaps and induction

Ex5 solution and updated solution

Ex6 - More Heaps

Ex6 solution and updated solution

Ex7 - Binary Search Trees

Ex7 - solution and updated solution

Ex8 - AVL Trees and graphs [Q3 clarifications]

Ex8 - solution and updated solution

Ex9 - Graphs

Ex9 - solution and updated solution

Ex10 - (more) Graphs

Ex10 - solution and updated solution

Ex11 - Hash tables [universal hashing]

Ex11 - solution and updated solution

Ex12 - Kruskal & union-find

Ex12 - solution and updated solution