Header Ads

Data Structure Lab

Advanced Data Structure Lab

Savitribai Phule Pune University
Second Year of Computer Engineering (2015 Course)
ADS Lab


1For given expression eg. a-b*c-d/e+f construct inorder sequence and traverse it using postorder, preorder,inorder traversal.


2. Convert given binary tree into inordered and preordered threaded binary tree.Analyze time and space complexity of the algorithm.

3. A Dictionary stores keywords & 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 require for finding any keyword. Use Binary Search Tree for implementation.


5. You have a business with several offices; you want to lease phone lines to connect them upwith each other; and the phone company charges different amounts of money to connectdifferent pairs of cities. You want a set of lines that connects all your offices with a minimumtotal cost. Solve the problem by suggesting appropriate data structures. 

6. Implement all the functions of a dictionary (ADT) using hashing. 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)

7. The symbol table is generated by compiler.  From this perspective, the symbol table is a set of name-attribute pairs.  In a symbol table for a compiler, the name is an identifier, and the attributes might include an initial value and a list of lines that use the identifier. Perform the following operations on symbol table:
 (5)   Delete  name and its attribute

8.  A Dictionary stores keywords & 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 require for finding any keyword. Use Height balance tree and find the complexity for finding a keyword 

9. To create ADT that implements the SET concept.
 a. Add (newElement) -Place a value into the set  
b. Remove (element) Remove the value  
c. Contains (element) Return true if element is in collection  
d. Size () Return number of values in collection Iterator () Return an iterator used to loop over collection
 e. Intersection  of two sets, 
f. Union of two sets,  
g. Difference between two sets, 
h. Subset

10. 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 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.

11. Write a Java program which will demonstrate a concept of Interfaces and packages: In this assignment design and use of customized interfaces and packages for a specific application are expected.

12. Write a program on template and exception handling in Java: in this assignment multiple templates are to be designed as a pattern and these patterns to be used to take decisions.

13. Write a Java program for the implementation of different data structures using JAVA collection libraries (Standard toolkit library): at least 5 data structures are used to design a suitable application.

You can Download all above and remaining codes from below link.



Download All Programs


This blog will contain all the programs and study material for computer engineering.
Support us by Clicking on Ads.




4 comments:

  1. Thankyou
    please add the remaining codes

    ReplyDelete
  2. Developer dada, Heap cha program pan tak na....

    ReplyDelete
    Replies
    1. I haven't completed it yet. Submission is going on. So i'm a little bit busy.

      Delete

Powered by Blogger.