In this activity we talk about the concepts and definition of computational complexity

1.-Write the definitions of O-big and O-small and explain them concisely using your own words

2.-From the following list of functions indicate, only, the order of complexity (or large) to which they belong.

a) 3x2+5x

b) 5x2+3x3+5

c) log(x)

d) 2x+100x50

e) 5exp(x2)

3.-Determine the order of complexity using for the following functions. You have to show the value of c for which it is true that g(x)cf(x)

a) 4x

b) 3x2+2x+1

c) 5x4+3x2

4.-If we have an algorithm A1 whose complexity is O(3n3) and A2 is an algorithm whose complexity is O(5n3) . If we execute them sequentially A=A1A2 , what is the complexity associated with algorithm A ?