1) The study of algorithms is becoming less important as computers become faster

Select one:

True or False

2) Select all true statements about divide and conquer algorithms from below.

Select one or more:

- Are always the fastest running algorithms

- Order of growth of run time is analysed by adding the cost of each line multiplied by the number of times it will execute

- The algorithm is called recursively on subset(s) of the input

- Can only be used with small input

- Order of growth of run time is analysed by solving the recurrence

3) Is the correct big theta classification of n³ + n+ 4 = (n³) ?

Select one:

True or False

Screenshot 2021-02-08 at 16.10.50 Screenshot 2021-02-08 at 16.11.18 Screenshot 2021-02-08 at 16.12.40 Screenshot 2021-02-08 at 16.17.05 Q Search Use the Master method (cases listed below) to solve the recurrence: T( n ) = 2 ( n/4 ) + n^2 Master method cases: 1. If f(n) = O(nlogo(a)-c) for some constant e > 0, then T(n) = ( nlogb(a)) 2. If f(n) = (nlogb(a)), then T(n ) = ( nlog(a) Ig n) 3. Iff(n) = 2(nlogb(a)+E) for some constant > 0, and if af n/b) s cf(n) for some constant c