Write in Java - Make sure the -3 is in the output Write a recursive method called printNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline.

Write in Java - Make sure the -3 is in the output Write a recursive method called printNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter2: Using Data

Section: Chapter Questions

Problem 15PE

See similar textbooks

Similar questions

I need help with fixing this java program as described in the image below: import java.util.Scanner; public class NumberPattern { // TODO: Write recursive printNumPattern() method public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int num1; int num2; num1 = scnr.nextInt(); num2 = scnr.nextInt(); printNumPattern(num1, num2); } }
Write a recursive method called digitCount() that takes two integers, n and m as a parameter and returns the number of digits in n that are equal to m. Assume that n≥0 and 0≤m≤9 Ex: If the input is: 34443215 4 3 import java.util.Scanner; public class LabProgram { /* TODO: Write recursive digitCount() method here. */ public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int digits; int n= scnr.nextInt(); int m= scnr.nextInt(); digits = digitCount(n, m); System.out.println(digits); }}
Java code: final static Scanner cin = new Scanner(System.in); public static void main(String[] args) { out.println("CPS 151 In-class assignment 3 by ___ your name here ___\n"); out.print("Enter n: "); int n = cin.nextInt(); long f = fib(n); out.println("\nfib(" + n + ") = " + f); out.println("\nCPS 151 In-class assignment 3 complete"); } // end main // standard fibonacci number computation using recursion static long fib(int n) { if (n < 0) terminate("Negative argument value not allowed, program ended"); if (n <= 1) return n; else return fib(n - 1) + fib (n - 2); } // end fib private static void indent(int level) { for(int Lcv = 1; Lcv <= level; Lcv++) out.print(" "); } // end indent private static void terminate(String errorMessage) { out.println(errorMessage); System.exit(1); } // end terminate
Write a recursive method called digitCount() that takes a positive integer as a parameter and returns the number of digits in the integer. Hint: The number of digits increases by 1 whenever the input number is divided by 10. Use Java. Ex: If the input is: 345 the method digitCount() returns and the program outputs: 3 Ex: If the input is: 0 the method digitCount() returns and the program outputs: 1 import java.util.Scanner; public class LabProgram {/* TODO: Write recursive digitCount() method here. */public static void main(String[] args) {Scanner scnr = new Scanner(System.in);int num, digits;num = scnr.nextInt();digits = digitCount(num);System.out.println(digits);}}
Write a Java program that will compute the greatest common divisor using recursive method. The gcd(m,n) can be defined recursively as follows: If m % n is zero, gcd(m,n) is n. Otherwise, gcd(m,n) is gcd(n,m%n). Write a main program that prompts the user to enter two integers and displays the greatest common divisor.
Rewrite the private static int recurseMax method without using Java API public class Recursion{ public static void main(String[] args){ // My tests (DO NOT MODIFY!) int[] a = {3,2,6,4,15,7,9,8,6}; p(recurseSum(a)); // Sum should be 60 p(recurseMax(a)); // Max should be 15 // End of tests! } // Recursive methods below here... public static int recurseSum(int[] a){ // TODO: This is the wrapper method. You must complete this AND implement helper method int total = recurseSum(a, a.length); return total; } private static int recurseSum(int[] a, int i){ if (i <= 0) return 0; return (recurseSum(a, i - 1) + a[i - 1]); } public static int recurseMax(int[] a){ int max = recurseMax(a, a.length); return max; } private static int recurseMax(int[] a, int i){ if(i == 1) return a[0]; return Math.max(a[i-1], recurseMax(a, i-1)); } //…
4.31 LAB: Months until payoff (JAVA) Write a program in java that reads a loan amount, payment amount, and interest rate as inputs and outputs the number of payments required until the loan is paid. Interest is added to current balance before a payment is applied. Ex: If current balance is $100.00 and the interest rate is 0.02, the new balance is $102.00 before a payment is applied. All values are doubles. import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); /* Type your code here. */ }}
4.34 LAB: Draw upside down triangle (JAVA) Write a program in java that outputs a right triangle of asterisks given the height as input. Each line ends with a blank space. Ex: If the input is: 3 the output is: * * * * * * Code starts here: import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); /* Type your code here. */ }}
Write a recursive Java method that calculates the sum of n positive integer numbers. The math function is: f(n) = 1 + 2 + 3 + … + n. Jack, Peter and John were exploring a tunnel which allows only one person to pass through. Jack entered the tunnel first, followed by Peter. John entered the tunnel the last. The tunnel has a dead end. So the team has to turn back and retrieve from the tunnel one by one. Write a Java program based on a suitable data structure to simulate this process.
Write code in Java: - Code must be recursive. import java.util.*; import java.lang.*; import java.io.*; class BinaryToDecimal { // *More methods can be added* public static int binaryToDecimal(String binaryString) { // *Code goes here* } } class DriverMain { public static void main(String args[]) { Scanner input = new Scanner(System.in); System.out.print(BinaryToDecimal.binaryToDecimal(input.nextLine())); } }
create a recursive decent parse that read ( 1 + 2 ) / 3 from a txt file import java.io.File;import java.io.FileNotFoundException;import java.util.Scanner;import java.util.StringTokenizer; public class Lexical {public static void main(String args[]) throws FileNotFoundException{//reading file (Create one and put the expression (2+5/t) or (1-9)*0)Scanner input = new Scanner(new File("Expression.txt"));while(input.hasNextLine()) {//reading next lineString line = input.nextLine();//reading tokens by spaceStringTokenizer strings = new StringTokenizer(line," ");//reading more stringswhile (strings.hasMoreElements()) {//converting object to stringString token = strings.nextElement().toString();switch(token) //switch case{case "(" :System.out.println("Next token is: 25 Next lexeme is (");break;case ")" :System.out.println("Next token is: 26 Next lexeme is )");break;case "=" :System.out.println("Next token is: 20 Next lexeme is =");break;case "+" :System.out.println("Next token is: 21 Next…
I need to complete the following program Multiply.java. This program uses recursion to multiply two numbers through repeated addition. import java.util.Scanner; public class Multiply { public static void main(String[] args) { Scanner in = new Scanner(System.in); // Setting up scanner System.out.print("Enter a number: "); int a = in.nextInt(); System.out.print("Enter a number: "); int b = in.nextInt(); in.close(); int result = recursiveMultiply(a, b); System.out.print(a + " x " + b + " = " + result); } public static int recursiveMultiply(int a, int b) { if (/* Complete here */) return /* Complete here */; return /* Complete here */ + /* Complete here */; } } Output should be as picture shows