Introduction to linked list and double linked list, Representation of linked lists in Memory, Traversing a linked list, Searching linked list, Insertion and deletion into linked list, Application of linked lists, Doubly linked lists, Traversing a doubly linked lists, Insertion and deletion into doubly linked lists 4. DETAILED CONTENTS 1.įundamental Notations (08 Periods) Problem solving concept, top down and bottom up design, structured programming, Concept of data types, variables and constants, Concept of pointer variables and constantsĪrrays (10 Periods) Concept of Arrays, Single dimensional array, Two dimensional array storage strategy of multidimensional arrays, Index Formula for single and multidimensional Array, Operations on arrays with Algorithms (Insertion, deletion), Advantages and disadvantages. The course will help students to develop the capability of selecting a particular data structure. The knowledge of ‘C’ language and data structures will be reinforced by practical exercises during the course of study. The practice and assimilation of data structure techniques is essential for programming. Understanding of data structures is essential and this facilitates the understanding of the language. RATIONALE Data structures are the techniques of designing the basic algorithms for real-life projects. DATA STRUCTURES USING C L T P Periods/week
0 kommentar(er)
