COURSE OUTCOMES
Upon completion of this course, the students will be able to
CO1: analyze and apply different sorting and searching techniques to solve the problem. (K4)
CO2: implement basic linear data structures using static and dynamic memory allocation.(K3)
CO3: recognize the data organization and applications of binary trees and binary search trees. (K3)
CO4: identify an appropriate hashing function and heap for an application. (K4)
CO5: apply suitable algorithms for solving problems related to shortest path, network
link analysis, and minimum spanning tree. (K3)
- Teacher: MANOCHITRA M