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
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
Thus far, we have been considering sorting depend on single keys. However, in real life applications, we may desire to sort the data on several keys. The simplest instance is that

Determine YIQ Colour Model Whereas an RGB monitor requires separate signals for the red, green, and blue components of an image, a television monitor uses a single composite si

#What is the pointer

Define Merge Sort  Merge sort is a perfect example of a successful application of the divide and conquer method. It sorts a given array A[0...n-l] by separating it into two ha

Complexity is the rate at which the needed storage or consumed time rise as a function of the problem size. The absolute growth based on the machine utilized to execute the program

Here,  m represents the unordered array of elements n  represents number of elements in the array and el  represents the value to be searched in the list Sep 1: [Initialize]

Insertion: Records has to be inserted at the place dictated by the sequence of keys. As is obvious, direct insertions into the main data file would lead to frequent rebuilding of

How sparse matrix stored in the memory of a computer?

QUESTION (a) Construct a binary tree for the following numbers assuming that a number greater than the node (starting from the root) goes to the left else it goes to the right.

Suppose we have a set of N agents and a set of N tasks.Each agent can only perform exactly one task and there is a cost associated with each assignment. We would like to find out a