Problems on arrays.
Part D. Implementing linked List
Part E: Representation of sparse matrix
Part F: Implementing a stack using array and linked list representation and its applications
Part G: Implementing queue using array and linked list
Part I: Implementation of searching and sorting algorithms
Part J: Implementing a tree and its traversal
Part K: Implementing Binary search tree and binary expression tree
Part L: Implementing AVL tree and operations on it
Part N: Implementing heap (min-heap and max-heap)
Part O: Implementing graph algorithms

?To make students aware of efficient storage and systematic operations on data using data structure

?The students gather generalized ?practical ?knowledge on representing, storing, and operating on data in a systematic manner

S. Lipschutz, Data Structures, Tata McGraw-Hill , ?ISBN: 9780070601680

E. Horowitz, S. Sahni and S. Anderson-Freed, Fundamentals of Data Structures, Computer Science Press , ?ISBN: 978-0716780427

A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data Structures & Algorithms, Pearson Education India , ?ISBN: 9788178081021

T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, The MIT Press , ?ISBN: 9780262033848