ADVANCE DATA STRUCTURE
1)A book consists of chapters, chapters consists of sections and sections consist of subsections. Construct a tree and print the nodes. Find the time and space requirements of your method
__________________________________________________________________________________________________
2)Beginning with an empty binary search tree, construct binary search tree by inserting the values in the order given. After constructing a binary tree - Insert new node i. Find number of nodes in longest path ii. Minimum data value found in the tree iii. Change a tree so that the roles of the left and right pointers are swapped at every node iv. Search a value
__________________________________________________________________________________________________
3)Convert given binary tree into threaded binary tree. Analyze time and space complexity of the algorithm
__________________________________________________________________________________________________
4)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 graph and find runtime of the function ii. Use adjacency matrix representation of the graph and find runtime of the function
__________________________________________________________________________________________________
5)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
__________________________________________________________________________________________________
6)Consider telephone book database of N clients. Make use of a hash table implementation to quickly look up client's telephone number
__________________________________________________________________________________________________
7)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).
__________________________________________________________________________________________________
8)Read the marks obtained by students of second year in an online examination of particular subject. Find out maximum and minimum marks obtained in a that subject. Use heap data structure. Analyse the algorithm
__________________________________________________________________________________________________
9)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
__________________________________________________________________________________________________
2)Beginning with an empty binary search tree, construct binary search tree by inserting the values in the order given. After constructing a binary tree - Insert new node i. Find number of nodes in longest path ii. Minimum data value found in the tree iii. Change a tree so that the roles of the left and right pointers are swapped at every node iv. Search a value
__________________________________________________________________________________________________
3)Convert given binary tree into threaded binary tree. Analyze time and space complexity of the algorithm
__________________________________________________________________________________________________
4)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 graph and find runtime of the function ii. Use adjacency matrix representation of the graph and find runtime of the function
__________________________________________________________________________________________________
5)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
__________________________________________________________________________________________________
6)Consider telephone book database of N clients. Make use of a hash table implementation to quickly look up client's telephone number
__________________________________________________________________________________________________
7)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).
__________________________________________________________________________________________________
8)Read the marks obtained by students of second year in an online examination of particular subject. Find out maximum and minimum marks obtained in a that subject. Use heap data structure. Analyse the algorithm
__________________________________________________________________________________________________
9)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
Comments
Post a Comment