Advanced Data Structures

Upon completion of this course, the student will be able to
CO1: apply hashing techniques to efficiently store and retrieve data in dictionaries.
CO2: implement heap data structures and skip lists for optimization problems.
CO3: implement algorithms for red-black trees, B-trees and Splay trees.
CO4: implement ontology-based graphs to solve different real-time problems.
CO5: apply suitable data structures for computational geometry problems