Maharaja Surajmal Institute

Department of Computer Application

LIST OF PRACTICALS FOR (Data Structure Practical)

S No Unit Concept/ Problem Statement & Teaching Method

No & Content/Area/
Name Functionality/
on which
practical is
based
1.​ Unit I Arrays 1.​ WAP to implement following operation on one dimensional array (i)
Insertion in sorted and unsorted arrays (ii) Deletion from sorted and
unsorted arrays (iii) Traversal (iv) Reverse
2.​ Unit I Arrays 2.​ WAP to perform following string related function (user defined) on an
array
i.​ Finding string length
ii.​ Concatenation of two strings
iii.​ Comparing two string
iv.​ Copy one string to another

3.​ Unit I Arrays 3.​ WAP to perform sorting in array(Menu Driven) :-

Bubble sort
Selection sort
Insertion sort
merge sort
Merging two sorted array
4.​ Unit I Arrays 4.​ WAP to perform searching in array(Menu Driven) :-
i.​ Linear search
ii.​ Binary Search
5.​ Unit I Sparse Matrix 5.​ WAP to accept a matrix from user and find out whether matrix is
sparse or not and convert into triplex matrix or tuple form
6.​ Unit I Sparse Matrix 6.​ WAP to display the sparse matrix in the following way(Menu Driven)
:-
i.​ Upper triangular matrix
ii.​ Lower triangular matrix
iii.​ Diagonal matrix

7.​ Unit I Sparse Matrix 7.​ WAP to perform the following operations on sparse matrix(Menu
Driven:-
i.​ Transpose of sparse matrix
ii.​ Add two sparse matrices
iii.​ Multiply two sparse matrices
8.​ Unit II Linked List 8.​ WAP to do the following operations on Singly linked list-
i.​ Create a list
ii.​ Traverse a list(forward/backward)
iii.​ Reversal of a list
9.​ Unit II Linked List 9.​ WAP to do the following operations on Singly linked list
i.​ Insertion in a list(sorted/unsorted list) :-
a.​ At the beginning
b.​ At the end
c.​ Anywhere in the middle
10.​ Unit II Linked List 10.​ WAP to do the following operations on Singly linked list:-
i.​ Deletion in a list(sorted/ unsorted list)
a.​ At the beginning
b.​ At the end
c.​ Anywhere in the middle
11.​ Unit II Linked List 11.​ WAP to do the following operations on linked list:-
i.​ Searching from a list
ii.​ Sorting from a list
12.​ Unit II Linked List 12.​ WAP to do the following operations on Doubly linked list-
i.​ Create a list
ii.​ Traverse a list(forward/backward)
13.​ Unit II Linked List 13.​ WAP to do the following operations on Doubly linked list
i.​ Insertion in a list(sorted/unsorted list)
a.​ At the beginning
b.​ At the end
c.​ Anywhere in the middle

14.​ WAP to do the following operations on Doubly linked list:-

i.​ Deletion in a list(sorted/unsorted list)
a.​ At the beginning
b.​ At the end
c.​ Anywhere in the middle
14.​ Unit II Linked List 15.​ WAP to do the following operations on Circular linked list-
i.​ Create a list
ii.​ Traverse a list(forward/backward)
15.​ Unit II Linked List 16.​ WAP to do the following operations on Circular linked list
i.​ Insertion in a list(sorted/unsorted list)
a.​ At the beginning
b.​ At the end
c.​ Anywhere in the middle

17.​ WAP to do the following operations on Circular linked list:-

i.​ Deletion in a list(sorted/unsorted list)
a.​ At the beginning
b.​ At the end
c.​ Anywhere in the middle
16.​ Unit II Linked List 18.​ WAP to merge two singly sorted linked lists.
19.​ WAP to implement Polynomial addition operation using Singly linked
list.
17.​ Unit II Linked List 20.​ Write a C program to create two linked lists from a given list in
following way :- INPUT List: - 1 2 3 4 5 6 7 8 9 10
OUTPUT:- First List:- 1 3 5 7 9 Second List:- 2 4 6 8 10
18.​ Unit II Linked List 21.​ WAP to implement Student Database using Linked List with the
following structure :-
i.​ Name
ii.​ Rollno
iii.​ Marks of 5 subjects
iv.​ Average
v.​ Result, If the average < 50, then print ‘Fail’, otherwise ‘Pass’
19.​ Unit II Stacks 22.​ WAP to implement push and pop operations using arrays ( Static
and stack)
 Unit 23.​ WAP to implement push and pop operations using linked
III list.(Dynamic Stack)
24.​ Write a program to evaluate (i) Prefix Expression (ii) Postfix
Expression using stack.
20.​ Unit Stacks and 25.​ Write a program to convert Infix to equivalent (i) Prefix expression (ii)
III Queues Postfix expression
26.​ WAP to implement queue using array
i.​ Insertion
ii.​ Deletion
21.​ Unit Queues 27.​ WAP to implement queue using linked list
III i.​ Insertion
ii.​ Deletion
28.​ WAP to do insertion and deletion in double ended queue using array(
Static De-Queue) and linked list(Dynamic De-Queue)

22.​ Unit Queues 29.​ WAP to do insertion and deletion in a Priority Queue using array and
III linked list
30.​ WAP to implement a (i) Static Circular Queue (ii) Dynamic Circular
Queue

23.​ Unit Stacks 31.​ Let us assume a Patient's coupon generator for the Doctors’ clinic. The
III patients are given the coupons on first-come-first-serve basis. After the
visit of a patient, patient-ID is kept stack-wise. At the end of the day,
the count is generated from the stack. Construct a menu-based
program for patients’ coupons generator using an appropriate data
structure.
24.​ Unit Stacks 32.​ Sometimes a program requires two stacks containing the same type of
III items. Suppose two stacks are stored in separate arrays, then one stack
might overflow while there is considerable unused space in the other.
A neat way to avoid this problem is to put all spaces in one stack and
let this stack grow from one end of the array, and the other stack starts
from the other end and grows in the opposite direction, i.e., toward the
first stack. In this way, if one stack turns out to be large and the other
small, then they will still both fit, and there will be no overflow until
all space is used. Declare a new structure that includes these two
stacks and perform various stack operations.
25.​ Unit Trees 33.​ Implement recursive algorithms for the following operations on Binary
IV Search Tree :-
i.​ Insertion
ii.​ Searching
26.​ Unit Trees 34.​ Implement recursive algorithms for BST traversal- Inorder, Preorder,
IV Postorder.
35.​ WAP to implement an expression tree. (For example: (a + b / (c * d) –
e) )

​ ​ ​ ​ ​ ​ ​ ​