Here are the original instructions for the code below that I wrote. Write a method that accepts a maximum number as an argument and prints each number from 1 up to that maximum, inclusive, enclosed in square brackets. I want to make the program prompt a max # input from a user and pass that value to the printNumbers methods and then print the max from the user input. Is this possible? import java.util.Scanner; public class PrintNumbers { Scanner input = new Scanner(System.in); public static void printNumbers(int max) { for(int count = 1; count <= max; count++) { System.out.print("[" +count+ "]"); } } public static void main(String[] args) { printNumbers(10); } }

Here are the original instructions for the code below that I wrote. Write a method that accepts a maximum number as an argument and prints each number from 1 up to that maximum, inclusive, enclosed in square brackets. I want to make the program prompt a max # input from a user and pass that value to the printNumbers methods and then print the max from the user input. Is this possible? import java.util.Scanner; public class PrintNumbers { Scanner input = new Scanner(System.in); public static void printNumbers(int max) { for(int count = 1; count <= max; count++) { System.out.print("[" +count+ "]"); } } public static void main(String[] args) { printNumbers(10); } }

EBK JAVA PROGRAMMING

8th Edition

ISBN:9781305480537

Author:FARRELL

Publisher:FARRELL

Chapter3: Using Methods, Classes, And Objects

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

use the file Dining.java which is provided below and Complete the calcTip() method as described in the comments. Then add a new method called splitBill() which receives as input an integer value, representing the number of diners, and returns each person's equal share of the bill.
Write a java program which asks the user to enter name and age and calls the following methods: a. printName(): Takes name as parameter and prints it 20 times using a while loop. b. printAge(): Takes age as parameter and prints all the numbers from 1 up to age. Please strictly follow this format. Note: any extra or missing space / line will lead to test failure. Name: Andy Age: 10 Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy Andy 1,2,3,4,5,6,7,8,9,10 class Main {public static void main(String[] args) {}}
Consider the following Java method, which is written incorrectly:// This method should return how many of its three// arguments are odd numbers.public static void printNumOdd(int n1, int n2, int n3) {int count = 0;if (n1 % 2 != 0) {count++;} else if (n2 % 2 != 0) {count++;} else if (n3 % 2 != 0) {count++;}System.out.println(count + " of the 3 numbers areodd.");}Under what cases will the method print the correct answer, and when will it print an incorrect answer? What should be changed to fix the code? Can you think of a way to write the code correctly without any if/else statements?
what is the java code for the class and Write one or more tests that check that the method works as specified in all cases? intro: A Fibonacci series is a popular sequence of numbers. The first two numbers of this series are 0 and 1. After this, the next Fibonacci number is obtained by adding the previous two. Thus the Fibonacci sequence is 0,1,1,2,3,5,8,13,... A Fibonacci counter is a machine that counts Fibonacci numbers. Much like a step tracker, it can be started at any count. It can be incremented or decremented by 1 (count falling below 0 is invalid). Given a number ’n’, the nth Fibonacci number can be calculated directly using Binet’s formula: ???(?)=15√((1+5√2)?−(1−5√2)?) what to do: Write a class FibonacciCounter that represents a single Fibonacci counter. This class should contain the following: A constructor that takes the initial count value and initializes the object appropriately. A method that returns a FibonacciCounter object with its count incremented by 1. A…
Consider the method below, what will be printed if calling test_b(4)? public static void test_b(int n) { if (n>0) test_b(n-2); System.out.println(n + " "); }
*in java* Write a method printShampooInstructions(), with int parameter numCycles, and void return type. If numCycles is less than 1, print "Too few.". If more than 4, print "Too many.". Else, print "N: Lather and rinse." numCycles times, where N is the cycle number, followed by "Done.". End with a newline. Example output with input 2: 1: Lather and rinse. 2: Lather and rinse. Done. Hint: Declare and use a loop variable. import java.util.Scanner; public class ShampooMethod { /* Your solution goes here */ public static void main (String [] args) {Scanner scnr = new Scanner(System.in);int userCycles; userCycles = scnr.nextInt();printShampooInstructions(userCycles);}}
Write a method with the following header to display an integer in reverse order: public static void reverse(int number) For example, reverse(3456) displays 6543. Write a test program that prompts the user to enter an integer then displays its reversal
I need help writing the code. Write a public static method named odds that takes in 1 argument int a, and returns a String containing all positive odd numbers, with each separated by a comma, from 1 up to that number inclusive if it is also odd.Remember if the argument is even not to include it in the output.Remember there should be no trailing comma after the values. If the argument a is negative, return a String that says “NONE” (Do not print the String) Example: odds(5); String returned by method: “1,3,5” Example: odds(8); String returned by method: “1,3,5,7” Example: odds(9); String returned by method: “1,3,5,7,9” Example: odds(-5); String returned by method: “NONE” Example: odds(0); String returned by method: “” Example: odds(1); String returned by method: “1”
Write in Java using Methods Create two methods under the Main class. One prints “I am mighty!”, and the other one accepts an integer input and prints “I am {integer} times stronger than you!”. Call the first method and then, accept an integer input and use that to call the second method. Inputs 1. Line containing a string 9000 Sample Output Enter a number: 99999 I am mighty! I am 99999 times stronger than you!
Write a Java Code for the below: A prime number is a number that is evenly divisible only by itself and 1. For example, the number 5 is prime because it can be evenly divided only by 1 and 5. The number 6, however, is not prime because it can be divided evenly by 1, 2, 4, and 6. Write a method named isPrime, which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. Also write main method that displays prime numbers between 1 to 500.
I need help to Fill in the two methods in the .java file in the following below: public class JavaProject{public static int[][] sum(int[][] A, int[][] B){//TODO: Your code should go herereturn null; //This line is wrong and should be changed.} public static int[][] cutOffTheCrust(int[][] input){//TODO: Your code should go here return null; //This line is wrong and should be changed.}public static int[][] getSubsetRows(int[][] input, int row_start, int row_end){//TODO: Your code should go here return null; //This line is wrong and should be changed.}public static void main(String[] args){System.out.println("=== TESTING sum Test 1 ===");int[][] input1 = {{1, 5},{4, 6}};int[][] input2 = {{7, 3},{5, 4}};int[][] result = sum(input1, input2);printArray(result); System.out.println("=== TESTING sum Test 2 ===");int[][] input7 = {{1, 5, 1, 0},{4, 6, -3, 7}};int[][] input8 = {{7, 3, 1, 1},{5, 4, 0, -2}};result = sum(input7, input8);printArray(result); System.out.println("=== TESTING…
FOR JAVA Write a method called pyramid that takes a number, a character, and a boolean as parameters. Then the method should print a pyramid accord- ing to parameters (please see the example below). In the main method, ask user to enter values for your method’s parameters and call your method. OUTPUT: ENTER A NUMBER 3 ENTER A CHARACTER o Is pyramid upside down? false o oo ooo Enter a number 5 Enter a character * Is pyramid upside down? true ***** **** *** ** *