Algorithms Answers

Represent the following function in form of big-oh(O) and omega(Ω) and theta(Ө)  notation. Find the required constants for it.

1. 2n2 + 25nlogn
2. 3 n3 + 4n + 11
3. 5 n3 +  n2 + 3n + 2
4. 2*2n + 6 n2 + 3n
5. 3*n3 – 4n
6. 4n4 + n + n2logn
7. ½ n2 +3n

4n2+7n+3n 3.5

Arrange the following growth functions in increasing order of growth:

       O(n1.5), O(2n), O (nlogn), O(logn), O(n3),  O() ,O(),O()

Prove that max( f(n), g(n) ) = Ө ( f(n) + g(n) )

Write algorithm to find maximum element from array and find its best and worst case time complexity.

Write bubble sort algorithm and analysis it for best case and worst case time complexity using tabular method. Represent the time complexity using Theta(Ө) notation.

Getting the age of participant, if the age is less than or equal to 17 you need to print "sorry

you're not able to join the event", else you need to print "welcome to the event.

Suppose N is a decimal number, where N represents the last 4 digits of your student

id.

i) Convert N to binary.

ii) Convert N to hexadecimal

What is space complexity? Discuss various factors affecting it. Write iterative and recursive algorithm of finding factorial of a given number and find its space complexity.

Explain empirical and theoretical approach for estimating time complexity.

Create a flowchart that will able to read the age of an individual and determine if it qualified to vote or not. The qualifying age to vote is 18 and above. If the age is 18 below, display "too young!". Note that there is no such age as 0 or negative however display "Invalid age" if age is above 100 display "Out of range".