Description: CS2208 - Data Structures Lab (Anna University)
EXERCISES
1a. Implement singly linked lists.
1b. Implement 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 postorder 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.
To Search:
File list (Check if you may need any files):
CS2208_DSLab_Programs
.....................\01a.algorithm_DS.doc
.....................\01a.program_DS.doc
.....................\01b.algorithm_DS.doc
.....................\01b.program_DS.doc
.....................\02.algorithm_DS.doc
.....................\02.program_DS.doc
.....................\03.algorithm_DS.doc
.....................\03.program_DS.doc
.....................\04.algorithm_DS.doc
.....................\04.program_DS.doc
.....................\05.algorithm_DS.doc
.....................\05.program_DS.doc
.....................\06.algorithm_DS.doc
.....................\06.program_DS.doc
.....................\07.algorithm_DS.doc
.....................\07.program_DS.doc
.....................\08.algorithm_DS.doc
.....................\08.program_DS.doc
.....................\09.algorithm_DS.doc
.....................\09.program_DS.doc
.....................\10.algorithm_DS.doc
.....................\10.program_DS.doc
.....................\CONTENTS.doc
.....................\CS2208_syllabus.doc
.....................\logo.png
Download