Objective: Given a real world problem, implement the logic and solve the problem using appropriate constructs (sequen- tial, selection, iteration) using an object oriented program- ming language (Java) Problem Description: Write simple java programs to implement the following prob- lems. 1.Find the sum of first 5 numbers (1 to 5) using for loop statement 2.Find the product of first 5 numbers (1 to 5) using while loop statement 3. Generate the multiplication table of 10 upto multiple value 500 4.Calculate the square of first 5 numbers (1 to 5) using do..while statement 5.Find the odd multiples among the first 10 multiples of first 10 numbers

For each problem, please provide i. Describe the worst-case input (the input that would cause the largest running time) Summation used to calculate number of steps for the worst case Explanation of how the code relates to the summation ii. iii. a. (loops require discussing number of iterations and steps per iteration) b. (recursion requires a diagram) A O bound iv.

Give an example of a while loop, then provide the equivalent do-while loop and for loop.  Then give a different example of a do-while loop, along with the equivalent while loop and for loop. Finally, give an example of a for loop, along with the equivalent while loop and do-while loop. Use your examples to illustrate the advantages and disadvantages of each looping structure, and describe those advantages and disadvantages.

The following java code segments causes infinite loop state where the case occurrence and update the code to solve it : int i; int r=2; for(i =1;i>0;i++) { System.out.println(i); ++r; }

2. R(N) is the running time of strange_sum when called on a List of length N. Since this is recursive code, your answer to iii should include a diagram of the recursion tree. a. Answer for li being an ArrayList b. Answer for li being a LinkedList static int strange_sum(List li) { return strange_sum_helper(li, 0, li.size() - 1); static int strange_sum_helper (List arr, int left, int right) { if (right - left < 0) return 0; else if (right else { int mid = (left + right) / 2; return strange_sum_helper(arr, left, mid) left 0) return arr.get(left); == + strange_sum_helper(arr, mid + 1, right); } }

Write a recursive algorithm with the following prototype: int add (int x, int y); that returns x if y is 0; and adds x to y otherwise. THE FUNCTION MUST BE RECURSIVE. (hint: the base case should involve a test for y being 0; recursive case should reduce y towards 0)

use java

Please answer 6 and 7 as they are associated altogether. 6. The FixProgram.java below has some errors.a. Fix the errors so that the program successfully compiles and runs. class FixProgram{ public static void main(String[] args) { System.out.println('Hello World!') }}  7. Change the SampleProgram.java program below.a. So that it displays Programming is fun! Instead of Hello World! class SampleProgram{ public static void main(String[] args) { System.out.println("Hello World!"); }}

Do not copy paste from other experts they are wrong , i will directly downvote .

Using C write a program that uses a recursive function to find the  greatest common divisor  of two integers provided by the user. Example behavior: ./gcd Enter x: 24 Enter y: 32 The GCD of 24 and 32 is 8