You will complete exercises [url removed, login to view] and [url removed, login to view] in the book (Algorithms by Robert Sedgewick and Kevin Wayne)
((([url removed, login to view] Worst Case (Dijkstra). Describe a family of graphs with V vertices and E edges for which the worst-case running time of Dijkstra's algorithm is achieved.
[url removed, login to view] Worst Case (Bellman-Ford). Describe a family of graphs for which ALGORITHM 4.11 (page 674) takes time proportional to VE.)))
I want you to use the scientific method as described in Chapter 1, Section 4 of the book on page 172 to do this. Break down your approach as follows:
Observe: Come up with an answer. This can be done mathematically, heuristically, however you want, really. This is the "on paper" part of the process. Try to figure out the answer which we will then test.
Hypothesize: Basically, take the answer you came up with and state your hypothesis. That is that a graph having (whatever) properties will meet the criteria of the question.
Predict: This is where you will specify what graphs you will use for testing, the running times you expect, and justify your choices of test cases.
Verify: Program the algorithms and try things out. Run your chosen test cases and verify the the running time is as expected.
Validate: If you get the results you expected you're done. Otherwise, you'll have to start over and figure out what's wrong.
I should mention that of the 90 points, only 10 come from getting the right answers. This assignment is about process. We will be formal and follow the Scientific Method closely for this assignment.
((you can use the code from the book to test and see the result the all thing I need is discussion the process and follow the Scientific Method))