CE403

Data Structures

[3 1 2 5]

Course Learning Outcome:

After successful completion of this course, student will be able to:
recognize the need of various data structures
analyse various structures and their applicability
design and implement various techniques for searching, sorting and recurrence
identify the appropriate data structure and algorithm design method for the given application

Syllabus:
Introduction to Data Structures: Types of Data Structures, Linear & non-linear Data Structures
Linear Data Structures & their sequential storage representation: Storage Structures for arrays, stack
definitions & concepts, operations on stacks, double stack, applications of Stacks-Recursion, Polish
Expressions and their compilation, Queue-Representation of queue, operations on queue, priority queues,
linked list-linked linear list-operation on linear list using singly linked storage structures, circularly linked
list, doubly linked linear list, applications of linked linear list-polynomial manipulation.
Non Linear Data Structures: Trees-Definitions and concepts, operations on Binary Trees, Storage
Representation and Manipulation of Binary Trees-Linked & Threaded, Conversion Of General Trees To
Binary Trees, Sequential and other representations of trees, applications of Trees-the Manipulation of
Arithmetic Expressions, Multi Linked Structures-Sparse Matrices. Graphs-Matrix representation of
graphs, Breadth First Search, Depth First Search, Spanning Trees Dynamic Storage Management-Fixed
Block Storage Allocation, First-Fit Storage Allocation, Storage Release, Buddy System, Garbage
Collection, Compaction.
Sorting & Searching: Sorting-Notation and Concepts, Time and Space Complexity, Asymptotic
behaviour, Sorting: Insertion Sort, Selection Sort, Bubble Sort, Merge Sort, Tree Sort, Quick Sort, Shell
Sort, Radix Sort, Address Calculation Sort, Summary of Sorting
Searching: Searching-Sequential & Binary Searching, Search Trees-Height Balanced, Weight Balance, 23 Trees, Tree Structures Hashing: Hash Table Methods-Introduction, Hashing Functions, and CollisionResolution Techniques
File Structure: Definition of Record, File, Blocking, Compaction and Database, introductory overview of
Database Management System, Implementation and Traders of Sequential Access, Index Sequential
Access, Random Access, B-Trees, Inverted List and Multi list

Self-Study:
The self-study contents will be declared at the commencement of semester. Around 10% of the questions
will be asked from self-study contents.

Page 1 of 2

Laboratory Work:
Laboratory work will be based on above syllabus with minimum 10 experiments to be incorporated.

Tutorial Work:
Tutorial work will be based on above syllabus with minimum 10 tutorials to be incorporated.

References:
1. Jean-Paul Tremblay and Paul G. Sorenson, An Introduction to Data Structures with Applications,
Tata McGraw Hill
2. Tanenbaum, Data Structures using C & C++, PHI
3. Robert L. Kruse, Data Structures and Program Design in C, PHI
4. Mary E.S. Loomis, Data Management and file processing, PHI

Page 2 of 2