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
1)      Why space complexity is comparatively more critical than time complexity? 2)      Determine the space complexity of Euclid Algorithm?

Depth-first traversal A depth-first traversal of a tree visit a node and then recursively visits the subtrees of that node. Likewise, depth-first traversal of a graph visits

In this unit, we have learned how the stacks are implemented using arrays and using liked list. Also, the advantages and disadvantages of using these two schemes were discussed. Fo

Explain the Arrays in Ruby Ruby arrays are dynamic arrays which expand automatically whenever a value is stored in a location beyond current end of the array. To the programmer

Ruby implements Range of T Abstract data type Ruby implements Range of T ADT in its Range class. Elements of carrier set are represented in Range instances by recording interna

floyd warshall algorithm

1) preorder, postorder and inorder 2) The main feature of a Binary Search Tree is that all of the elements whose values is less than the root reside into the nodes of left subtr

Q. Enumerate number of operations possible on ordered lists and arrays.  Write procedures to insert and delete an element in to array.

Double Linked List In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of t

Illustrates the program for Binary Search. Program: Binary Search /*Header Files*/ #include #include /*Functions*/ void binary_search(int array[ ], int value,