1. The following is a recursive algorithm to calculate the k-th power of 2.

Input k a natural number
Output kth power of 2
Algorithem:
If k =0then return 1
Else return 2* power _of_2(k-1)

Please review the decomposition of a recursive algorithm described in slide #17 (week 1, 3-Recursion-IterativeAlgorithms.pdf). Please show the decomposition whne k = 5.

2. Please write an iterative algorithm to calculate the k-th power of 2. This iterative algorithm should be equivalent to the recursive algorithm in question 1.

3. Reorder the following time efficiencies from largest to smallest:

a) nlog n

b) 52

c) n + n² + n³ + n⁴

d) n³

e) n⁵ log n

4. Determine the big-O notations for the following time efficiencies and reorder them from largest to smallest:

a) 50n³ + n² + log n + n +10000

b) 2n⁵ +100n² +1000log n

c) 200n + n² log n

d) 10log n + n² log n +10n4

5. Describe the information flow among DNAs, RNAs, and proteins

Posted Date: 3/13/2013 1:23:35 AM | Location : United States

Ask an Expert

Related Discussions:- Calculate the k-th power and recursive algorithem, Assignment Help, Ask Question on Calculate the k-th power and recursive algorithem, Get Answer, Expert's Help, Calculate the k-th power and recursive algorithem Discussions

Write discussion on Calculate the k-th power and recursive algorithem
Your posts are moderated

Write your message here..

Related Questions

State the range of operation of abstract data type, State the range of oper... State the range of operation of ADT Operations of the Range of T ADT includes following, where a, b ∈ T and r and s are values of Range of T: a...b-returns a range value (an

Reverse order of elements on a slack, Q. Reverse the order of the elements ... Q. Reverse the order of the elements on a stack S    (i) by using two additional stacks (ii) by using one additional queue. Ans :      L e t S be the stac

Dqueue, how can i delete from deque while deletion is restricted from one e... how can i delete from deque while deletion is restricted from one end

Grounded header link list and a circular header link list, What is the diff... What is the difference between a grounded header link list and a circular header link list? A header linked list is a linked list which always having a special node, known as t

Determine the greatest common divisor, Determine the greatest common diviso... Determine the greatest common divisor (GCD) of two integers, m & n. The algorithm for GCD might be defined as follows: While m is greater than zero: If n is greater than m, s

Asymptotic notations, types of asymptotic notations types of asymptotic notations

Algorithm to add an element at the end of linked list, Write an algorithm t... Write an algorithm to add an element at the end of circular linked list.   Algorithm to Add the Element at the End of Circular Linked List. IINSENDCLL( INFO, LINK, START, A

Algorithm, algorithm to search a node in linked list algorithm to search a node in linked list

Determine the algorithm for z-buffer method, Algorithm for Z-Buffer Method ... Algorithm for Z-Buffer Method (a)  Initialize every pixel in the viewport to the smallest value of z, namely z0 the z-value of the rear clipping plane or "back-ground". Store a

Best case, Best Case: If the list is sorted already then A[i] T (n) = ... Best Case: If the list is sorted already then A[i] T (n) = c1n + c2 (n -1) + c3(n -1) + c4 (n -1)  = O (n), which indicates that the time complexity is linear. Worst Case: