Upon successful completion of the course, students will be able to: discuss the details of various types of advanced data structures, know how and when to use them, and evaluate their efficiency: implement bubble, selection, insertion, shell, quick, merge and heapsort; implement linear, binary and interpolation search; optimize sorts where possible; compare and contrast different searching and sorting algorithms; implement algorithms to find min and max of binary trees and predecessors and successors of given nodes; identify and define balanced binary trees, self-balancing binary search trees (red-black and AVL), multiway search trees, B trees, B+ trees; describe insertion and traversal algorithms for various self-balancing binary search trees and multiway search trees; differentiate between and understand practical applications of different trees; identify and list practical applications of heaps, hash tables and graphs; perform simple operations on heaps and graphs; represent heaps and graphs in multiple ways; address hash table collisions in multiple ways; and analyze time complexities of all algorithms.