Write a static method avgNo Tens() that will receive two ints A and B and return the average of all the numbers between A and B (both inclusive). However, numbers that are multiples of 10 will not be included in calculating the average. For example: avgNoTens(8, 13) would return the average of the following numbers: 8, 9, 11, 12 and 13.

Write a static method avgNo Tens() that will receive two ints A and B and return the average of all the numbers between A and B (both inclusive). However, numbers that are multiples of 10 will not be included in calculating the average. For example: avgNoTens(8, 13) would return the average of the following numbers: 8, 9, 11, 12 and 13.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a method that returns anumber, given an uppercase letter, as follows:public static int getNumber(char uppercaseLetter)Write a test program that prompts the user to enter a phone number as a string. The inputnumber may contain letters. The program translates a letter (uppercase or lowercase)to a digit and leaves all other characters intact. Here are sample runs of the program: Enter a string: 1-800-Flowers ↵Enter1-800-3569377
For this problem you will write a method that computes the number of boxes in a pyramid of boxes based on the number of boxes in the base. The boxes in each layer of the pyramid are stacked directly on top of one another (i.e. not offset between two boxes below). For example, below are shown two pyramids, one with base 5 and one with base 6. [] [][] [][][] [][][][] [][][][][] [][][][][][] Implement and test the computePyramidBoxes() method in the PyramidBoxCount class. When testing the computePyramidBoxes() method you should be sure to have at least one test method for each base case and at least one test method for each recursive case in your program.
A pentagonal number is defined as n(3n−1) ∕ 2 for n = 1, 2, . . ., etc.. Therefore, the first few numbers are 1, 5, 12, 22, . . . . Write a method with the following header that returns a pentagonal number:public static int getPentagonalNumber(int n) For example, getPentagonalNumber(1) returns 1 and getPentagonalNumber(2) returns 5. In Java, Write a test program that uses this method to display the first 100 pentagonal numbers with 10 numbers on each line. Numbers are separated by exactly one space.
Write a method in Java called printPowersOfN that accepts a base and an exponent as arguments and prints each power of the base from base0 (1) up to that maximum power, inclusive. For example, consider the following calls: printPowersOfN(4, 3);printPowersOfN(5, 6);printPowersOfN(-2, 8);These calls should produce the following output: 1 4 16 641 5 25 125 625 3125 156251 -2 4 -8 16 -32 64 -128 256
in java write a method (void rect(int a,int b)), which draws the following figure: a rectangle size a x b , each even row contains line numbers (2,4,6,8,...), written consecutively, each odd row contains numbers that increment from 1 to half of the width and back to 1. Example: input: a= 6, b= 5 Result: 123321 222222 123321 444444 123321
Write a java method sumOfAllOddNumbersBetween() that takes as input two integers and returns the sum of all odd numbers that are between the two given numbers (the given numbers should be excluded from the sum). Write a main program to test your method by accepting the two integers from the user.
Suppose that a Scanner object contains a bunch of tokens all on a single line separated by spaces. For example: 100.5 65 pizza 100 45.75 70 5.8 5 Also suppose that you have two integers n and m that are both positive. For example: n = 5 and m = 10 Write a static method: public static int partialSum(Scanner s, int n, int m) that takes a Scanner and two integers n and m as arguments and returns the sum of the integers read by the Scanner that are divisible by n and not divisible by m. In the above example, the integers divisible by 5 and not divisible by 10 are 65 and 5, so the result would be 70. If the Scanner is empty, or no tokens are valid integers, the result should be 0. You can assume the Scanner is not null.
*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 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.
In Java, Use the Phone class as a baseline, and write a method isUSA. It should return true if the country code is 1 and false otherwise. Also expanding the Phone class, write a method that determines the location of an area code. It should return the name of the area code's city. For example, if cc = 1 and area code = 510 East Bay Area, 650 SF Peninsula, 415 San Francisco, 408 South Bay Area. For this assignment, use literal strings as return values.
An English teacher is checking the length of words his students are using in their written essays. He asked each one of his students to write a sentence and then he need to get the average length of word for each student as he will give a prize for the student who have the maximum average word length. Help the teacher to know the name of the concerned student by implementing a Java program with the following steps: a. Write a Java method called averageStudentWordLength that takes one argument which is a 1D array of String of name sentence and return the average length of the sentence as a double value. b. Write a Java method called averageAllStudentWordLength that takes one argument which is a 2D array of String of name allStudentsSentence contains the sentences written by all students in the class and return the (as 1D array of double) the average word length for each of the sentence of student. This should be done by repeatedly calling the method averageStudentWordLength defined and…
Suppose that a Scanner object contains a bunch of tokens all on a single line separated by spaces. For example: 100.5 30.4 pizza 56.8 1000.3 8.2 Also suppose that you have a particular item that you know the price of. Let’s use the following example: Kindle: 99.99 Write a static method: public static double priceIsRight(Scanner s, double price) that takes a Scanner and an item price as parameters and returns the bid that is closest to the item price but not greater than the item price. If all bids are greater than the price, return 0.0. If there are no bids (Scanner is empty) return 0.0. You can assume the Scanner is not null. In the above example. 56.8 should be returned, since it is the number that is closest to 99.99 but not over 99.99. Notice that there may be some invalid tokens in the Scanner's input. The above example has pizza as one of its tokens, which is clearly not a valid bid. Your method should throw these tokens away and not consider them as bids. It is probably…