~ PUNE INSTITUTE OF COMPUTER TECHNOLOGY

DHANKAWADI, PUNE - 43.

LIST OF LAB ASSIGNMENTS

Sr. PROBLEM STATEMENT

Group A
1. Consider telephone book database ofN clients. Make use 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
(Note: Use linear probing with replacement and without replacement)
2. Implement all the functions of a dictionary (ADT) using open hashing technique:
separate chaining using linked list
Data: Set of (key, value) pairs, Keys are mapped to values, Keys must be comparable,
and Keys must be unique.
Standard Operations: Insert (key, value), Find(key), Delete(key)
Group B

3. Beginning with an empty binary tree, construct binary tree by inserting the values in
the order given. After constructing a binary tree perform the following operations on
it-:
I) Perform inorder, preorder and post order traversal
2) Copy this tree to another
3) Count number of leaves, number of internal nodes.
4) Erase all nodes in a binary tree.
4. 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 in ascending/ Descending order. Also find how many maximum
comparisons may be required for finding any keyword. Use Binary Search Tree for
implementation.

P:F-LTL-UG / 01 /RO
 5. Create an inordered threaded binary search tree. Pe,~10rm inorder and. preorde r
traversals without recursion. Analyze time and space complexity of the algortlh
m.
Group C

6. Represent a given graph using adjacency list to perform DFS and BFS. Use the
map of
the area around the college as the graph. Identify the prominent landmarks as nodes nd
a
perform DFS and BFS on that.

OR
There are flight paths between the cities. If there is a flight between the city A
and city
B then there is an edge between the city A to B. The cost of an edge represents
the time
required or fuel required to travel from city A to B. Represent this as a graph
using
adjacency list where every node of graph is represented by city name. Perfonn followin
g
operations:
1) Calculate in degree, out degree of vertices
2) Check whether graph is connected or not
7. You have a business with several offices; you want to lease phone lines to connect
them
up with each other; and the phone company charges different amounts of money
connect different pairs of cities. You want a set of lines that connects all your
to
offices
e
with a minimum total cost. Solve the problem by suggesting appropriate data structur
es.
OR
Consider the scheduling problem. n tasks to be scheduled on single processo
r. Let
tl, ... ,tn be durations required to execute on single processor is known. The tasks
can be
executed in any order but one task at a time. Design a greedy algorithm for this problem
and find a schedule that minimizes the total time spent by all the tasks in the
system.
(The time spent by one is the sum of the waiting time of task and the time spent
on its
execution.)

Group D

8. Given sequence k = kl <k2 < ... <kn of n sorted keys, with a search 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. 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 in ascending/ Descending order. Also find how many maximu
m
comparisons may require for finding any keyword. Use Height balance tree and
find
the complexity for finding a keyword.

Group E

10. Implement the Heap Sort algorithm demonstrating heap data structure with modular
ity
of programming language.

P:F-LTL-UG / 01 /RO 2
 -- .. - - ----- -

Group F

11.
Department maintains student information. The file contains roll number, name,
?ivision and address. Allow user to add, delete information of student. Display
mformation of a 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. Implementation of a direct access file -Insertion and deletion of a record from a direct
access file.

Mini-Project

13. ..
Students will select appropriate problem statement for their mmi project as per
consultation with lab coordinator.

Ms. Anja~and e Dr. S.C. Dharmadhikari

P:F-LTL-UG / 01 /RO 3