Calculate the k-th power and recursive algorithem, Data Structure & Algorithms

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 + n2 + n3 + n4

d) n3

e) n5 log n

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

a) 50n3 + n2 + log n + n +10000

b) 2n5 +100n2 +1000log n

c) 200n + n2 log n

d) 10log n + n2 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







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
Related Questions
Explain Backtracking The  principal idea is to construct solutions single component  at a time  and evaluate such  partially constructed candidates as follows. If a partiall

Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.

The objective analysis of an algorithm is to determine its efficiency. Efficiency is based on the resources which are used by the algorithm. For instance, CPU utilization (Ti

This algorithm inputs number of hours of sunshine recorded every day for a week (7 days). Output is the highest value for hours of sunshine and average (mean) value for numbers of

What are expression trees?  The leaves of an expression tree are operands, like as constants or variable names, and the other nodes have operators. This certain tree happens to

Searching is the procedure of looking for something: Finding one piece of data that has been stored inside a whole group of data. It is frequently the most time-consuming part of m

1. develop an algorithm which reads two decimal numbers x and y and determines and prints out wether x>y or y>x. the input values, x and y, are whole number > or equal to 0, which

By taking an appropriate example explain how a general tree can be represented as a Binary Tree.                                                                    C onversio

What is an algorithm?  What are the characteristics of a good algorithm? An algorithm is "a step-by-step process for accomplishing some task'' An algorithm can be given in many

b) The user will roll two (six-sided) dices and the user will lose the game if (s)he gets a value 1 on either any of the two dices & wins otherwise. Display a message to the user w