hi,
In which part of the course are the topics Balanced Binary Search (AVL) Trees and Suffix Trees covered?
I see some exercices about them in the old exams, but I cannot find them in the slides.
Thank you!
Som svar till Giovanni Castellano
Sv: Balanced Binary Search (AVL) Trees and Suffix Tree
av Marc Hellmuth -
AVL trees and suffix trees are not part of this course anymore, so this will not be part of the exam.
The topics that are covered and part of the exam are at the homepage and listed here again:
Part1 Turing Machines
Part2 NP-completeness
Part 3 Shortest Path
Part 4 Dynamic Prg
Part 5 Greedy and Matroids
Part 6 Approximation Alg
Part 7 Fixed parameter Alg
Part 8 Maximum Flow
hope this helps!
The topics that are covered and part of the exam are at the homepage and listed here again:
Part1 Turing Machines
Part2 NP-completeness
Part 3 Shortest Path
Part 4 Dynamic Prg
Part 5 Greedy and Matroids
Part 6 Approximation Alg
Part 7 Fixed parameter Alg
Part 8 Maximum Flow
hope this helps!