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