COURSE OUTCOMES
Upon completion of this course, the students will be able to
CO1: apply the concepts of sorting and searching techniques. (K3)
CO2: implement linear and non linear data structures using static and dynamic memory allocation. (K3)
CO3: apply the operations of stack and queue to solve problem. (K3)
CO4: implement hashing function and heap for an application. (K3)
CO5: apply suitable algorithms to solve shortest path problems. (K3)
- Teacher: MANOCHITRA M