CBCS DATA STRUCTURE PRACTICAL ASSIGNMENT

CMSACOR05P: Data Structures Lab Practical: 60 Lectures 

1. Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. 

2. WAP using templates to sort a list of elements. Give user the option to perform sorting using Insertion sort, Bubble sort or Selection sort. 

3. Implement Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list and concatenate two linked lists (include a function and also overload operator +). CLICK HERE

 4. Implement Doubly Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list.  CLICK HERE

5. Implement Circular Linked List using templates. Include functions for insertion, deletion and search of a number, reverse the list. CLICK HERE

6. Perform Stack operations using Linked List implementation.  CLICK HERE

7. Perform Stack operations using Array implementation. Use Templates.

8. Perform Queues operations using Circular Array implementation. Use Templates. 

9. Create and perform different operations on Double-ended Queues using Linked List implementation.CLICK HERE

 10. WAP to scan a polynomial using linked list and add two polynomial. CLICK HERE

11. WAP to calculate factorial and to compute the factors of a given no. (i)using recursion, (ii) using iteration CLICK HERE

12. (ii) WAP to display Fibonacci series (i)using recursion, (ii) using iteration  CLICK HERE

 13. WAP to calculate GCD of 2 number (i) with recursion (ii) without recursion  CLICK HERE

 

 14. WAP to create a Binary Search Tree and include following operations in tree:

 i. Insertion (Recursive and Iterative Implementation) 

ii. Deletion by copying

 iii. Deletion by Merging

 iv. Search a no. in BST 

v. Display its preorder, postorder and inorder traversals Recursively

 vi. Display its preorder, postorder and inorder traversals Iteratively 

vii. Display its level-by-level traversals 

viii. Count the non-leaf nodes and leaf nodes

 ix. Display height of tree

 x. Create a mirror image of tree xi. Check whether two BSTs are equal or not 

15. WAP to convert the Sparse Matrix into non-zero form and vice-versa. 

16. WAP to reverse the order of the elements in the stack using additional stack. CLICK

17. WAP to reverse the order of the elements in the stack using additional Queue.  CLICK

18. WAP to implement Diagonal Matrix using one-dimensional array. CLICK

19. WAP to implement Lower Triangular Matrix using one-dimensional array. 

20. WAP to implement Upper Triangular Matrix using one-dimensional array. 

21. WAP to implement Symmetric Matrix using one-dimensional array.

22. WAP to create a Threaded Binary Tree as per inorder traversal, and implement operations like finding the successor / predecessor of an element, insert an element, inorder traversal.

 23. WAP to implement various operations on AVL Tree.