Data Structures Lab

Data Structures and C Programming 

(Practical Lab)

BVNSD 2.2

1. Write a program to manipulate stack operations like push, pop, display and search using array.
2. Write a program to manipulate stack operations like push, pop, display and search using linked list.
3. Write a program to convert infix expression into postfix and postfix into infix.
4. Write a program to implement queue operations like Insert, Delete, search using array.
5. Write a program to implement queue operations like Insert, Delete, search using linked list.
6. Write a program to implement circular queue using Insert, Delete, search operation.
7. Write a program to implement dequeue using Insert, Delete, search operation.
8. Write a program to implement Linear Linked List. Using inset, delete, add at beg, append, display and count function.
9. Write a program to implement circular Linked List. Using inset, delete, add at beg, append, display and count function.
10. Write a program to implement Doubly Linked list. Using inset, delete, add at beg, append, display and count function.
11. Write a program to construct the Binary tree and also traverse the binary tree in in order, pre order, post order.
12. Write program to perform bubble sorting.
13. Write program to perform selection sorting
14. Write program to perform quick sorting
15. Write program to perform heap sorting
16. Write program to perform merge sorting
17. Write program to perform the binary search.
18. Write program to perform the linear search.
19. Write a program to implement DFS, BFS.
20. Write a program to implement direct search.
21. Write a program to implement prims algo.