Sunday, June 24, 2012
CS 2208 DATA STRUCTURES lab manual ( DS lab manual) | for CSE - III semester |
download link : "data structure lab manual"
list of experiments :
1. Implement singly and doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial
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 postorder
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
Anna University Nov/Dec 2012 Timetable Result
To get instant updates like us in Facebook