Sandip Foundations

Sandip Institute of Engineering & Management

Department of Computer Engineering (Academic Year 2017 – 18 Semester – II)
Advanced Data Structures Lab
Group A S1 S2 S3 S4
A book consists of chapters, chapters consist of sections and sections consist of
1 18th Dec 17 19th Dec 17 20th Dec 17 19th Dec 17
subsections. Construct a tree and print the nodes.
Beginning with an empty binary search tree, Construct binary search tree by inserting
the values in the order given. After constructing a binary tree -
2 i. Insert new node ii. Find number of nodes in longest path iii. Minimum data value 28th Dec 17 2nd Jan 18 27th Dec 17 26th Dec 17
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
For given expression eg. a-b*c-d/e+f construct inorder sequence and traverse it using th
3 8 Jan 18 9th Jan 18 5th Jan 18 2nd Jan 18
postorder traversal(non recursive).
Group B S1 S2 S3 S4
Write a function to get the number of vertices in an undirected graph and its edges.
You may assume that no edge is input twice. i.Use adjacency list representation of the
4 11th Jan 18 15th Jan 18 10th Jan 18 9th Jan 18
graph and find runtime of the function ii. Use adjacency matrix representation of the
graph and find runtime of the function
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
takes to reach city B from A, or the amount of fuel used for the journey. Represent this
5 15th Jan 18 22nd Jan 18 12th Jan 18 15th Jan 18
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.
Group C S1 S2 S3 S4
Consider telephone book database of N clients. Make use of a hash table
6 22nd Jan 18 29th Jan 18 17th Jan 18 23rd Jan 18
implementation to quickly look up client‘s telephone number (with Replacement)
Implement all the functions of a dictionary (ADT) using hashing (Without
Replacement). Data: Set of (key, value) pairs, Keys are mapped to values, Keys must
7 29th Jan 18 12th Feb 18 19th Jan 18 30th Jan 18
be comparable, Keys must be unique Standard Operations: Insert(key, value),
Find(key), Delete(key)
Group D S1 S2 S3 S4
Given sequence k = k1 <k2 < ... < kn of n sorted keys, with a search probability pi for
8 each key ki. Build the Binary search tree that has the least search cost given 12th Feb 18 13th Feb 18 24th Jan 18 13th Feb 18
the access probability for each key.
 A Dictionary stores keywords & its meanings. Provide facility for adding new
9 26th Feb 18 26th Feb 18 31st Jan 18 27th Feb 18
keywords. Provide facility to display whole data sorted in ascending/ Descending order
Group E S1 S2 S3 S4
create the ADT that implements set concept 1.add(new element) place a value into the
10 set 2.remove 3.Search 4.size returns no. of values in collection 5.intersection of two 15th March 18 27th Feb 18 28th Feb 18 15th March 18
sets 6.union of two sets
Group F S1 S2 S3 S4
Department maintains a student information. The file contains roll number, name,
division and address. Allow user to add, delete information of student. Display
11 information of particular employee. If record of student does not exist an appropriate 19th March 18 19th March 18 16 March 18 20 March 18
message is displayed. If it is, then the system displays the student details. Use
sequential file to main the data.
Group G S1 S2 S3 S4
Any application defining scope of Formal parameter, Global parameter, Local
parameter accessing mechanism and also relevance to private, public and protected
12 22nd March 18 20th March 18 21 March 18 22nd March 18
access. Write a Java program which demonstrates the scope rules of the programming
mechanism.
Write a Java program which will demonstrate a concept of Interfaces and packages: In
13 this assignment design and use of customized interfaces and packages for a specific 26th March 18 26th March 18 23rd March 18 27th March 18
application are expected.
Write a Java program for the implementation of different data structures using JAVA
14 collection libraries (Standard toolkit library): at least 5 data structures are used to 29th March 18 27 March 18 28th March 18 29th March 18
design a suitable application.

Prof. Sujit A. Ahirrao Dr. K. C. Nalavade

Subject Incharge HOD