Questions (15 points):

a) For each of the following problems, propose the key action/operation you would use to determine the time complexity (short answers are fine here). What is the smallest time complexity of an efficient algorithm solving that problem.

a. Consider an matrice A(. The problem is to ) compute

b. Consider a sequence A containing integers. The problem is to find the number of occurrences of an integer in Sequence A.

c. Given an integer , compute =

d. Given an integer , compute (Product on the n first integers)=

e. Given an integer , convert and display in base 7.

b) Research online and in the textbook what an in-place algorithm is. Use then your own words to explain the definition of an in-place algorithm and provide an example of an algorithm that is in-place.