(Solved) : Metropolitan State University Saint Paul Minnesota Ics 140 Computational Thinking Programm Q37288867 . . .
Metropolitan State University, Saint Paul, Minnesota ICS 140 Computational Thinking with Programming Lab 11 In this lab, you will empirically compare Follow the steps given below 1. Download Labll.zip from D2L 2. Unzip the file. 3. Examine the DInine the unvipped folder. You should see L1lpy h t. Open the fie L1 py in IDLE 4. Note that the above file contains implementations of sequential search and binary search. You will use the techniques. program to compare the performance of the se two search Run the code a few times and see what is going on. The program determines the execution times for binary search and sequential search for different lists Evaluate the algorithms. starting interaction. ( 5. 6. After starting the program, give the values as in the following interaction. The list sizes number of iterations may need to be adjusted to ensure that the executions end in a reasonable amount of time.) Enter start list size: 100000 Enter end list size: 200000 Enter list size increment: 10000 Enter number of iterations for sequential search: 100 Enter number of iterations for binary search: 1000 Now that you probably have a fair idea of what the program is doing, do some more evaluations to investigate the following issues. 7. a) How do the execution times for the two algorithms compare for “small’ lsts? They take almost equal time iSequential search appears faster ii. Binary search appears faster b) Which algorithm would you employ for “small’ lists? e) What happens to the execution time for sequential search as the list size grows? i. It takes more time, but the time is proportional to the list size ii. It takes more time, but the increase is very slow iv. It takes more time, and the increase is exponential It takes less time FS F1O d) What happens to the execution time for binary search as the list size grows i. It takes more time, but the time is proportional to the lest size It takes less time It takes more time, but the increase is very slow iv. It takes more time, and the increase is exponential e) How do the execution times for the two algorithms compare for “large” Tists? i. They take almost equal time ii. Sequential search appears faster iii. Binary search appears faster 8. Which algorithm would you employ for “large” lists? 9. Show your instructor supporting results for your answers to the above questions. 10. Get your instructor’s signature here. sequeria Show transcribed image text Metropolitan State University, Saint Paul, Minnesota ICS 140 Computational Thinking with Programming Lab 11 In this lab, you will empirically compare Follow the steps given below 1. Download Labll.zip from D2L 2. Unzip the file. 3. Examine the DInine the unvipped folder. You should see L1lpy h t. Open the fie L1 py in IDLE 4. Note that the above file contains implementations of sequential search and binary search. You will use the techniques. program to compare the performance of the se two search Run the code a few times and see what is going on. The program determines the execution times for binary search and sequential search for different lists Evaluate the algorithms. starting interaction. ( 5. 6. After starting the program, give the values as in the following interaction. The list sizes number of iterations may need to be adjusted to ensure that the executions end in a reasonable amount of time.) Enter start list size: 100000 Enter end list size: 200000 Enter list size increment: 10000 Enter number of iterations for sequential search: 100 Enter number of iterations for binary search: 1000 Now that you probably have a fair idea of what the program is doing, do some more evaluations to investigate the following issues. 7. a) How do the execution times for the two algorithms compare for “small’ lsts? They take almost equal time iSequential search appears faster ii. Binary search appears faster b) Which algorithm would you employ for “small’ lists? e) What happens to the execution time for sequential search as the list size grows? i. It takes more time, but the time is proportional to the list size ii. It takes more time, but the increase is very slow iv. It takes more time, and the increase is exponential It takes less time
FS F1O d) What happens to the execution time for binary search as the list size grows i. It takes more time, but the time is proportional to the lest size It takes less time It takes more time, but the increase is very slow iv. It takes more time, and the increase is exponential e) How do the execution times for the two algorithms compare for “large” Tists? i. They take almost equal time ii. Sequential search appears faster iii. Binary search appears faster 8. Which algorithm would you employ for “large” lists? 9. Show your instructor supporting results for your answers to the above questions. 10. Get your instructor’s signature here. sequeria
Expert Answer
Answer to Metropolitan State University, Saint Paul, Minnesota ICS 140 Computational Thinking with Programming Lab 11 In this lab,…
OR