# Assignment  3 – More Recursion and Queues Solved

25.00 \$

Category:
Click Category Button to View Your Next Assignment | Homework

You'll get a download link with a: . ` zip` solution files instantly, after Payment

## Description

Write pseudo-code not Java for problems requiring code. You are responsible for the appropriate level of detail.

Q1 and Q2 are intended to help you get comfortable with recursion by thinking about something familiar in a recursive manner. Q3 – Q4 are practice in working with nontrivial recursive functions. Q5 and Q6 deal with the idea of conversion between iteration and recursion.

1. Write a recursive algorithm to compute a+b, where a and b are nonnegative integers.

1. Let A be an array of integers. Write a recursive algorithm to compute the average of the elements of the array. Solutions calculating the sum recursively, instead of the average, are worth fewer points.
2. A generalized Fibonacci function is like the standard Fibonacci function,, except that the starting points are passed in as parameters. Define the generalized Fibonacci sequence of f0 and f1 as the sequence gfib( f0, f1, 0), gfib(f0, f1, 1), gfib(f0, f1, 2), …, where

gfib(f0, f1, 0) = f0 gfib(f0, f1, 1) = f1

gfib(f0, f1, n) = gfib(f0, f1, n-1) + gfib(f0, f1, n-2) if n> 1

Write a recursive method to compute gfib(f0,f1,n).

1. Ackerman’s function is defined recursively on the nonnegative integers as follows:

a(m, n) = n + 1                               if m = 0

a(m, n) = a(m-1, 1)                        if m  0, n = 0 a(m, n) = a(m-1, a(m, n-1))           if m  0, n  0

Using the above definition, show that a(2,2) equals 7.

1. Convert the following recursive program scheme into an iterative version that does not use a stack. f(n) is a method that returns TRUE or FALSE based on the value of n, and g(n) is a method that returns a value of the same type as n (without modifying n).

int rec(int n)

{

if ( f(n) == FALSE ) {

/* any group of statements that  do not change the value of n */         return (rec(g(n)));

}//end if     return (0); }//end rec

1. Develop an ADT specification for a priority queue. A priority queue is like a FIFO queue except that items are ordered by some priority setting instead of time. In fact, you may think of a FIFO queue as a priority queue in which the time stamp is used to define priority.
• Module-3.zip