Upon completion of this course, the student will be able to
CO1: Understand the implementation of dictionaries using hashing techniques. (K2)
CO2: Develop applications using heap data structures and skip list. (K3)
CO3: Develop and analyze algorithms for red-black trees, B-trees and Splay trees. (K3)
- Teacher: MALINI S L AP-CSE