CS3206 DATA STRUCTURES SYLLABUS | ANNA UNIVERSITY B.TECH PETROCHEMICAL TECHNOLOGY 3RD SEMESTER SYLLABUS REGULATION 2008 2011-2012 BELOW IS THE ANNA UNIVERSITY THIRD SEMESTER B.TECH PETROCHEMICAL TECHNOLOGY 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
CS3206 DATA STRUCTURES L T P C
3 0 0 3
UNIT I FUNDAMENTALS OF ALGORITHMS 8
Algorithm – Analysis of algorithm – Best case and worst case complexities – Analysis
of algorithm using data structures – Performance analysis – Time complexity – Space
complexity – Amortized time complexity – Asymptotic notation.
UNIT II FUNDAMENTALS OF DATA STRUCTURES 9
Arrays – Structures – Stacks – Definition and examples – Representing stacks – Queues
and lists – Queue and its representation – Applications of stack – Queue and linked lists.
UNIT III TREES 10
Binary trees – Operations on binary tree representations – Node representation –
Internal and external nodes – Implicit array representation – Binary tree traversal –
Huffman algorithm – Representing lists as binary trees – Sorting and searching
techniques – Tree searching – Hashing.
UNIT IV GRAPHS AND THEIR APPLICATIONS 9
Graphs – An application of graphs – Representation – Transitive closure – Warshall’s
algorithm – Shortest path algorithm – A flow problem – Dijikstra’s algorithm – Minimum
spanning trees – Kruskal and Prim’s algorithm – An application of scheduling – Linked
representation of graphs – Graph traversals.
28
UNIT V STORAGE MANAGEMENT 9
General lists – Operations – Linked list representation – Using lists – Freeing list nodes
– Automatic list management : Reference count method – Garbage collection –
Collection and compaction.
TOTAL: 45 PERIODS
TEXT BOOKS
1. Cormen T. H.., Leiserson C. E, and Rivest R.L., “Introduction to Algorithms”,
Prentice Hall of India, 2007.
2. M.A.Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition,
Pearson Education, 2005.
REFERENCES
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Computer
Algorthims/C++”, Universities Press (India) Private Limited, 2nd Edition, 2007.
2. Aho, A. V., Hopcroft, J. E. and Ullman, J. D., “Data Structures and Algorithms”,
1st Edition, Pearson Education, 2003.
3. Gilberg, R. F. and Forouzan, B. A., “Data Structures”, 2nd Edition, Thomson India
Edition, 2005.
4. Kruse, R.L, Leung, B. P. and Tondo, C. L., “Data Structures and Program Design in
C”, Pearson Education, 2004.
5. Tanaenbaum A. S. Langram, Y. Augestein M.J, “Data Structures using C”, Pearson
Education, 2004.
CS3206 DATA STRUCTURES L T P C
3 0 0 3
UNIT I FUNDAMENTALS OF ALGORITHMS 8
Algorithm – Analysis of algorithm – Best case and worst case complexities – Analysis
of algorithm using data structures – Performance analysis – Time complexity – Space
complexity – Amortized time complexity – Asymptotic notation.
UNIT II FUNDAMENTALS OF DATA STRUCTURES 9
Arrays – Structures – Stacks – Definition and examples – Representing stacks – Queues
and lists – Queue and its representation – Applications of stack – Queue and linked lists.
UNIT III TREES 10
Binary trees – Operations on binary tree representations – Node representation –
Internal and external nodes – Implicit array representation – Binary tree traversal –
Huffman algorithm – Representing lists as binary trees – Sorting and searching
techniques – Tree searching – Hashing.
UNIT IV GRAPHS AND THEIR APPLICATIONS 9
Graphs – An application of graphs – Representation – Transitive closure – Warshall’s
algorithm – Shortest path algorithm – A flow problem – Dijikstra’s algorithm – Minimum
spanning trees – Kruskal and Prim’s algorithm – An application of scheduling – Linked
representation of graphs – Graph traversals.
28
UNIT V STORAGE MANAGEMENT 9
General lists – Operations – Linked list representation – Using lists – Freeing list nodes
– Automatic list management : Reference count method – Garbage collection –
Collection and compaction.
TOTAL: 45 PERIODS
TEXT BOOKS
1. Cormen T. H.., Leiserson C. E, and Rivest R.L., “Introduction to Algorithms”,
Prentice Hall of India, 2007.
2. M.A.Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition,
Pearson Education, 2005.
REFERENCES
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Computer
Algorthims/C++”, Universities Press (India) Private Limited, 2nd Edition, 2007.
2. Aho, A. V., Hopcroft, J. E. and Ullman, J. D., “Data Structures and Algorithms”,
1st Edition, Pearson Education, 2003.
3. Gilberg, R. F. and Forouzan, B. A., “Data Structures”, 2nd Edition, Thomson India
Edition, 2005.
4. Kruse, R.L, Leung, B. P. and Tondo, C. L., “Data Structures and Program Design in
C”, Pearson Education, 2004.
5. Tanaenbaum A. S. Langram, Y. Augestein M.J, “Data Structures using C”, Pearson
Education, 2004.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...