Scribd
Upload
16 views3 pages

List of Practical

Uploaded by

nikita.khawase
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
16 views3 pages

List of Practical

Uploaded by

nikita.khawase
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

PEOPLES EMPOWERMENT GROUP

ISBM COLLEGE OF ENGINEERING, PUNE


Department of Artificial Intelligence and Data Science
Academic Year 2023-24

Subject: Data Structure and Algorithms Laboratory Class: SE AI & DS

List of Experiment

Sr. Planned Conducted


No. Laboratory Assignments date of date of
Experiment Experiment
Group A
A-1 Consider telephone book database of N clients. Make use of
a hash table implementation to quickly look up client‘s
1 telephone number. Make use of two collision handling
techniques and compare them using number of comparisons
required to find a set of telephone numbers
A-2 Implement all the functions of a dictionary (ADT) using
hashing and handle collisions using chaining with / without
replacement.
2
Data: Set of (key, value) pairs, Keys are mapped to values,
Keys must be comparable, Keys must be unique. Standard
Operations: Insert(key, value), Find(key), Delete(key)
Group B
B-5 A book consists of chapters, chapters consist of sections
and sections consist of subsections. Construct a tree and print
3
the nodes. Find the time and space requirements of your
method.
B-6 Beginning with an empty binary search tree, Construct
binary search tree by inserting the values in the order given.
After constructing a binary tree -
4 i. Insert new node, ii. Find number of nodes in longest path from
root, iii. Minimum data value found in the tree, iv. Change a tree
so that the roles of the left and right pointers are swapped at
every node, v. Search a value
B-7 Construct an expression tree from the given prefix
5 expression eg. +--a*bc/def and traverse it using post order
traversal (non recursive) and then delete the entire tree.
Group C
C- 13 Represent a given graph using adjacency matrix/list to
perform DFS and using adjacency list to perform BFS. Use the
6 map of the area around the college as the graph. Identify the
prominent land marks as nodes and perform DFS and BFS on
that.
7 C-14 There are flight paths between cities. If there is a flight
PEOPLES EMPOWERMENT GROUP
ISBM COLLEGE OF ENGINEERING, PUNE
Department of Artificial Intelligence and Data Science
Academic Year 2023-24

Subject: Data Structure and Algorithms Laboratory Class: SE AI & DS

List of Experiment
between city A and city B then there is an edge between the
cities. The cost of the edge can be the time that flight take to
reach city B from A, or the amount of fuel used for the journey.
Represent this as a graph. The node can be represented by
airport name or name of the city. Use adjacency list
representation of the graph or use adjacency matrix
representation of the graph. Check
whether the graph is connected or not. Justify the storage
representation used.
Group D
D-18 Given sequence k = k1 <k2 < … <kn of n sorted keys,
with a search probability pi for each key ki . Build the Binary
8
search tree that has the least search cost given the access
probability for each key?
D-19 A Dictionary stores keywords and its meanings. Provide
facility for adding new keywords, deleting keywords, updating
values of any entry. Provide facility to display whole data sorted
9
in ascending/ Descending order. Also find how many maximum
comparisons may require for finding any keyword. Use Height
balance tree and find the complexity for finding a keyword
Group E
E-20 Consider a scenario for Hospital to cater services to
different kinds of patients as Serious (top priority), b) non-
10
serious (medium priority), c) General Checkup (Least priority).
Implement the priority queue to cater services to the patients.
Group F
F-23 Department maintains a student information. The file
contains roll number, name, division and address. Allow user
to add, delete information of student. Display information of
11 particular employee. If record of student does not exist an
appropriate message is displayed. If it is, then the system
displays the student details. Use sequential file to main the
data.
F-24 Company maintains employee information as employee
ID, name, designation and salary. Allow user to add, delete
12 information of employee. Display information of particular
employee. If employee does not exist an appropriate message is
PEOPLES EMPOWERMENT GROUP
ISBM COLLEGE OF ENGINEERING, PUNE
Department of Artificial Intelligence and Data Science
Academic Year 2023-24

Subject: Data Structure and Algorithms Laboratory Class: SE AI & DS

List of Experiment
displayed. If it is, then the system displays the employee
details. Use index sequential file to maintain the data.

You might also like