Syllabus for DATA STRUCTURES AND ALGORITHMS | IT2201 | Anna University Syllabus

DATA STRUCTURES AND ALGORITHMS 1T2201 AIM
To master the design and applications of linear, tree, and graph structures To understand various algorithm design and analysis techniques

UNIT I

LINEAR STRUCTURES

Abstract Data Types (ADT) - List ADT - array-based Implementation - linked list implementation - cursor based linked lists - applications of lists - Static ADT - Queue ADT - circular Queue implementation - Applications of stacks and queues

UNIT II

TREE STRUCTURES

Tree ADT - Tree Traversals - Left child sibling data structures for general trees - binary tree ADT - expression trees - application of trees - binary search tree ADT - AVL trees - binary heaps


UNIT III

HASHING AND SETS

Hashing-Separate Chaining-Open Addressing - Rehashing - Extensible Hashing - Disjoint set ADT - Dynamic Equivalence problem - Smart Union Algorithms - Path Compression - Application of sets

UNIT IV

GRAPHS

Definitions-Topological sort - breadth first traversal - shortest path algorithms- Minimum spanning tree- Prim's and Kruskal's algorithms-Depth First Traversal - Bi-connectivity-Euler circuits-Application of graphs.

UNIT V

ALGORITHM DESIGN AND ANALYSIS

Introduction to algorithm design techniques: Greedy Algorithms, Divide and Conquer- Dynamic Programming - Backtracking - Branch and bound , Randomized algorithm,Introduction to algorithm analysis:asymptotic notations,recurrences-Introduction to NP complete problems

TEXT BOOK :

M.A.Weiss - "Data Structures and Algorithm Analysis in C" Second Edition