Trending: Anna University 8th Sem Results April 2014 May/June 2014 Time Table/ Internal Marks Calculate CGPA Online SSLC Results 2014 12th Result 2014

Test Footer 1

Sunday, July 15, 2012

CS 2201 DATA STRUCTURES SYLLABUS | ANNA UNIVERSITY BE CSE 3RD SEMESTER SYLLABUS REGULATION 2008 2011-2012

Latest: TNEA 2014 Engineering Application Status, Counselling Date, Rank List
CS 2201 DATA STRUCTURES SYLLABUS | ANNA UNIVERSITY BE CSE 3RD SEMESTER SYLLABUS REGULATION 2008 2011-2012
CS 2201 DATA STRUCTURES DS MODEL QUESTION PAPER 1/QUESTION BANK CLICK HERE
 BELOW IS THE ANNA UNIVERSITY THIRD SEMESTER BE COMPUTER SCIENCE ENGINEERING DEPARTMENT SYLLABUS IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011-2012 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2008 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009

CS 2201 DATA STRUCTURES L T P C
3 1 0 4
AIM:
To master the design and applications of linear, tree, balanced tree, hashing, set, and
graph structures.
UNIT I LINEAR STRUCTURES 9
Abstract Data Types (ADT) – List ADT – array-based implementation – linked list implementation – cursor-based linked lists – doubly-linked lists – applications of lists –Stack ADT – Queue ADT – circular queue implementation – Applications of stacks and queues
UNIT II TREE STRUCTURES 9
Tree ADT – tree traversals – left child right sibling data structures for general trees – Binary Tree ADT – expression trees – applications of trees – binary search tree ADT – Threaded Binary Trees.
UNIT III BALANCED TREES 9
AVL Trees – Splay Trees – B-Tree - heaps – binary heaps – applications of binary heaps
UNIT IV HASHING AND SET 9
Hashing – Separate chaining – open addressing – rehashing – extendible hashing - Disjoint Set ADT – dynamic equivalence problem – smart union algorithms – path compression – applications of Set
UNIT V GRAPHS 9
Definitions – Topological sort – breadth-first traversal - shortest-path algorithms – minimum spanning tree – Prim's and Kruskal's algorithms – Depth-first traversal – biconnectivity – Euler circuits – applications of graphs
TOTAL: 45 PERIODS
TEXT BOOK:
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education, 2005.
REFERENCES:
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Data Structures and Algorithms”, Pearson Education, First Edition Reprint 2003.
2. R. F. Gilberg, B. A. Forouzan, “Data Structures”, Second Edition, Thomson India Edition, 2005.

No comments:

Post a Comment

Any doubt ??? Just throw it Here...