CS3209 DATA STRUCTURES LABORATORY 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
CS3209 DATA STRUCTURES LABORATORY
LIST OF EXPERIMENTS
1. Implement singly and doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial
addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion
operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and post-order
traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim's algorithm using priority queues to find MST of an undirected
graph.
TOTAL: 45 PERIODS
CS3209 DATA STRUCTURES LABORATORY
LIST OF EXPERIMENTS
1. Implement singly and doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial
addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion
operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and post-order
traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim's algorithm using priority queues to find MST of an undirected
graph.
TOTAL: 45 PERIODS
No comments:
Post a Comment
Any doubt ??? Just throw it Here...