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…

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…

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.

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…

Write factorial1 function in python 3.8 follow the directions provided below, don't need anything else as long as it meets all the requirements below. Function: factorial1 The function implements an iterative factorial. It takes an integer n as argument and returns n! The method needs to be computed interactively (not recursively

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) {   }

1. What is the difference between an iterative algorithm and a recursive algorithm? 2. What is a recursive algorithm’s base case? What is the recursive case? 3. What is the base case of each of the recursive methods listed in Algorithm Workbench 3, 4, and 5? 4. What type of recursive method do you think would be more difficult to debug: one that uses direct recursion or one that uses indirect recursion? Why? 5. Which repetition approach is less efficient: a loop or a recursive method? Why? 6. When recursion is used to solve a problem, why must the recursive method call itself to solve a smaller version of the original problem? 7. How is a problem usually reduced with a recursive method?

Exercise-3: Write a recursive and iterative methods to convert a decimal number to its binary equivalent string. The iterative algorithm (in pseudo-code) for converting a decimal integer into a binary integer as follows: 1. If the integer is 0 or 1, its binary equivalent is 0 or 1. 2. If the integer is greater than or equal to 2 do the following: 3. Divide the integer by 2. 4. Separate the result into a quotient and remainder. 5. Divide the quotient again and repeat the process until the quotient is zero. 6. Write down all remainders in reverse order as a string. 7. This string is the binary equivalent of the given integer. // Recursive decimal to binary method public static String dec2binRecursive(int n) { if (n<2) return n+ " ". else return dec2binRecursive(n/2) + n%2; } a) Write the Complete program for above Recursive decimal to binary method Algorit b) Iterative decimal to binary method

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 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.

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

1. Let product(n,m) be a recursive addition-subtraction method for multiplying two positive integers. Recursive cases for m = 1 and m < 1 make this method. The return value should be n plus a recursive product() call with n and m - 1. Test a Java method.

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

Ex. 01 : Recursion About So far, we have learned that we can perform repetitive tasks using loops. However, another way is by creating methods that call themselves. This programming technique is called recursion and, a method that calls itself within it's own body is called a recursive method. One use of recursion is to perform repetitive tasks instead of using loops, since some problems seem to be solved more naturally with recursion than with loops. To solve a problem using recursion, it is broken down into sub-problems. Each sub-problem is similar to the original problem, but smaller in size. You can apply the same approach to each sub-problem to solve it recursively. All recursive methods use conditional tests to either 1. stop or 2. continue the recursion. Each recursive method has the following characteristics: 1. end/terminating case: One or more end cases to stop the recursion. 2. recursive case: reduces the problem in to smaller sub-problems, until it reaches (becomes) the end…

- use Eclipse or Netbeans to create a project. - In the new created project, create a recursive method to implement the following formula : a​1​​ = 3​ a​n​ = 4 a​n−1​​ +1, for n  ≥ 2​​     ​​- Use the main method to test the recursive method for various values of n like : for n=1, n=2, n=3, n= 10; - write the same method but in sequential form (not Recursive). And compare between results for the same values of n.   using java (data structure )

Searching and Sorting  Sort a singly linked sequential list using selection sort algorithm. Sort a DOUBLY linked sequential list using insertion sort algorithm. Implement binary search algorithm RECURSIVELY.Instructions Complete the following methods on Searching and Sorting.  You may use any language must be Java or Python to complete the tasks. If you are using JAVA, you must include the Tester class containing the main method which should test your other methods. If you are using PYTHON, make sure your code has the methods invoked through test statements. Usage of built in methods/libraries are NOT ALLOWED

Exercise 4 (class Ackermann) The Ackermann recursive function is defined as follows: n +1 А(т - 1,1) A(m – 1, A(m, n – 1)) if m> 0 and n > 0. if m %3D А(т, п) — if m > 0 and n = 0 Its arguments are never negative and it always terminates. Write a Java method which returns the value of A(m,n). Write the following code fragment inside the main method to test Ackermann function and report what will happen. for (m = 0; m <= 4; m++) for (n = 0; n < 6 - m; n++) System.out.printf("A(%d, %d) = %d\n", m, n, ackermann(m, n));

Python RecursionAssignment: No loops or string functions allowed

please code in python Forbidden concepts: recursion, custom classes Create a program that asks for a person’s name and sex (male, female, or other). Use a killswitch to see when the user is done entering everyone. Once completed, the program must print out all the male names, then female names, and then the others.

Java source code writing - a recursive algorithm. Please use non-recursive and recursive ways to compute the nth Harmonic number, defined as H. Turn in your java source code file with three methods, including one main() method.

Task 1 Count the number of vowels in a phrase using recursion only. You can think of this problem as "I can count the number of vowels in this phrase by counting the number of vowels in the first character, then counting the number of vowels in the rest of the phrase." We define a vowel as being A, E, I, O or U. This is one of those problems that can just as easily be solved with traditional programming structures such as a loop - but we're asking you to use recursion for the exercise. Consider: what replaces the loop structure? When will we stop recursion? Task 2 The constant e (Euler's number) is approximated by the following sequence: 1₁ n! where the number of terms in the sequence is sufficient to generate the required precision in decimal places. 1+ 2! + ... We say that there is some value epsilon (e) such that, when the change in the approximation from one term to the next is less than said epsilon, we have reached sufficient precision. That is, when the term you're proposing to…

JAVA: Rewrite the following recursive method using an iterative approach with a while loop.

Java programming language Write a recursion method to sum the odd numbers a) from 100 to 0 b) from 0 to 100 and then test it.

How to solve the problem by FOLLOWING this python code format? 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:    return  [list[0]] +…

create a java program that uses main methods on recursion algorithm. A recursion algorithm or program is a repetition control structure that is an alternative way to loops.

In Java -  Implementing Recursion to Provide a Product Using recursion, create a program that will allow a user to enter five numbers. The program will provide the product of all five numbers using recursive methods.

Design and implement a recursive program that solves the Nonattacking Queens problem. That is, write a program to determine how eight queens can be positioned on an eight-by-eight chessboard so that none of them is in the same row, column, or diagonal as any other queen. There are no other chess pieces on the board. Design and implement a recursive program that solves the Nonattacking Queens problem. That is, write a program to determine how eight queens can be positioned on an eight-by-eight chessboard so that none of them is in the same row, column, or diagonal as any other queen. There are no other chess pieces on the board. Design and implement a recursive program that solves the Nonattacking Queens problem. That is, write a program to determine how eight queens can be positioned on an eight-by-eight chessboard so that none of them is in the same row, column, or diagonal as any other queen. There are no other chess pieces on the board.

Personal project Q5. This question is concerned with the design and analysis of recursive algorithms. You are given a problem statement as shown below. This problem is concerned with performing calculations on a sequence A of real numbers. Whilst this could be done using a conventional loop-based approach, your answer must be developed using a recursive algorithm. No marks will be given if your answer uses loops. FindAverageAndProduct(a1, ...., an) such that n > 1 Input: A sequence of real values A = (a1, ...., an) Output:, A 2-tuple (average, product) containing the average (average) of all the values and the product (product) of all the values of the elements in A. Your recursive algorithm should use a single recursive structure to find the average and product values, and should not use two separate instances of a recursive design. You should not employ any global variables. (a) Produce a pseudo code design for a recursive algorithm to solve this problem. (b) Draw a call-stack…

АСTIVITY 3 RECURSION Instructions: Use any size of bond paper. Write your name, course and year, date in your answer sheets. Use ALL CAPS. I. Recursion: Prove the following using recursion. 1. Ifg is defined recursively by g(0) = 3 and g(n + 1) = 2" – n. Find g(1), g(3), g(5), g(7) and g(9)

Using JAVA  Recursive Power Method Write a method called powCalthat uses recursion to raise a number to a power. The method should accept two arguments: The first argument is the exponentand the second argument is the number to be raised(example”powCal(10,2)means2^10). Assume that the exponent is anonnegative integer. Demonstrate the method in a program called Recursive  (This means that you need to write a program that has at least two methods: mainand powCal. The powCal method is where you implement the requirements above and the main method is where you make a method call to demonstrate how your powCalmethod work).

C# Write a recursive method called Power(base, exponent) that, when called, returns  base exponent . For example, Power ( 3, 4 ) = 3 * 3 * 3 * 3.  Assume that exponent is an integer greater than or equal to 1.  The recursion step should use the relationship: base exponent = base * base exponent – 1 The terminating condition occurs when exponent is equal to 1 because base 1 = base Incorporate this method into an application that enables the user to enter the base and exponent.   Requirements: In the Main() method, declare three arrays of long data types:  baseNumbers, exponents, and results.  Each array should be created to hold exactly 5 members. Using a FOR loop, populate the baseNumbers array with random integers between 1 and 50 and populate the exponents array with random integers between 1 and 10.  Use a random number generator to create these random numbers. Using another FOR loop, call the Power method, passing it a member of the baseNumbers array and a member of the exponents…

RECURSIVE PYTHON The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci(7) is 13 Note: Use recursion and DO NOT use any loops.   # TODO: Write recursive fibonacci() functiondef fibonacci(): if __name__ == "__main__":    start_num = int(input())    print('fibonacci({}) is {}'.format(start_num, fibonacci(start_num)))

Alert dont submit AI generated answer. Write Java program with a recursive method called evenfact(N) which takes in a number N and returns the factorial of the even numbers between the given number N and 2.

Part 2. Trace the recursion and observe the recursive solution provided below. a) Which line(s) of this program define(s) the base case of myMethod() method? b) Which line(s) of this program include recursive call(s)? c) Trace the recursion below. You must show the trace step by step, otherwise – little to no credit. 1 public class Test 2 { 3 public statice void main(String [ ] args) 4 { 5 System.out.println( myMethod(3, 6) ); 6 } 7 public static int myMethod(int a, int b) 8 { if (a==b) 10 else if (a > b) 9. return b; 11 12 return myMethod(a-1, b) + 1; 13 else 14 return myMethod(a, b-1) - 1; 15 } 16 } d) At what step of your recursion tracing did you hit the base case? e) What is the final output of this code?

How can I apply this python code? 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:    return  [list[0]] + Sieve_of_Eratosthenes(removeMultiples(list[0],…