java

all about recursion and reflection

many thanks

1.Write a recursive method to add up the integers from 1 to N (where N is passed in as a parameter).

2.Write a recursive method to add up the contents of an array of doubles.

3.The Towers of Hanoi problem (Google it!) can be solved by the following recursive algorithm ...

if you want to move only one disk { just do it, and print the move } else if you want to move N disks { move N-1 disks from the "from" pile to the "spare" pile move one disk from the "from" pile to the "to" pile move N-1 disks from the "spare" pile to the "to" pile

Write a recursive Java method to implement this algorithm.

4.Does the following recursive method get into infinite recursion? Why?

public static void doNumbers(int number) { System.out.println(number); if (number % 2 == 0) { doNumbers(--number); } else { doNumbers(number/2 + 1); } } 

5.What is the output when the display method of an object created from this class is called?

//============================================================================= public class Beano { //----------------------------------------------------------------------------- private String name; //----------------------------------------------------------------------------- public Beano() { this.name = "Beano"; } //----------------------------------------------------------------------------- public String toString() { return(name); } //----------------------------------------------------------------------------- public void display() { System.out.println("I say " + this + " " + getClass().getName() + " Beano"); } //----------------------------------------------------------------------------- } //============================================================================= 

6.What's the output from the following program?

[an error occurred while processing this directive]

7.Write an if statement that prints "I'm a snob" if the current object is an instance of the Upper class.