Upon completion of this course, the student will be able to
CO1: Implement applications based on the concept of heap, skip list and hashing Techniques. (K3)
CO2: Develop programs for red-black trees, B-trees, AVL and Binary Search trees. (K3)
- Teacher: MALINI S L AP-CSE