Vivekananda Institute of Professional Studies- Technical Campus, New Delhi
Vivekananda School of Information Technology
Lab Plan for
Data Structures and Algorithms
Subject Faculty: Dr. Pooja Saigal
Programme: BCA II A Paper Code: 106P Academic Year: 2024-25
P.No. Title Date (2A)
Arrays
Write a program to
1 (a.) create an array of integers and initialize it at compile-time 20-Jan-25
(b.) create another array of floating values and initialize it at run-time
(c.) display the elements of both the arrays with proper headings
Write a Program to implement Linear Search for
2 (a.) First occurrence of search item 20-Jan-25
(b.) All occurrences of search item
Write a program to
3 (a.) create an array of integers and initialize it 20-Jan-25
(b.) Find minimum and maximum elements in the array
(c.) Find sum and average of array elements
4 Write a program to Merge unsorted arrays 20-Jan-25
5 Write a program to Marge sorted arrays 20-Jan-25
6 Write a program to insert a number at a given location in an array. 27-Jan-25
7 Write a program to delete a number from a given location in an array. 27-Jan-25
8 Write a program to search a number in an array and delete it, if found. 27-Jan-25
9 Write a Program to implement Binary Search 27-Jan-25
Write a Program to perform elimination of duplicate elements from an existing
10 27-Jan-25
list of elements.
2-D Arrays and Sparse matrix
Create a Matrix. Perform addition, subtraction, Transpose and Multiplication
11 3-Feb-25
using Switch-Case statement.
12 Read and display Upper, Lower and Tri-diagonal matrices 3-Feb-25
13 Implement sparse matrices using 3-tuple notation. 3-Feb-25
Sorting methods
14 Write a Program to implement Selection Sort. 3-Feb-25
15 Write a Program to implement Insertion Sort. 10-Feb-25
16 Write a Program to implement Bubble Sort. 10-Feb-25
17 Write a Program to implement Merge Sort. 10-Feb-25
Linked Lists
WAP to implement Singly Linked List that stores data as integer and perform
following operations:
18 17-Feb-25
Traverse the list to display each element
Search for a specific element in the list
WAP to implement Singly Linked List that stores data as integer and perform
following operations:
19 17-Feb-25
Count the number of nodes in the list
Find minimum and maximum value in the linked list.
WAP to implement Singly Linked List that stores data as integer and perform
following operations:
20 Insert a new node in the beginning and end of the list 24-Feb-25
Insert a new node after a given node in the list.
Insert a new node before a given node in the list.
WAP to implement two Singly Linked List that stores data as integer and
21 perform following operation: 24-Feb-25
Merge the two lists to create a new sorted list
Vivekananda Institute of Professional Studies- Technical Campus, New Delhi
Vivekananda School of Information Technology
Lab Plan for
Data Structures and Algorithms
Subject Faculty: Dr. Pooja Saigal
Programme: BCA II A Paper Code: 106P Academic Year: 2024-25
P.No. Title Date (2A)
WAP to implement a Singly Linked List that stores data as integer and perform
22 following operation: 3-Mar-25
Create a new list that is reverse of the first linked list
WAP to implement Singly Linked List that stores data as integer and perform
following operations:
23 Delete a node in the beginning and end of the list. 3-Mar-25
Delete the node that comes after a given node in the linked list.
Search an element in the linked list. If found, delete it.
WAP to implement Doubly Linked List that stores data as integer and perform
following operations:
24 3-Mar-25
Traverse the list to display each element
Search for a specific element in the list
WAP to implement Doubly Linked List that stores data as integer and perform
following operations:
25 3-Mar-25
Insert a new node in the beginning, end and middle of the list
Delete a node in the beginning, end and middle of the list
WAP to implement Header Linked List with operations:
Insertion(Beginning, Between, End)
26 10-Mar-25
Deletion(Beginning, Between, End)
Traverse
Vivekananda Institute of Professional Studies- Technical Campus, New Delhi
Vivekananda School of Information Technology
Lab Plan for
Data Structures and Algorithms
Subject Faculty: Dr. Pooja Saigal
Programme: BCA II A Paper Code: 106P Academic Year: 2024-25
P.No. Title Date (2A)
WAP to implement Circular Linked List with operations:
Insertion(Beginning, Between, End)
27 Deletion(Beginning, Between, End) 10-Mar-25
Traverse
Linear Search
28 WAP to perform polynomial addition using linked lists 10-Mar-25
Stacks and Queues
Write a Program to Perform Pop, Push, Traverse operations on the stack using
29 10-Mar-25
array (Static Stack).
30 (Optional) WAP to Convert Infix Expression to Postfix form using Stack. 24-Mar-25
31 (Optional) WAP to Convert Infix Expression to Prefix form using Stack. 24-Mar-25
32 WAP to evaluate Postfix expression using Stack. 24-Mar-25
33 WAP to reverse the String using Stack 24-Mar-25
WAP to perform different operations with Queue such as Insert, Delete, Display
34 7-Apr-25
of elements using array. (Linear Queue or Static Queue)
WAP to perform different operations with Queue such as Insert, Delete, Display
35 7-Apr-25
of elements using Circular Queue.
Write a Program to Perform Pop, Push, Traverse operations on the stack using
36 7-Apr-25
Pointer (Dynamic Stack).
WAP to perform different operations such as Insert, Delete, Display elements
37 7-Apr-25
using Dynamic Queue.
WAP to implement priority queue with three priority values (1: Lowest, 2,
38 7-Apr-25
3:Highest)
39 WAP to find factorial of a number using recursion 11-Apr-25
40 WAP to generate Fibonacci Series of n-terms 11-Apr-25
Write a program to calculate the GCD of two numbers using recursive
41 11-Apr-25
functions
Binary Trees, Binary Search Trees
WAP to create a Binary tree and traverse the tree in Inorder, Preorder and
42 11-Apr-25
Postorder manner using recursive functions
WAP to create a Binary Search Tree (BST) and traverse the tree in Inorder,
43 11-Apr-25
Preorder and Postorder manner using recursive functions
Vivekananda Institute of Professional Studies- Technical Campus, New Delhi
Vivekananda School of Information Technology
Lab Plan for
Data Structures and Algorithms
Subject Faculty: Dr. Pooja Saigal
Programme: BCA II A Paper Code: 106P Academic Year: 2024-25
P.No. Title Date (2A)
WAP to implement following recursive operations on a Binary Search Tree
(BST)
a. Find an element
b. Insert an element
44 c. Delete an element 11-Apr-25
d. Count the number
e. Find maximum element
f. Find minimum element
g. Find height of the tree
Vivekananda Institute of Professional Studies- Technical Campus, New Delhi
Vivekananda School of Information Technology
Lab Plan for
Data Structures and Algorithms
Subject Faculty: Dr. Pooja Saigal
Programme: BCA II A Paper Code: 106P Academic Year: 2024-25
P.No. Title Date (2B)
Arrays
Write a program to
1 (a.) create an array of integers and initialize it at compile-time 23-Jan-25
(b.) create another array of floating values and initialize it at run-time
(c.) display the elements of both the arrays with proper headings
Write a Program to implement Linear Search for
2 (a.) First occurrence of search item 23-Jan-25
(b.) All occurrences of search item
Write a program to
3 (a.) create an array of integers and initialize it 23-Jan-25
(b.) Find minimum and maximum elements in the array
(c.) Find sum and average of array elements
4 Write a program to Merge unsorted arrays 23-Jan-25
5 Write a program to Marge sorted arrays 23-Jan-25
6 Write a program to insert a number at a given location in an array. 30-Jan-25
7 Write a program to delete a number from a given location in an array. 30-Jan-25
8 Write a program to search a number in an array and delete it, if found. 30-Jan-25
9 Write a Program to implement Binary Search 30-Jan-25
Write a Program to perform elimination of duplicate elements from an existing
10 30-Jan-25
list of elements.
2-D Arrays and Sparse matrix
Create a Matrix. Perform addition, subtraction, Transpose and Multiplication
11 #REF!
using Switch-Case statement.
12 Read and display Upper, Lower and Tri-diagonal matrices #REF!
13 Implement sparse matrices using 3-tuple notation. #REF!
Sorting methods
14 Write a Program to implement Selection Sort. #REF!
15 Write a Program to implement Insertion Sort. #REF!
16 Write a Program to implement Bubble Sort. #REF!
17 Write a Program to implement Merge Sort. #REF!
Linked Lists
WAP to implement Singly Linked List that stores data as integer and perform
following operations:
18 27-Feb-25
Traverse the list to display each element
Search for a specific element in the list
WAP to implement Singly Linked List that stores data as integer and perform
following operations:
19 27-Feb-25
Count the number of nodes in the list
Find minimum and maximum value in the linked list.
WAP to implement Singly Linked List that stores data as integer and perform
following operations:
20 Insert a new node in the beginning and end of the list 27-Feb-25
Insert a new node after a given node in the list.
Insert a new node before a given node in the list.
WAP to implement two Singly Linked List that stores data as integer and
21 perform following operation: 27-Feb-25
Merge the two lists to create a new sorted list
Vivekananda Institute of Professional Studies- Technical Campus, New Delhi
Vivekananda School of Information Technology
Lab Plan for
Data Structures and Algorithms
Subject Faculty: Dr. Pooja Saigal
Programme: BCA II A Paper Code: 106P Academic Year: 2024-25
P.No. Title Date (2B)
WAP to implement a Singly Linked List that stores data as integer and perform
22 following operation: 5-Mar-25
Create a new list that is reverse of the first linked list
WAP to implement Singly Linked List that stores data as integer and perform
following operations:
23 Delete a node in the beginning and end of the list. 5-Mar-25
Delete the node that comes after a given node in the linked list.
Search an element in the linked list. If found, delete it.
WAP to implement Doubly Linked List that stores data as integer and perform
following operations:
24 5-Mar-25
Traverse the list to display each element
Search for a specific element in the list
WAP to implement Doubly Linked List that stores data as integer and perform
following operations:
25 5-Mar-25
Insert a new node in the beginning, end and middle of the list
Delete a node in the beginning, end and middle of the list
WAP to implement Header Linked List with operations:
Insertion(Beginning, Between, End)
26 5-Mar-25
Deletion(Beginning, Between, End)
Traverse
Vivekananda Institute of Professional Studies- Technical Campus, New Delhi
Vivekananda School of Information Technology
Lab Plan for
Data Structures and Algorithms
Subject Faculty: Dr. Pooja Saigal
Programme: BCA II A Paper Code: 106P Academic Year: 2024-25
P.No. Title Date (2B)
WAP to implement Circular Linked List with operations:
Insertion(Beginning, Between, End)
27 Deletion(Beginning, Between, End) 12-Mar-25
Traverse
Linear Search
28 WAP to perform polynomial addition using linked lists 12-Mar-25
Stacks and Queues
Write a Program to Perform Pop, Push, Traverse operations on the stack using
29 12-Mar-25
array (Static Stack).
30 (Optional) WAP to Convert Infix Expression to Postfix form using Stack. 24-Mar-25
31 (Optional) WAP to Convert Infix Expression to Prefix form using Stack. 24-Mar-25
32 WAP to evaluate Postfix expression using Stack. 24-Mar-25
33 WAP to reverse the String using Stack 24-Mar-25
WAP to perform different operations with Queue such as Insert, Delete, Display
34 26-Mar-25
of elements using array. (Linear Queue or Static Queue)
WAP to perform different operations with Queue such as Insert, Delete, Display
35 26-Mar-25
of elements using Circular Queue.
Write a Program to Perform Pop, Push, Traverse operations on the stack using
36 26-Mar-25
Pointer (Dynamic Stack).
WAP to perform different operations such as Insert, Delete, Display elements
37 26-Mar-25
using Dynamic Queue.
WAP to implement priority queue with three priority values (1: Lowest, 2,
38 2-Apr-25
3:Highest)
39 WAP to find factorial of a number using recursion 2-Apr-25
40 WAP to generate Fibonacci Series of n-terms 2-Apr-25
Write a program to calculate the GCD of two numbers using recursive
41 2-Apr-25
functions
Binary Trees, Binary Search Trees
WAP to create a Binary tree and traverse the tree in Inorder, Preorder and
42 9-Apr-25
Postorder manner using recursive functions
WAP to create a Binary Search Tree (BST) and traverse the tree in Inorder,
43 9-Apr-25
Preorder and Postorder manner using recursive functions
Vivekananda Institute of Professional Studies- Technical Campus, New Delhi
Vivekananda School of Information Technology
Lab Plan for
Data Structures and Algorithms
Subject Faculty: Dr. Pooja Saigal
Programme: BCA II A Paper Code: 106P Academic Year: 2024-25
P.No. Title Date (2B)
WAP to implement following recursive operations on a Binary Search Tree
(BST)
a. Find an element
b. Insert an element
44 c. Delete an element 16-Apr-25
d. Count the number
e. Find maximum element
f. Find minimum element
g. Find height of the tree
