Engg katta

https://drive.google.com/open?id=1xPvMusSjSC2jP_LY8gBt4pyEqzyUBaP8

https://drive.google.com/open?id=1_sR_kZWafRPLweF6inemlcVsJ47nwePc

Assignment No: 5 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) https://drive.google.com/open?id=1-LhAduxW8orbQkUrBZrqeY8f1m7IU7Kv

Assignment 4: 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 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. https://drive.google.com/open?id=1BygrNMD7mWqBdmNmrJwVh9n99sYlVfsm

Assignment 3: Write a function to get the number of vertices in an un-directed graph and its edges. You may assume that no edge is input twice. i. Use adjacency list representation of the graph and find run time  of the function https://drive.google.com/open?id=1tn7X0nndhZMzBNbaI_tjj6GFPRU0IR7N ii. Use adjacency matrix representation of the graph and find run time of the function  https://drive.google.com/open?id=1VeR28sPH7TVEIGFxFevVJopRvIwbtn7K

Assignment 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 - i. Insert new node ii. Find number of nodes in longest path iii. Minimum data value 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 https://drive.google.com/open?id=1aQlBrpYlQAJVVgPIujXfjCCmconcY_L0