please ask Neha to look at this
TAKE HOME TEST: CS 425 (THEORY OF ALGORITHMS) [DUE: TUESDAY 11:59 pm] Each question must be answered carefully and giving detail. Any duplicate work with another classmate will result 0 credit for both. 1. Given the following keys: 36, 87, 124, 887, 58, 268 a) Determine the h(k) values using h(k) = k mod m Given hash table size is 11 b) Construct the hash table. Show your work. Use Quadratic Probing with C1 = 1 and C2 = 3 2. Given an undirected Graph as below: Explain Kruskal’s algorithm and illustrate applying on the graph given above to determine the minimum Spanning Tree. What is the expected runtime to solve this problem? 3. Given a directed graph as below: Some of the edges are missing on the Graph. ORD to BOS: 1400, BOS to JFK: 150, JFK to BOS: 175 JFK to MIA = 1300, MIA to JFK = 1000, LAX to DFW: 1100 and DFW to MIA is 900 LAX to MIA: 2750, and MIA to LAX = 2300 and DFW to LAX = 1400 and SFO to LAX = 350 and SFO to ORD = 1800, ORD to JFK = 750, JFK to DFW = 1600, DFW to SFO: 1700 First draw an adjacency matrix using all the edges and vertices. Use Floyd Algorithm to find the D and P matrices using the data given above. Then, determine the shortest distance and shortest path (Using the D and P matrix you obtained by running the program you have developed in homework 5) for the following pairs: a) LAX to JFK b) JFK to LAX c) SFO to MIA d) MIA to ORD You must include the code and the complete work, by giving the two matrices and how you interpret the results. 4. Given the directed Graph as below. Assuming P as the source, determine the single source shortest path (Dijkastra algorithm). Do this work without any computer program. Trace the Path from P to each of the other vertices after completing the tables. 5. Use the Prim’s algorithm Computer Program to determine the minimum spanning tree for the graph shown below. Draw the MST. Must include the computer program along with your results (output from the code). Note: All the problems should be included in one file. All programs must be typed and run. No credits for handwritten codes. TAKE HOME TEST: CS 425 (THEORY OF ALGORITHMS) [DUE: TUESDAY 11:59 pm] Each question must be answered carefully and giving detail. Any duplicate work with another classmate will result 0 credit for both. 1. Given the following keys: 36, 87, 124, 887, 58, 268 a) Determine the h(k) values using h(k) = k mod m Given hash table size is 11 b) Construct the hash table. Show your work. Use Quadratic Probing with C1 = 1 and C2 = 3 2. Given an undirected Graph as below: Explain Kruskal’s algorithm and illustrate applying on the graph given above to determine the minimum Spanning Tree. What is the expected runtime to solve this problem? 3. Given a directed graph as below: Some of the edges are missing on the Graph. ORD to BOS: 1400, BOS to JFK: 150, JFK to BOS: 175 JFK to MIA = 1300, MIA to JFK = 1000, LAX to DFW: 1100 and DFW to MIA is 900 LAX to MIA: 2750, and MIA to LAX = 2300 and DFW to LAX = 1400 and SFO to LAX = 350 and SFO to ORD = 1800, ORD to JFK = 750, JFK to DFW = 1600, DFW to SFO: 1700 First draw an adjacency matrix using all the edges and vertices. Use Floyd Algorithm to find the D and P matrices using the data given above. Then, determine the shortest distance and shortest path (Using the D and P matrix you obtained by running the program you have developed in homework 5) for the following pairs: a) LAX to JFK b) JFK to LAX c) SFO to MIA d) MIA to ORD You must include the code and the complete work, by giving the two matrices and how you interpret the results. 4. Given the directed Graph as below. Assuming P as the source, determine the single source shortest path (Dijkastra algorithm). Do this work without any computer program. Trace the Path from P to each of the other vertices after completing the tables. 5. Use the Prim’s algorithm Computer Program to determine the minimum spanning tree for the graph shown below. Draw the MST. Must include the computer program along with your results (output from the code). Note: All the problems should be included in one file. All programs must be typed and run. No credits for handwritten codes. TAKE HOME TEST: CS 425 (THEORY OF ALGORITHMS) [DUE: MONDAY 9 AM] Each question must be answered carefully and giving detail. Any duplicate work with another classmate will result 0 credit for both. 1. Given the following keys: 36, 87, 124, 887, 58, 268 a) Determine the h(k) values using h(k) = k mod m Given hash table size is 11 b) Construct the hash table. Show your work. Use Quadratic Probing with C1 = 1 and C2 = 3 2. Given an undirected Graph as below: Explain Kruskal’s algorithm and illustrate applying on the graph given above to determine the minimum Spanning Tree. What is the expected runtime to solve this problem? 3. Given a directed graph as below: Some of the edges are missing on the Graph. ORD to BOS: 1400, BOS to JFK: 150, JFK to BOS: 175 JFK to MIA = 1300, MIA to JFK = 1000, LAX to DFW: 1100 and DFW to MIA is 900 LAX to MIA: 2750, and MIA to LAX = 2300 and DFW to LAX = 1400 and SFO to LAX = 350 and SFO to ORD = 1800 First draw an adjacency matrix using all the edges and vertices. Use Floyd Algorithm to find the D and P matrices using the data given above. Then, determine the shortest distance and shortest path (Using the D and P matrix you obtained by running the program you have developed in homework 5) for the following pairs: a) LAX to JFK b) JFK to LAX c) SFO to MIA d) MIA to ORD You must include the code and the complete work, by giving the two matrices and how you interpret the results. 4. Given the directed Graph as below. Assuming P as the source, determine the single source shortest path (Dijkastra algorithm). Do this work without any computer program. Trace the Path from P to each of the other vertices after completing the tables. 5. Use the Prim’s algorithm Computer Program to determine the minimum spanning tree for the graph shown below. Draw the MST. Must include the computer program along with your results (output from the code). Note: All the problems should be included in one file. All programs must be typed and run. No credits for handwritten codes. TAKE HOME TEST: CS 425 (THEORY OF ALGORITHMS) [DUE: MONDAY 9 AM] Each question must be answered carefully and giving detail. Any duplicate work with another classmate will result 0 credit for both. 1. Given the following keys: 36, 87, 124, 887, 58, 268 a) Determine the h(k) values using h(k) = k mod m Given hash table size is 11 b) Construct the hash table. Show your work. Use Quadratic Probing with C1 = 1 and C2 = 3 2. Given an undirected Graph as below: Explain Kruskal’s algorithm and illustrate applying on the graph given above to determine the minimum Spanning Tree. What is the expected runtime to solve this problem? 3. Given a directed graph as below: Some of the edges are missing on the Graph. ORD to BOS: 1400, BOS to JFK: 150, JFK to BOS: 175 JFK to MIA = 1300, MIA to JFK = 1000, LAX to DFW: 1100 and DFW to MIA is 900 LAX to MIA: 2750, and MIA to LAX = 2300 and DFW to LAX = 1400 and SFO to LAX = 350 and SFO to ORD = 1800 First draw an adjacency matrix using all the edges and vertices. Use Floyd Algorithm to find the D and P matrices using the data given above. Then, determine the shortest distance and shortest path (Using the D and P matrix you obtained by running the program you have developed in homework 5) for the following pairs: a) LAX to JFK b) JFK to LAX c) SFO to MIA d) MIA to ORD You must include the code and the complete work, by giving the two matrices and how you interpret the results. 4. Given the directed Graph as below. Assuming P as the source, determine the single source shortest path (Dijkastra algorithm). Do this work without any computer program. Trace the Path from P to each of the other vertices after completing the tables. 5. Use the Prim’s algorithm Computer Program to determine the minimum spanning tree for the graph shown below. Draw the MST. Must include the computer program along with your results (output from the code). Note: All the problems should be included in one file. All programs must be typed and run. No credits for handwritten codes.