Scribd
Upload
7 views2 pages

ADA Exp Format Index

index format if experiment

Uploaded by

aryangupta92874
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
7 views2 pages

ADA Exp Format Index

index format if experiment

Uploaded by

aryangupta92874
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
You are on page 1/ 2

Institute of Technology & Management, Gwalior

Department of Computer Science & Engineering


Continuous Assessment Sheet (CAS)
Academic Year: 2023-27 Course Name: DSA Lab (CS 303)

Name of Student: Aryan Gupta Class & Batch: CSE Roll No.: 0905CS231046

Exp. Date Title of Experiment Concept Program Oral Total Date of Sign of
No. Under- Execut- and (30) Sub. Staff
standing ion (10) Report
(10) Writing
(10)
1. WAP to demonstrate the working of
Traversing, Insertion at specified
Location and deletion in an Array
2. WAP to search an element in the array
using Linear Search
3. WAP to search an element in the array
using Binary Search
4. WAP to demonstrate the working of
Bubble Sort
5. Write a menu driven program to
implement following operations on the
singly linked list
a) Insert a node at the front of the linked
list
b) Insert a node at the end of the linked
list
c) Insert a node such that linked list is in
ascending order
6. Write a menu driven program to
implement following operations on the
singly linked list
a) Delete a first node of the linked list
b) Delete a node before specified
position
c) Delete a node after specified position
7. WAP to add two Polynomials using
Linked List
8. WAP to demonstrate stack that performs
following operations using array
a) PUSH
b) POP
9. Write a C program that uses stack
operations to convert a given infix
expression into its postfix Equivalent,
Implement the stack using an array
10. WAP to Implement QUEUE using
arrays that per- forms following
operations
a) INSERT
b) DELETE
c) DISPLAY
11. WAP to implement Tree Traversals on
Binary Trees
12. WAP to implement BST
13. WAP to demonstrate the working of
Selection Sort
14. WAP to demonstrate the working of
Insertion Sort
15. WAP to demonstrate the working of
Quick Sort
16. WAP to demonstrate the working of
Merge Sort

Total Marks
Marks out of 100

Signature Sign Signature

Head of Department Course Teacher Student

You might also like