Data Structure Design Set B
Data Structure Design Set B
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
x*y/a +b-c
16. (i)Write a program in Python to implement student details using class and object to demonstrate ADT.
17. Write a python program to demonstrate the following Binary Tree Traversal methods
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.
22. Write a python program to implement Dijkstra’s Algorithm to find the shortest path