COURSE OUTCOMES
Upon completion of this course, the student will be able to
CO1: impart the basic concepts of data structures and implementation of stacks and different types of queues using arrays. (K3)
CO2: implement different types of list, stack and queue using pointers. (K3)
CO3: Construct different types of trees. (K3)
CO4: recognize the various indexing techniques and distinguish various hashing and collision resolution techniques. (K2)
CO5: realize the basic concepts and applications of graphs to solve different real time problems. (K4)
- Teacher: MANOCHITRA M