summary know how to use the datetime module to get information about the time it takes to complete an operation in program know how to write an xml file that can be used by the plotting program to plot information about the performance of an algorithm or piece of code understand the definition of big-oh notation and how it establishes an upper bound on the performance of piece of code understand why the list operation is not as efficient as the append operation understand the difference between ( ) ( )and other computational complexities and why those differences are important to us as computer programmers understand theta notation and what an asymptotically tight bound says about an algorithm understand amortized complexity and how to apply it in some simple situations review questions answer these short answermultiple choiceand true/false questions to test your mastery of the how is list like bunch of post office boxes how is accessing an element of list not like retrieving the contents of post office box how can you compute the amount of time it takes to complete an operation in computer using python in terms of computational complexitywhich is betteran algorithm that is ( or an algorithm that is ( ) describein englishwhat it means for an algorithm to be ( when doing proof by inductionwhat two parts are there to the proof if you had an algorithm with loop that executed steps the first time throughthen the second timen the next timeand kept repeating until the last time through the loop it executed stepswhat would be the complexity measure of this loopjustify your answer with what you learned in this assume you had data set of size and two algorithms that processed that data set in the same way algorithm took steps to process each item in the data set algorithm processed each item in steps what would the complexity be of these two algorithms explain why the append operation on list is more efficient than the operator describe an algorithm for finding particular value in list then give the computational complexity of this algorithm you may make any assumptions you wantbut you should state your assumptions along with your algorithm this copy belongs to 'acha