National Institute of Technology, Hamirpur

Department of Computer Science and Engineering

Data Structures Lab (CSD-229)

( CSE,DD,IIIU 4TH Semester)

LIST OF PRACTICALS:

S.NO. PRACTICALS
1 a) Write a Program to search and delete for an element in a array.
b) Write a Program to find mean, mode and standard deviation of the elements of
an array.
c) Write a Program to find the minimum and maximum element of an array.
d) Write a Program to check whether a string is a palindrome or not.
2 a) Write a Program to perform the following functions in a 3X3 Matrix (i)
Multiplication (ii) Addition (iii) Subtraction.
b) Write a program to merge two sorted arrays into one sorted array.
3 a) Write a program that uses stack operations to convert a given infix expression
into its equivalent postfix.
b) Write a program to reverse the elements in the stack using recursion
c) Write a program to implement stack using Linked List and array.
d) Write a Program to implement Postfix evaluation using stack.
4 a) Write a Program to implement Queue using 2 stacks and Linked List.
b) Write a program to perform the following: i) Create a singly linked list of
integers. ii) Delete a given integer from the above linked list. c) Display the
contents of the above list after deletion.
c) Write a program that uses functions to perform the following: a) Create a
doubly linked list of integers. b) Delete a given integer from the above doubly
linked list. c) Display the contents of the above list after deletion.
5 a) Write a Program to perform Inorder, Preorder and Postorder traversal on a
Binary Tree.
b) Write a Program for Binary Search Tree to implement following operations:
a. Insertion
b. Deletion
i. Delete node with only child
ii. Delete node with both children
c. Finding an element
d. Finding Min element
e. Finding Max element

6 a) Write a Program for AVL Tree to implement following operations:

a. Insertion: Test program for all cases (LL, RR, RL, LR rotation)
b. Deletion: Test Program for all cases (R0, R1, R-1, L0, L1, L-1)
c. Display: using set notation.
 (b) Write a Program to find whether the given BST is AVL tree or not.

9 a) Write a Program to store k keys into an array of size n at the location computed
using the following hashing methods
i. Division methods.
ii. Truncation methods.
iii. Folding methods.
iv. Digit analysis methods.

10 a) Write a Program to implement

i. Bubble Sort
ii. Insertion Sort
iii. Quick Sort
iv. Merge Sort
v. Selection Sort
11 a) Write a Program to implement
i. Linear Search
ii. Binary search

Shipi Sharma
(Lecturer, CSED)