Greater Noida Institute of Management
(GNIM)
BCA Department
LAB FILE
Session (2025-2026)
DATA STRUCTURES
(BCA 2002P)
SUBMITTED BY: SUBMITTED TO:
Name-
Roll No.-
Course-
Semester-
Data Structures Lab Programs
1. Array Operations
• Write a program for insertion and deletion operations in an array.
2. Searching in an Array
• Write a program to search for an element in an array using Linear Search and Binary
Search.
3. Sorting an Array
• Write a program to sort an array using:
o Bubble Sort
o Selection Sort
o Insertion Sort
4. Merging Arrays
• Write a program to merge two arrays.
5. Matrix Operations
• Write a program to add and subtract two matrices.
• Write a program to multiply two matrices.
6. Singly Linked List Operations
• Write a program to insert an element into a Singly Linked List:
o At the beginning
o At the end
o At a specified position
• Write a program to delete an element from a Singly Linked List:
o At the beginning
o At the end
o At a specified element
7. Doubly Linked List Operations
• Write a program to perform the following operations in a Doubly Linked List:
o Create
o Search for an element
o Insert
o Delete
8. Circular Linked List Operations
• Write a program to perform the following operations in a Circular Linked List:
o Create
o Delete an element from the end
9. Stack Operations
• Write a program to implement stack operations using an array.
• Write a program to implement stack operations using a linked list.
10. Polynomial Addition
• Write a program to add two polynomials using linked lists.
11. Postfix Evaluation
• Write a program to evaluate a postfix expression using a stack.
12. Recursion Operations
• Write a program to perform the following using recursion:
o Find the factorial of a number
o Find the GCD of two numbers
o Solve the Towers of Hanoi problem
13. Queue Operations
• Write a program to implement simple queue operations using an array.
• Write a program to implement circular queue operations using an array.
• Write a program to implement circular queue operations using a linked list.
14. Binary Search Tree (BST) Operations
• Write a program to perform the following operations on a Binary Search Tree:
o Preorder Traversal
o Inorder Traversal
o Postorder Traversal
• Write a program to perform insertion operation in a Binary Search Tree.
INDEX
S. No. Name of the Program Page No.
1 Array Operations (Insertion and Deletion)
2 Searching in an Array using Linear Search and Binary Search
3 Sorting an Array using Bubble Sort, Selection Sort and Insertion Sort
4 Merging of Two Arrays
5 Matrix Operations (Addition, Subtraction and Multiplication)
6 Singly Linked List Operations (Insertion and Deletion)
7 Doubly Linked List Operations (Create, Insert, Delete and Display)
8 Circular Linked List Operations (Create, Insert and Delete)
9 Stack Operations using Array
10 Polynomial Addition using Linked List
11 Evaluation of Postfix Expression using Stack
12 Recursion Programs (Factorial, GCD and Towers of Hanoi)
13 Queue Operations (Simple Queue and Circular Queue using Array)
14 Binary Search Tree Operations (Insertion and Traversals)