AD3271- DATA STRUCTURES DESIGN LABORATORY
SET B
1. Write a program in Python to implement student details using class and object to demonstrate ADT.
2. Write a program in Python to implement employee details using class and object to demonstrate ADT.
3. Write a program in Python to implement library details using class and object to demonstrate ADT.
4. Write a program in Python to implement student details using class and object to demonstrate ADT.
5. Write a program in python to implement singly linked list node and perform operations such as
insertions and deletions dynamically.
6. Write a python program to implement Stack ADT using Linked List. The implementation should have
the following Operations
(i)PUSH
(ii)POP
(iii)TRAVERSAL
7.Write a python program to implement Queue ADT using python arrays. The implementation should
have the following Operations
(i)Enqueue
(ii)Dequeue
(iii)Traversal
8.Write a python program to implement Queue ADT using Linked List. The implementation should have
the following Operations
(i)Enqueue
(ii)Dequeue
(iii)Traversal
9. Write a python program to convert the following infix expression to postfix
x*y/a +b-c
10. Write a program in python to do polynomial addition using linked list.
11. Write a python program to implement Linear Search algorithm
12. Write a python program to implement Binary search algorithm
13. Write a python program to implement bubble sort algorithm
14. Write a python program to implement insertion sort algorithm
15. Write a python program to implement Quick sort algorithm
16. (i)Write a program in Python to implement student details using class and object to demonstrate ADT.
(ii)To write a program in python to implement FCFS algorithm using queue.
17. Write a python program to demonstrate the following Binary Tree Traversal methods
(i) in order traversal
(ii) preorder traversal
(iii) post order traversal
18. Write a python program to construct a Binary Search Tree. Insert minimum eight elements. Delete a
Leaf node. Display the tree and the necessary data after insertion and deletion.
19. Write a python program to implement Minheap and Maxheap
20. Write a python program to implement depth first graph traversal.
21. Write a python program to implement Breadth first traversal
22. Write a python program to implement Dijkstra’s Algorithm to find the shortest path
23. Write a program in python to implement FIBONACCI SERIES using recursion.
24. Write a program in python to implement stack operations using array.
25. Write a program in python to implement queue operations using array.
26. Write a program in python to implement list operations using array.