0% found this document useful (0 votes)
8 views39 pages

SMN DSA File

The document is a lab file for the Bachelor of Computer Applications program at Vivekananda Institute of Professional Studies. It contains various programming tasks related to data structures and algorithms, including operations on arrays, linked lists, sorting algorithms, and matrix manipulation. Each task includes a description, code, and expected output format.

Uploaded by

qwertyuiop
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
0% found this document useful (0 votes)
8 views39 pages

SMN DSA File

The document is a lab file for the Bachelor of Computer Applications program at Vivekananda Institute of Professional Studies. It contains various programming tasks related to data structures and algorithms, including operations on arrays, linked lists, sorting algorithms, and matrix manipulation. Each task includes a description, code, and expected output format.

Uploaded by

qwertyuiop
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/ 39

VIVEKANANDA INSTITUTE OF PROFESSIONAL STUDIES

VIVEKANANDA SCHOOL OF INFORMATION TECHNOLOGY

BACHELOR OF COMPUTER APPLICATIONS

DSA Lab File

Paper Code: BCA 174

SUBMITTED TO: SUBMITTED BY:

Dr. Neetu Goel Name: Soumen Sabui


Assistant Professor Enrollment no: 36817702023
VSIT, VIPS BCA - 2 C
Q1) WAP to implement following operation on one dimensional array

Insertion (ii) Deletion (iii) Traversal (iv) Reverse (v) Merge:

CODE:
OUTPUT:
Q2) WAP to Sort an array using menu driven:

(i) BUBBLE SORT (ii) MERGE SORT (iii) INSERTION SORT


(iv) SELECTION SORT.

CODE:

OUTPUT:
Q3) WAP to implement a Singly Linked List.

CODE:
OUTPUT:
Q4) WAP to implement a circular linked list

CODE:
OUTPUT:
Q5) WAP to implement doubly linked list.

CODE:
OUTPUT:
Q11) WAP to search and display the location of an element specified
by the user, in an array using (i) Linear search (ii) Binary search
technique.

CODE: (I)Linear search


OUTPUT: (I) Linear search
CODE: (II) Binary search technique

OUTPUT: (II)Binary search technique


Q12) WAP to accept a matrix from user, find out matrix is sparse or
not and convert into triplex matrix.

CODE:
OUTPUT:
Q13) WAP to implement polynomial addition operation using linked
list.

CODE:
OUTPUT:
Q14) 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

CODE:
OUTPUT:
Q15) WAP to implement Student Database using Linked List with the
following structure:

● Name
● Rollno
● Marks of 5 subjects
● Average
● Result, if the average < 50, then print ‘FAIL’, otherwise, ‘PASS’

CODE:
OUTPUT:

You might also like