Syllabus_for_3rd_Semester_DS.md

Practical / Lab work to be performed for Data Structures

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

• Click me to Navigate to the file
  
  

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

• Click me to Navigate to the file
  
  

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 me to Navigate to the file
  
  

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

• Click me to Navigate to the file
  
  

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

• Click me to Navigate to the file
  
  

6. Perform Stack operations using Linked List implementation.

• Click me to Navigate to the file
  
  

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

• Click me to Navigate to the file
  
  

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

• Click me to Navigate to the file
  
  

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

• Click me to Navigate to the file
  
  

10. Write a program to scan a polynomial using linked list and add two polynomial.

• Click me to Navigate to the file
  
  

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

• Click me to Navigate to the file
  
  

12. Write a program to display Fibonacci series (i) using recursion, (ii) using iteration

• Click me to Navigate to the file
  
  

13. Write a program to calculate GCD of 2 number (i) with recursion (ii) without recursion

• Click me to Navigate to the file
  
  

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

• Insertion (Recursive and Iterative Implementation)
• Deletion by copying
• Deletion by Merging
• Search a no. in BST
• Display its preorder, postorder and inorder traversals Recursively
• Display its preorder, postorder and inorder traversals Iteratively
• Display its level-by-level traversals
• Count the non-leaf nodes and leaf nodes
• Display height of tree
• Create a mirror image of tree
• Check whether two BSTs are equal or not
  
  
• Click me to Navigate to the file
  
  

15. Write a program to convert the Sparse Matrix into non-zero form and vice-versa.

• Click me to Navigate to the file
  
  

16. Write a program to reverse the order of the elements in the stack using additional stack.

• Click me to Navigate to the file
  
  

17. Write a program to reverse the order of the elements in the stack using additional Queue.

• Click me to Navigate to the file
  
  

18. Write a program to implement Diagonal Matrix using one-dimensional array.

• Click me to Navigate to the file
  
  

19. Write a program to implement Lower Triangular Matrix using one-dimensional array.

• Click me to Navigate to the file
  
  

20. Write a program to implement Upper Triangular Matrix using one-dimensional array.

• Click me to Navigate to the file
  
  

21. Write a program to implement Symmetric Matrix using one-dimensional array.

• Click me to Navigate to the file
  
  

22. Write a program 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.

• Click me to Navigate to the file
  
  

23. Write a program to implement various operations on AVL Tree.

• Click me to Navigate to the file