Lab Assignments
Program: MCA (AI & IoT)
Semester: 2nd, Session: 2025-2026
Course: Data Structures
Assignment I:
Prob.1) W.A.P. to check whether a matrix is upper triangular or not.
Prob.2) W.A.P. to determine if a matrix is a symmetrical matrix or not.
Prob.3) W.A.P. to find the trace and norm of a matrix.
Assignment II:
Prob.1) W.A.P. to generate the alternative representation of the sparse matrix.
Prob.2) W.A.P. to transpose an alternative representation of a sparse matrix. Here i/p is any
alternative representation and o/p is the alternative representation of the transposed form of the
original matrix..
Assignment III:
Prob.1) W.A.P. to create a singly linked linear list, display it, reverse it and again display the
reversed form.
Prob.2) W.A.P. to
a) Concatenate two different singly linked linear lists into one and display it.
b) Insert a new node in three different positions (beginning, end, and between two nodes) into
an existing singly linked linear list.
Assignment IV:
Prob.1) W.A.P. to delete alternate nodes (starting from 1st node) from an existing singly linked
list.(i.e. delete 1st, 3rd, 5th, 7th and so on).
Prob. 2) W.A.P. to
a) Create a doubly linked linear list
b) Display the original list
c) Delete an existing node from the linked list from three different positions
d) Display the new list.
Assignment V:
Prob.1) Write a menu-driven program to implement Stack operations (Push and Pop) using
array.
Prob.2) W.A.P. to convert an infix expression into postfix form using Stack.
Assignment VI:
Prob.1) W.A.P. to evaluate a postfix expression using Stack.
Prob. 2) Write a menu driven program to implement Stack operations (Push and Pop) using a
Singly linked list.
Assignment VII:
Prob. 1) W.A.P. to add two polynomial equations using a linked list.
Prob. 2) Write a menu driven program to implement linear Queue operations (Insert and Delete)
using an array.
Assignment VIII:
Prob. 1) Write a menu driven program to implement linear Queue operations (Insert and Delete)
using a singly linked list.
Prob.2) W.A.P. to create a binary tree (using either array or linked list) and traverse it in different
orders (Inorder, Preorder, and Postorder).
Assignment IX:
Prob.1) W.A.P. to create a binary search tree (using either array or linked list) and delete any
existing node from the tree. The node to be deleted has to be taken from the keyboard.
Prob. 2) W.A.P. to compute the in-degree and out-degree of a vertex of a directed graph when
the graph is represented by an adjacency list.
Assignment X:
Prob. 1) W.A.P. to traverse a graph using breadth first search (BFS) technique.
Prob. 2) W.A.P. to find the minimum cost spanning tree using Kruskal’s algorithm.
Assignment XI:
Prob. 1) W.A.P. to search an element in an array using the Binary Search method.
Prob.2) [Link] sort an unsorted list of elements using Bubble Sort technique.
Assignment XII:
Prob. 1) W.A.P. to sort an unsorted list of elements using the Quick Sort technique.
Prob. 2) W.A.P. to sort an unsorted list of elements using the Merge Sort technique.