JAGANNATH INTERNATIONAL MANAGEMENT
SCHOOL
(Department of Information Technology)
Laboratory Manual
Data Structure Using ‘C’
Bachelor of Computer Applications
Semester- IInd
(Session Apr. 2021 – Jul. 2021)
Subject Code: BCA 152
Submitted To: Submitted By:
Ms. Garima Saini Name
Assistant Professor – IT Department Roll No.
JIMS, Vasant Kunj, New Delhi Class
List of Programs
S No Program Date to be
signed by
1 WAP to calculate factorial of a number using recursion.
2 WAP to print Fibonacci series up to n terms using recursion.
3 WAP to calculate power of a number using recursion.
4 WAP to print table of a number using recursion.
5 WAP to reverse a number using recursion.
6 WAP to find GCD of two numbers using recursion.
7 WAP to insert and delete an element in case of an existing 1-D
Array.
8 WAP to find the maximum and minimum value in an array.
9 WAP to store a diagonal matrix into 1-D array for memory
saving purpose.
10 WAP to store triangular[lower/upper] matrix in 1-D array to
save memory.
11 WAP to store a Tri-diagonal matrix into 1-D array for
memory saving purpose.
12 WAP to input two matrices and transform them in sparse
matrices. Also add the sparse matrices using function.
13 Write a menu based program to perform PUSH, POP, PEEK
and Traverse operation on a STACK using Arrays.
14 WAP to copy one stack into another stack.
15 WAP to convert an Infix expression to Postfix expression.
16 WAP to evaluate a Postfix expression.
17 Write a menu based program to perform following operations
on a singly queue (using arrays):
Insertion into a queue.
Deletion from a queue.
Displaying the contents of a queue.
18 WAP to perform various operations on Circular queue using
arrays.
19 WAP to perform various operations on a D-Queue using
arrays.
20 WAP to perform following operations on Singly Linked list
Addition of a new node when the list is empty.
Addition of a node at the end of linked list.
Addition of a node at the beginning of linked list.
Addition of a node after the specified number of nodes.
Traversing a linked list.
Counting number of nodes in linked list.
Deleting a node from the linked list by specifying the
value of the deleting node.
21 WAP to add nodes in linked list in ascending order.
22 WAP to reverse a linked list.
23 WAP to delete every alternate node starting with the first
node in a singly linked list.
24 WAP that removes the first element of a linked list and adds
it to the end of the list without changing any value in the
information field.
25 Write a C program to delete a node with the minimum value
from a singly linked list.
26 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
Hint:- Divide a linked list into two parts.
27 WAP to perform addition of two polynomial using singly
linked list.
28 WAP to create a circular linked list[Creation, Insertion,
Deletion].
29 WAP to create a doubly linked list[Creation, Insertion,
Deletion].
30 Write a C program that will remove a specified node from a
given doubly linked list and insert it at the end of the list.
31 Write a menu based program to perform PUSH, POP, PEEK
and Traverse operation on a STACK using Linked List.
32 Write a menu based program to perform following operations
on a singly queue (using Linked list):-
Insertion into a queue.
Deletion from a queue.
Displaying the contents of a queue.
33 WAP to perform Linear search on sorted/unsorted array.
34 WAP to perform Binary search.
35 WAP to perform Binary search using recursion.
36 WAP to perform Bubble sort using function.
37 WAP to perform Selection sort using function.
38 WAP to perform Insertion sort using function.
39 WAP to perform Merge sort using function.
Instructions to be Strictly followed
File should have a neat and clean Index with a Signature column only
[Remove Date to be signed by column and Remarks/Signature
column].
All the programs should be duly executed by the student
himself/herself and make sure your output should be unique.
Output of each program must include your roll no. and complete
name.
Every student will be responsible for showing their practical file
on time (targets will be given weekly basis) during lab class failing
which their practical file will not be evaluated. To avoid any
problem, show your file for evaluation on or before the timeline.
You also need to upload your evaluated file (pdf format only)
whenever required.
Formatting Instructions:
1. For formatting, refer sample file shared.
2. Files without proper formatting will not be accepted.
