Java_Project_6_answers

JAVA  Question 2: For two integers m and n, their GCD (Greatest Common Divisor) can be computed by a recursive method. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Method body: If m is 0, the method returns n. If n is 0, the method returns m. If neither is 0, the method can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n (or m % n). The recursive method cannot have loops. Note: although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. main method: Prompt and read in two numbers to find the greatest common divisor. Call the gcd method with the two numbers as its argument. Print the result to the monitor.   Example program run: Enter m: 12 Enter n: 28 GCD(12,28) = 4 And here is what I have so far, package CSCI1302;import java.util.*;public class RecursionDemo {    public static void…

Determine whether a string is a palindromeA palindrome is a string of characters that reads the same from right to left as it does from left to right, regardless of punctuation and spaces.The specifications for this assignment are: •Write and test a non-recursive solution in Java that determines whether a string is a palindrome •Your program should consist of at least two methods: (1) the main method (2) the method which performs the task of determining whether the specified string is a palindrome. You should name this method isPalindrome. You should name the class that contains your “main” method and the isPalindrome method FindPalindrome. •You must use a Stack and a Queue in your solution: Write your own Stack and Queue based on the Vector in the Java API and use those in your solution. You should name those classes StackVector and QueueVector respectively. You already have access to the relevant exception classes and interfaces for the above ADTs. •All of your belong to a Java…

Java - When the compiler compiles your program, how is a recursive call treated differently than a non-recursive method call? What property of fractals lends itself to recursive thinking?

write a code in java (using recursion)

Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println ("Method call "calculating "Factorial of: " + n); Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return (factorial(n - 1) * n); c. Add these lines in the recursive section: temp - factorial (n - 1) ; System.out.println ("Factorial of: " + (n - 1) + " is " + temp); return (temp * n); 3. Rerun the program and note how the recursive calls are built up on the run-time stack and then the values are calculated in reverse order as the run-time stack "unwinds".

import java.util.Scanner; public class LabProgram {      // Recursive method to draw the triangle    public static void drawTriangle(int baseLength, int currentLength) {        if (currentLength <= 0) {            return;  // Base case: stop when currentLength is 0 or negative        }         // Calculate the number of spaces needed for formatting        int spaces = (baseLength - currentLength) / 2;         if (currentLength == baseLength) {            // If it's the first line, don't output spaces before the first '*'            System.out.println("*".repeat(currentLength) + " ");        } else {            // Output spaces and asterisks            System.out.println(" ".repeat(spaces) + "*".repeat(currentLength) + " ");        }         // Recursively call drawTriangle with the reduced currentLength        drawTriangle(baseLength, currentLength - 2);    }        public static void drawTriangle(int baseLength) {        drawTriangle(baseLength, baseLength);    }     public static…

import java.util.Scanner; public class LabProgram {      // Recursive method to draw the triangle    public static void drawTriangle(int baseLength, int currentLength) {        if (currentLength <= 0) {            return;  // Base case: stop when currentLength is 0 or negative        }         // Calculate the number of spaces needed for formatting        int spaces = (baseLength - currentLength) / 2;         if (currentLength == baseLength) {            // If it's the first line, don't output spaces before the first '*'            System.out.println(" ".repeat(spaces) + "*".repeat(currentLength));        } else {            // Output spaces and asterisks            System.out.println(" ".repeat(spaces) + "*".repeat(currentLength));        }         // Recursively call drawTriangle with the reduced currentLength        drawTriangle(baseLength, currentLength - 2);    }     public static void drawTriangle(int baseLength) {        drawTriangle(baseLength, baseLength);    }     public…

Do not use static variables to implement recursive methods.  USING JAVA 1.  Using Big Oh notation, indicate the time requirement for each of the following tasks in the worst case. Describe which operations are assumed to take constant time to. After arriving at a party, you shake hands with each person there. n is the number of persons in the party. Each person in a room shakes hands with everyone else in the room. n is the number of persons in the room. You climb a flight of stairs. n is the number of stairs After entering an elevator, you press a button to choose a floor. n is the number of floors You ride the elevator from the ground floor up to the nth floor. You read a book twice. n is the number of pages in the book Using Big Oh notation, indicate the time requirement of each of the following tasks in the worst case. Display all the integers in an array of integers. Display all the integers in a chain of linked nodes. Display the nth integer in an array of integers. Compute…

Demonstrate Recursion Assignment Instructions Overview The programs we’ve discussed so far are generally structured as methods that call one another in a hierarchical manner. For some problems, it’s useful to have a method call itself—this is known as a recursive method. Such a method can call itself either directly or indirectly through another method. Recursion is an important topic discussed at length in upper-level computer-science courses. Instructions Write a recursive method printArray() that displays all the elements in an array of integers, separated by spaces. The array must be 100 elements in size and filled using a for loop and a random number generator. The pseudo-code for this is as follows:   //Instantiate an integer array of size 100 //fill the array For (int i=0; i<array.length; i++) Array[i] = random number between 1 and 100 inclusive printArray(integer array);   For this assignment make sure that your screen shots show your program running and that your runtime…

solve q6 only please

solve q5 only please

Question 5 When writing a recursive method, O you do not need to know ahead of time exactly how many levels of recursion will occur. O you must keep count of how many recursion call levels you have traversed. O you must make sure the method does not take any input parameters.

Java code Screenshot and output is must

write a code in java (using recursion)

Do not use static variables to implement recursive methods.  USING JAVA USING: // P5         public static long computePay(int day) {         } You have been offered a job that pays as follows: On the first day, you are paid 1 cent, on the second day, 2 cents, on the third day, 4 cents and so on. In other words, your pay doubles every day. Write a recursive method computePay that for a given day number computes the pay in cents.    Assume that you accumulate all the money that you are paid. Write a recursive method computeSavings that computes the sum that you have accumulated on a given day. Show the output of computePay and computeSavings for day number 39.

please help me with the following 1) make a sierpenski triangle using java and recursion. Make it similar to the code below. And please comment the code 2) Please make the follow code out put on the console. It a t square fractal  import java.awt.image.*;import java.awt.Color;import java.io.*;import javax.imageio.*; public class Main{   static final int DIMENSION = 1000;       static BufferedImage image = new BufferedImage(DIMENSION, DIMENSION, BufferedImage.TYPE_INT_RGB);   static final int WHITE = Color.WHITE.getRGB();   static final int BLACK = Color.BLACK.getRGB();    private static void drawSquare(int x, int y, int side)      {      if (side <= 0)         return;      else      {                  int left = x - side/2;         int top  = y - side/2;         int right = x + side/2;         int bottom = y + side/2;                   for (int i = left; i < right; i++)           for (int j = top; j < bottom; j++)           {              image.setRGB(i, j, BLACK);           }…

Written explaination required

Java language Write a recursive method to add all of the odd numbers between two numbers (start and end) and return the result. The method receives these numbers as parameters.

java program

PLZ help with the followig IN JAVA Pick the best answer Recursive methods may include a recursive call Recursive methods may not use iteration Recursive methods must include a recursive call none of the above

Pascal's triangle is a useful recursive definition that tells us the coefficients in the expansion of the polynomial (x + a)^n. Each element in the triangle has a coordinate, given by the row it is on and its position in the row (which you could call a column). Every number in Pascals triangle is defined as the sum of the item above it and the item above it and to the left. If there is a position that does not have an entry, we treat it as if we had a 0 there. *picture of the pascals triangle* Given the following recursive function signature, write the recursive function that takes a row and a column and finds the value at that position in the triangle. Assume that the triangle starts at row 0 and column 0. Examples: pascal(2, 1) -> 2,  pascal(1, 2) -> 0   public int pascal(int row, int column) {   }

solve q4 only please

How to apply this python code in the problem? What are the base cases and recursive cases that should be used? def createList(n):    #Base Case/s    #TODO: Add conditions here for your base case/s    #if <condition> :        #return <value>      #Recursive Case/s    #TODO: Add conditions here for your recursive case/s    #else:        #return <operation and recursive call>     #remove the line after this once you've completed all the TODO for this function    return [] def removeMultiples(x, arr):      #Base Case/s    #TODO: Add conditions here for your base case/s    #if <condition> :        #return <value>      #Recursive Case/s    #TODO: Add conditions here for your recursive case/s    #else:        #return <operation and recursive call>     #remove the line after this once you've completed all the TODO for this function    return []   def Sieve_of_Eratosthenes(list):  #Base Case/s  if len(list) < 1 :    return list  #Recursive Case/s  else:…

Java - Number Pattern

Please help me with the tasks below using java

I want solution with step

Using Java programming write a recursive function that accepts two arguments into the parameters x and y. The function should return the value of x times y. Remember, multiplication can be performed as repeated addition as follows: 7 * 4=4+4+4+4+4+4+4

9. Ackermann's Function Ackermann's function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Write a method ackermann (m, n), which solves Ackermann's function. Use the following logic in your method: If m = 0 then return n + 1 If n = 0 then return ackermann (m Otherwise, return ackermann(m 1, 1) 1, ackermann (m, n - 1))

Recursion is the best and the fastest way to solve any problem.True or False