0% found this document useful (0 votes)
13 views16 pages

DS Practical File

The document outlines a practical file for a Data Structures Lab course for the session 2025-26. It includes various experiments such as implementing a sparse matrix, stack operations, linked list manipulations, and doubly and circular linked lists. Each experiment consists of a description, code, and expected output.

Uploaded by

paper
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views16 pages

DS Practical File

The document outlines a practical file for a Data Structures Lab course for the session 2025-26. It includes various experiments such as implementing a sparse matrix, stack operations, linked list manipulations, and doubly and circular linked lists. Each experiment consists of a description, code, and expected output.

Uploaded by

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

PRACTICAL FILE

SESSION: 2025-26
DATA STRUCTURES LAB
(CIC-255)
IInd Year, IIIrd Sem

Submitted to: Submitted by:


Name:
Name:
Enrollment No:
Designation:
Section:
EXP-1. Implement sparse matrix using array. Description of
program: a. Read a 2D array from the user b. Store it in the
sparse matrix form, use array of structures c. Print the final
array.
Code:
Output:

EXP-2. Create a stack and perform Push, Pop, Peek and


Traverse operations on the stack.
Code:
Output:
EXP-3. Create a linked list with nodes having information
about a student and perform a. Insert a new node at
specified position. b. Delete of a node with the roll number of
student specified. c. Reversal of that linked list.
Code:
Output:
EXP-4. Create doubly linked list with nodes having information
about an employee and perform Insertion at front of doubly
linked list and perform deletion at end of that doubly linked
list.
Code:
Output:
EXP-5. Create circular linked list having information about a
college and perform Insertion at front, perform Deletion at
end.
Code:
Output:
----------------------------------*****------------------------------------

You might also like