COURSE OUTCOMES
Upon completion of this course, the students will be able to
CO 1: implement basic linear data structures using static and dynamic memory allocation. (K3)
CO 2: recognize the data organization and applications of binary trees and binary search trees. (K3)
CO 3: analyze the importance of self-balancing trees for effective organization of data. (K4)
CO 4: design and implement an appropriate hashing function and heap for an application. (K3)
CO 5: identify suitable algorithms for solving the real life problems shortest path,
network link analysis. (K4)
- Teacher: MANOCHITRA M