Scribd
Upload
5 views

DSAL orientation for practical examination

The document outlines the lab experiments for the Data Structure and Algorithms Laboratory for the academic year 2024-25 at the Pune Institute of Computer Technology. It includes various problem statements and requirements for each lab experiment, focusing on data structures, sorting and searching algorithms, and graph representations. Students are instructed to follow specific guidelines for implementation and assessment criteria, including correctness, validations, and modularity.

Uploaded by

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

DSAL orientation for practical examination

The document outlines the lab experiments for the Data Structure and Algorithms Laboratory for the academic year 2024-25 at the Pune Institute of Computer Technology. It includes various problem statements and requirements for each lab experiment, focusing on data structures, sorting and searching algorithms, and graph representations. Students are instructed to follow specific guidelines for implementation and assessment criteria, including correctness, validations, and modularity.

Uploaded by

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

PUNE INSTITUTE OF COMPUTER TECHNOLOGY

DHANKAWADI, PUNE – 43.

LIST OF LAB EXPERIMENTS


ACADEMIC YEAR: 2024-25

DEPARTMENT: INFORMATION TECHNOLOGY Date: -25/06/2024


CLASS: S. E. SEMESTER: I
SUBJECT: DATA STRCUTRE AND ALGORITHMS LABORATORY- (214447)
LAB
EXPT
PROBLEM STATEMENT
NO
1. 1 chit will have 2 problem statements
2. Combinations can have any 2 statements from the list of experiments
3. There may be slight variation in statements as mentioned in the list below
4. NO CHANGE IN THE CHIT SHOULD BE ASKED FOR
5. IF YOU ARE UNABLE TO PERFORM ANY ONE OF THE 2, YOU MUST
MENTION SO ON THE ANSWER SHEET AND LEAVE THE EXAM ROOM.
6. Points observed
a. Correctness: Functionality of the program
b. Validations (e.g. validate input, while pushing to stack, check if full,
pop->check empty)
c. Modularity, parameter passing.
d. Time and space Complexity
e. Input / output formatting
f. Indentation
g. Comments
7. Oral questions
Suggestion: Develop program module wise:
1. Read and display. Compile, debug, run.
2. One of the functions in incremental way. Compile, debug, run. And so on.
3. Validations
4. Test for various cases

Any kind of disobeying of instructions or misbehavior will attract punishment.

1 Consider a student database of SEIT class (at least 15 records). Database contains
different. Fields of every student like Roll No, Name and SGPA.(array of structure)
a. Design a roll call list, arrange list of students according to roll numbers in ascending
order (Use Bubble Sort)
b. Arrange list of students alphabetically. (Use Insertion sort)
c. Arrange list of students to find out first ten toppers from a class. (Use Quick sort)
d. Search students according to SGPA. If more than one student having same SGPA,

P : F – LTL – UG / 01 / R0
PUNE INSTITUTE OF COMPUTER TECHNOLOGY
DHANKAWADI, PUNE – 43.
then print list of all students having same SGPA.
e. Search a particular student according to name using binary search without
recursion.
(All the student records having the presence of search key should be displayed)
(Note: Implement either Bubble sort or Insertion Sort.)

1. Any 2 sorting and 1 searching algorithm


Minimum requirement : Reading, displaying data, one sorting algorithm, oral
questions MUST be answered

Implement stack as an abstract data type using singly linked list and use this ADT for
conversion of infix expression to postfix, prefix and evaluation of postfix and prefix
2
expression.
Minimum: Stack implementation, one of the other functionality asked
Implement Circular Queue using Array. Perform following operations on it.
a) Insertion (Enqueue)
b) Deletion (Dequeue)
3 c) Display
(Note: Handle queue full condition by considering a fixed size of a queue.)
Some application will be given, like using queues to store a structure object, string
etc.
Construct an expression tree for postfix expression and perform recursive and non-
recursive Inorder, Preorder and Postorder traversals.
4
Minimum: Construction of tree and display using any of above mentioned
methods
Implement binary search tree and perform following operations:
a) Insert (Handle insertion of duplicate entry)
b) Delete
c) Search
d) Display tree (Traversal)
e) Display - Depth of tree
f) Display - Mirror image
5
g) Create a copy
h) Display all parent nodes with their child nodes
i) Display leaf nodes
j) Display tree level wise

Minimum: Insertion, Deletion, Search and Traversal are compulsory, from rest
of operations, perform Any one will be given
6 Implement In-order Threaded Binary Tree. Traverse the implemented tree in Pre-order
P : F – LTL – UG / 01 / R0
PUNE INSTITUTE OF COMPUTER TECHNOLOGY
DHANKAWADI, PUNE – 43.
too.
Represent a graph of your college campus using adjacency list /adjacency matrix.
Nodes should represent the various departments/institutes and links should represent
the distance between them. Find minimum spanning tree using
a) Using Kruskal’s algorithm.
7
b) Using Prim’s algorithm.
Analyze above two algorithms for space and time complexity.
Minimum: creation of graph, take input from user, display graph, showing MST
for a simple graph with atleast 4-5 nodes
Represent a graph of city using adjacency matrix /adjacency list. Nodes should
represent the various landmarks and links should represent the distance between
them. Find the shortest path using Dijkstra's algorithm from single source to all
8
destination. Analyze the implemented algorithm for space and time complexity
Minimum: creation of graph, take input from user, display graph, showing
shortest path for a simple graph with atleast 4-5 nodes
9 Implement Heap sort to sort given set of values using max or min heap.
Department maintains student’s database. The file contains roll number, name,
division and address. Write a program to create a sequential file to store and maintain
student data.
It should allow the user to
a) Create a student database
b) Add a information of student
10 c) Delete information of student
d) Search and Display information of particular student.
i. If record of student does not exist an appropriate message is displayed.
ii. If student record is found it should display the student details.
e) Display Record of All students in tabular from

Minimum: Writing, reading, searching and appending to a file.

P : F – LTL – UG / 01 / R0

You might also like