C/C++ programs of the Data Structures (CSO-102) Lab | IIT BHU | Even semester 2018-19
Guided By: Dr. Sanjay Kumar Singh, Professor, CSE, IIT (BHU) Varanasi.
Contents:
- Lab 1: Find mean, median, mode and standard deviation of a given dataset using an array.
- Lab 2: Find the highest number in a given matrix.
- Lab 3: Find the second largest element in an array.
- Lab 4: Reverse an array without using extra space
- Lab 5: Display sine wave of given amplitude and no. of asterisks per 180 degree phase.
- Lab 6: Implement two stack using 1-D array where the total size of both stacks are fixed but individual size may differ (use Dynamic Memory allocation and structure concepts)
- Lab 7: Use stack operations to convert given infix expression into its postfix equivalent. Implement the stack using an array.
- Lab 8: Use functions to perform the following operations:
(a) Create a singly linked list of integers.
(b) Delete a given integer from the above list.
(c) Display the contents of the above list after deletion - Lab 9.1: Implement double ended queue ADT using (a) Array.
Lab 9.2: Implement double ended queue ADT using (b) Doubly Linked List. - Lab 10: Use functions to perform the following operations:
(a) Create a binary search tree of characters
(b) Traverse the binary tree recursively in postorder, preorder and inorder. - Lab 11: Implement Priority Queue using BInary Heap.
- Lab 12: Check whether two trees are symmetric or not and also find that given tree is BST or not.
- Lab 13: Implement all the functions of a dictionary (ADT) using hashing.
- Lab 14.1: Implement (i) Depth First Search.
Lab 14.2: Implement (ii) Breadth First Search.
Lab 14.3: Implement(iii) Topological Sort on DAG using DFS.