Data structures- BE03000081

Lab Practical

1. Write a program using array to read 10 elements from the user and display.

2. Write a program to implement linear search.

3. Write a program to implement binary search on a sorted array.

4. Implement a stack using arrays and perform the following operations: Push, Pop, Peek, and Display.

5. Write a program to implement a queue using arrays and perform Enqueue, Dequeue, and Display operations.

6. Write a menu driven program to create a dynamic list using dynamic memory allocation functions (malloc(), calloc(), realloc() and free()). First program should ask the user to input the initial size of the list and then give a menu to add or delete the elements in the list. The program should have following menus.

(a) Add an element

(b) Delete last element

(c) Display the list elements

(d) Reset

7. Write a menu driven program to implement following operations on the singly linked list.

(a) Insert a node at the front of the linked list.

(b) Insert a node at the end of the linked list.

(c) Insert a node such that linked list is in ascending order. (according to info. field)

(d) Delete the first node of the linked list.

(e) Delete a node with a given value in info. field.

(f) Delete a node after specified position.

8. Write a program to implement following operations on the doubly linked list.

(a) Insert a node at the front of the linked list.

(b) Insert a node at the end of the linked list.

(c) Delete a last node of the linked list.

(d) Delete a node before specified position.

9. Implement recursive tree traversing methods for a binary tree – inorder, preorder and post-order traversal.

10. Write a program which create binary search tree. Also write a function to search an element from binary search tree.

11. Implement a graph using adjacency matrix and adjacency list representations.

12. Write a program to implement Bubble Sort.

13. Write a program to implement Selection Sort.

14. Write a program to implement Merge Sort.

Assignments

Assignments & Term Work / Self Learning (Internal)

LECTURE NOTES

1. LECTURE NOTES