Scribd
Upload
18 views3 pages

Dsa Index

The document outlines a curriculum for a Data Structure course using C for Bachelor of Computer Applications students at Jagannath International Management School. It includes a list of programming assignments that cover various data structure concepts such as recursion, arrays, linked lists, stacks, queues, and matrix operations. The assignments are designed to enhance students' practical skills in implementing data structures and algorithms.

Uploaded by

satyamshiv15official
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views3 pages

Dsa Index

The document outlines a curriculum for a Data Structure course using C for Bachelor of Computer Applications students at Jagannath International Management School. It includes a list of programming assignments that cover various data structure concepts such as recursion, arrays, linked lists, stacks, queues, and matrix operations. The assignments are designed to enhance students' practical skills in implementing data structures and algorithms.

Uploaded by

satyamshiv15official
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

JAGANNATH INTERNATIONAL MANAGEMENT

SCHOOL

(Department of Information
Technology)

Data Structure Using ‘C’

Bachelor of Computer Applications

Semester-IInd
Subject Code: BCA 102P
(Session : Jan 2025 – Jul 2025)

Submitted To: Submitted By:

Dr. Abha Pandey Name:

Assistant Professor–IT Department RollNo:

JIMS, Vasant Kunj, New Delhi Class : BCA, Shift II


List of Programs

S. No. Program Statement Date Signature


WAP using recursion to check whether a number is prime
1.
number or not.

2. WAP using recursion to print fibonacci series upto ‘n’ terms

3. WAP to find GCD of two numbers using recursion.

4. WAP to reverse a number using recursion.

WAP to implement following operation on one dimensional


5. array (i) Insertion (ii) Deletion (iii) Traversal (iv) Reverse (v)
Merge
WAP to search & display the location of an element specified
by the user, in an array using (i) Linear Search for unsorted list
6.
(ii) Linear Search for sorted list (iii) Binary Search technique
using function (iv) Binary Search technique using recursion.
WAP to find the frequency of all elements in a 1-D array and
7. delete the duplicate elements keeping only the first copy of the
element.
WAP to Sort an array using menu driven: (i) BUBBLE SORT
8. (ii) SELECTION SORT (iii) INSERTION SORT (iv) MERGE
SORT

WAP to implement following operation on matrices (i)


9. Addition (ii) Subtraction (iii) Multiplication (iv) Transponse (v)
calculate trace of a matrix (vi) calculate norm of a matrix
WAP to store triangular[lower/upper] matrix in1-D array to
10.
save memory.
WAP to accept a matrix from user, find out matrix is sparse or
11.
not and convert into triplex matrix.
12. WAP to implement a Singly Linked List.
13. WAP to implement a Circular Linked Lists

14. WAP to implement Doubly Linked Lists


WAP to implement Polynomial addition operation using linked
15.
list.
Write a C program to create two linked lists from a given list in
following way
16.
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
WAP to implement student database using linked list with the
following structure:
17. “Name, rollno, marks of 5 subjects, average, result”

If the average is less than 50 then print ‘fail’ otherwise ‘pass’.


Write a menu driven program to implement (i) Static
18.
Stack (ii) Dynamic Stack.
Write a program to convert Infix to equivalent (i) Prefix
19.
expression (ii) Postfix expression

Write a program to evaluate (i) Prefix Expression (ii) Postfix


20.
Expression using stack.
21. WAP to implement a (i) Static (ii) Dynamic Linear Queue
22. WAP to implement a (i) Static (ii) Dynamic Circular Queue
23. WAP to implement a (i) Static (ii) Dynamic De-Queue
Let us assume a Patient's coupon generator for the Doctors’
clinic. The patients are given the coupons on first-come-first-
serve basis. After the visit of a patient, patient-ID is kept stack-
24. 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.

Sometimes a program requires two stacks containing the same


type of 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
25.
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

You might also like