2nd semester Data structure and DBMS Assignments

core - III (Data structure)

• 1. To search an element and print the total occurrences in the array.
• 2. To insert and delete elements into/from appropriate position in an array.
• 4. To perform Bubble sort.
• 5. To perform Selection sort.
• 6. To implement linear linked list and perform operations such as traverse, search, insert, delete, and reversing the list.
• 7. To implement circular linked list and perform operations such as node insert and delete.
• 8. To implement double linked list and perform operations such as node insert and delete.
• 9. perform stack operations using linked list
• 10. To represent a Sparse Matrix using linked list.
• 11. Polynomial representation using linked list.
• 12. Array and Linked list implementations of Stack and perform operations such as push, pop and status.
• 13. Linked list implementation of Queue and perform operations such as enqueue and dequeue.
• 14. Linked list implementation of Circular Queue.
• 15. To implement a Binary Search Tree.
• 16. To perform tree traversal operations.