Practice Problem Help for Unit 10: Algorithms

Problem 1 - Traveling Salesman Problem (TSP)

Problem 2 - Critical Path Method

a. Find all the paths from Start to Finish.

b. Find the length of each path found in part a.

c. Determine which path is the critical path.

d. Assuming all tasks on the critical path are done on time, what is the earliest finishing time of this project?

Recommended: Identify the LONGEST path because that is the critical path and it deetermines the shortest amount of time for project completion.

Problem 3 - Binary Search Algorithm

Use these lessons from Khan Academy to better understand binary search.

Problem 4 - Linear Search Algorithm

Use these lessons from Code.org and this short (3 min) video to better understand linear search.

For the "second problem 4" question, refer to page 7 of this PDF for answers.

Problem 5 - Speedup Calculation with Parallel Processing

To calculate the "speedup" simply divide the Time for sequential processing (T_seq) by the Time for parallel execution time (T_par).

In this case that is 120 / 50 = 2.4

Problem 6 - Sequential and Parallel Execution Times