K J’s Educational Institute
K J College of Engineering & Management Research
(Accredited by NAAC)
Sr. No. 25 & 27, Kondhwa - Saswad Road, Near Bopdev Ghat, Pune
411048.
Department of Computer Engineering
Subject: Data Structure and Algorithm Sem_II
List of Experiments A.Y.: 2023-24
Exp. Name Page
No. No.
1 Implement all the functions of a dictionary (ADT) using hashing. 6
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)
2 Consider telephone book database of N clients. Make use 12
of a hash table implementation to quickly look up client‘s
telephone number. Make use of two collision handling
techniques and compare them using number of
comparisons required to find a set of telephone numbers
3 A book consists of chapters, chapters consist of sections 15
and sections consist of subsections. Construct a tree and
print the nodes. Find the time and space requirements of
your method.
4 To illustrate the various Binary Tree functions. 18
For given expression eg. a-b*c-d/e+f construct inorder sequence and
traverse it using postorder traversal (non recursive).
5 A Dictionary stores keywords and its meanings. 23
Provide facility for adding new keywords, deleting
keywords, updating values of any entry. Provide
facility to display whole data sorted 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.
6 Represent a given graph using adjacency matrix/list to perform DFS 29
and using adjacency list to perform BFS. Use the map of the area
around the college as the graph.
Subject Incharge HOD
K J’s Educational Institute
K J College of Engineering & Management Research
(Accredited by NAAC)
Sr. No. 25 & 27, Kondhwa - Saswad Road, Near Bopdev Ghat, Pune
411048.
Department of Computer Engineering
Subject: Data Structure and Algorithm Sem_II
List of Experiments A.Y.: 2023-24
7 There are flight paths between cities. If there is a flight 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. Justify the storage representation
used.
8 Given sequence k = k1 <k2 < … <kn of n sorted keys, with a search 33
probability pi for each key ki . Build the Binary search tree that has
the least search cost given the access probability for each key?
9 Implement the Heap/Shell sort algorithm implemented in Java 47
demonstrating heap/shell data structure with modularity of
programming language.
10 Read the marks obtained by students of second year in an online 51
examination of particular subject. Find out maximum and minimum
marks obtained in that subject. Use heap data structure. Analyze the
algorithm.
11 Department maintains a student information. The file contains roll 55
number, name, division and address. Allow user to add, delete
information of student. Display information of 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.
12 Write a Java program which will demonstrate a concept 59
of Interfaces and packages: In this assignment design
and use of customized interfaces and packages for a
specific application are expected.
Subject Incharge HOD
K J’s Educational Institute
K J College of Engineering & Management Research
(Accredited by NAAC)
Sr. No. 25 & 27, Kondhwa - Saswad Road, Near Bopdev Ghat, Pune
411048.
Department of Computer Engineering
Subject: Data Structure and Algorithm Sem_II
List of Experiments A.Y.: 2023-24
13 Write a Java program which will demonstrate a concept of cohesion 65
and coupling of the various modules in the program.
Subject Incharge HOD
