b lI c I and II d Il and IlI 20 In bigOh notation doubling t

b) lI c) I and II d) Il and IlI 20) In big-Oh notation, doubling the suppose an algorithm requires an o a) It doubles the number of visits. b) It quadruples the nur c) It triples the number d) It number of visits g 21) What is S. a factor of eight. of a) 6 b)5 d) 3 22) How large does n need to be so en\' is greater than 2.5n-3? a) 3 b) 5 d) 9 6

Solution

We will start evaluating the given exprssion (n2 > 3n + 4) by putting all the given options one by one into the expression and then we will see the output.

1. 6

So when we replace n=6 in our expression, let\'s see what we get.

62 > 3*6 +4 --> 36 > 18 +4 --> 36> 22

the above equation stands true as 36 is greater than 22.

2. 5

So when we replace n=5 in our expression, let\'s see what we get.

52 > 3*5 +4 --> 25 > 15 +4 --> 25> 19

the above equation stands true as 25 is greater than 19.

3. 4

So when we replace n=4 in our expression, let\'s see what we get.

42 > 3*4 +4 --> 16 > 12 +4 --> 16> 16

the above equation stands false as 16 is not greater than 16 but it is equal to 16.

4. 3

So when we replace n=3 in our expression, let\'s see what we get.

32 > 3*3 +4 --> 9 > 9 +4 --> 9> 13

the above equation stands false as 9 is not greater than 13.

So as we saw, the above equation stands true onlt for 2 conditions where n=6 and n=5.

And smaller of them is 5.

So the answer is 5.

 b) lI c) I and II d) Il and IlI 20) In big-Oh notation, doubling the suppose an algorithm requires an o a) It doubles the number of visits. b) It quadruples th

Get Help Now

Submit a Take Down Notice

Tutor
Tutor: Dr Jack
Most rated tutor on our site