Data Structures Syllabus
Periods/week : 3 Periods & 1 Tut /week. Ses. : 30 Exam : 70
Examination (Practical): 3hrs. Credits: 4
Revision of C Language Overview only (no questions to be set on this).
Arrays and Functions:
Organization and use of One Dimensional, Two Dimensional and Multi Dimensional Arrays, Handling of Character Strings, String Operation, Concept of Function, Parameter Passing, Recursion.
Structures, Pointers and Files:
Definition of Structure and Union, Programming examples; Pointers, Pointer Expressions, Programming examples; File Operations, Preprocessor.
Linear Data Structures:
Stack Representation, Operation, Queue Representation, Operations, Circular Queue, List, Representation, Operations, Double Linked and Circular Lists.
Non-Linear Data Structures:
Trees, Binary Tree Representation, Tree Transversals, Conversion of a General Tree to Binary Tree, Representation of Graphs.
Basic Search Techniques, Tree Searching Graphics, Linked Representation of Graphics, Graph Transversal and Spanning Trees.
Programming In ANSI C, by E. Balaguruswamy.
Data Structures Using C, by A. M. Tanenbaum and others.
An Introduction To Data Structures With Applications, Trembly and Sorenson.
The C – Programming Language, Kerningham and others.