Question 17 (23 points) Write a method that takes an array of type double and returns a boolean value. The method returns true if the sum of the even-indexed elements of the parameter array is larger than the sum of the odd-indexed elements, otherwise the method returns false. The method's header is public static boolean compare(double[] in) Sample run double[] in = {}: boolean out = compare(in); System.out.println(“Result: " + out); Output Result: false doublelin = S 5 31 2 551 7 1 37 5.

Question 17 (23 points) Write a method that takes an array of type double and returns a boolean value. The method returns true if the sum of the even-indexed elements of the parameter array is larger than the sum of the odd-indexed elements, otherwise the method returns false. The method's header is public static boolean compare(double[] in) Sample run double[] in = {}: boolean out = compare(in); System.out.println(“Result: " + out); Output Result: false doublelin = S 5 31 2 551 7 1 37 5.

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

Related questions

Q: Create a class Recursion. It will have two static methods: removeX and countSubstring and write each…

A: The algorithm of the code:- 1. removeX(String s): a. If the length of the given string is 0,…

Q: /** in *Problem 10 * * You are given an array that is partially filled with Strings. These strings *…

A: Dear Student, The required function along with implementation and expected output is given below -

Q: Exercise 3 Write a recursive method that returns the sum of the first n elements of an array. Test…

A: Code public class Sum { private static int calSum(int arr[], int n) { //base or…

Q: public boolean inSort ( double element ) ; /* A form of ins operations, but here we do not insert…

A: According to the information given:- We have to follow the instruction and write boolean sort…

Q: Exercise 2 Write a recursive method that returns the sum of the first n odd positive integers. Test…

A: Here a recursive method that returns the sum of the first n odd positive integers

Q: 1. Write a nested loop that displays 15 rows of '*' characters. There should be 30.'*' characters in…

A: As per the requirement program first program is developed. Note: As per our guidelines we are…

Q: Write java code that recursively calculates the Sum of the array cells. Program requirements: Create…

A: The java program is given below:

Q: // MichiganCities.java - This program prints a message for invalid cities in Michigan. // Input:…

A: According to the asked question, the solution is given below with a proper explanation.

Q: Complete the method void add(T item). It adds an item into the set if it is not already inside. It…

A: We can make use of contains() method to check whether element is present or not Then we can add item…

Q: Enhanced selection sort SelectionSortDemo.java package chapter7; /** This program demonstrates…

A: public class SelectionSortDemo { public static void main(String[] arg) { String…

Q: Write an application with a main method that allows you to: • Create an array of 3 Cars, the user…

A: Solution: Java code: Car.java public class Car { private String code; private String…

Q: 1)Write a method that takes an array of ints and returns the sum of all numbers that are even. For…

A: NOTE : Answering only the first question as per the policy. Since programming language is not…

Q: 4) The following method wants to take an array of Strings and reverse the contents of each String…

A: ans) option D

Q: Write a value-returning method that returns the product of all the elements in an integer array

A: class Person: listnew=[1,2,3,4] def __init__(self): continue def myfunc(self):…

Q: Write the method print that receives a String array as a parameter and prints one string per line.…

A: In the print() method – Take a variable to iterate the loop. Use a println() pre-defined method…

Q: For Beginners Java: Write a program that ask the user to enter a list of positive scores until the…

A: I have provided JAVA CODE along with CODE SCREENSHOT and OUTPUT…

Q: Project Description: In this project you implement an ArrayStack ADT and use the stack for…

A: Here is the java code of the above problem. See below steps.

Question

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Question 31 Which method call would print the items in a perfect size array? Assume shoppingList is a perfect sized array, and printltems is a function that prints O printltems(shoppingList, listSize); O shoppingList = printltems(shoppingList); O listSize = printltems(shoppingList); O printltems(shoppingList);
Complete this codeYou can write a recursive helper method that takes any number of arguments and then call it inside the method, but you cannot use any loops. /** * Decide if it is possible to divide the integers in a list into two sets, * so that the sum of one set is odd, and the sum of the other set is a multiple of 10. * Every integer must be in one set or the other. * For example, oddAndTen([5, 5, 3]) → true, * and oddAndTen([5, 5, 4]) → false. * @param list is a list of integers. * @return true iff there is one odd partition and the other multiple of 10. */public static boolean oddAndTen(List<Integer> list) { // call your recursive helper method return ...} private static boolean oddAndTenHelper(...) { // add any parameters // base case // recursive step}
4. Remove all occurrences of a particular element from an array Consider an array named source. Write a method/function named removeAll( source, size, element) that removes all the occurrences of the given element in the source array. You must execute the method by passing an array, its size and the element to be removed. After calling the method, print the array to show whether all the occurrences of the element have been removed properly. nmm" Use Python Example: source=[10,2,30,2,50,2,2,60,0,0] removeAll(source,8,2) After calling removeAll(source,8,2), all the occurrences of 2 must be removed. Printing the array afterwards should give the output as: [ 10,30,50,60,0,0,0,0,0,0]
Recursive Power MethodWrite a method called powCal that uses recursion to raise a number to a power. The method should accept two arguments: The first argument is the exponent and the second argument is the number to be raised (example” powCal(10,2) means 210). Assume that the exponent is a nonnegative integer. Demonstrate the method in a program called Recursive (This means that you need to write a program that has at least two methods: main and 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 powCal method work).
Problem 1: Complete the sumOfDiagonals method in SumOfDiagonals.java to do the following: The method takes a 2D String array x as a parameter and returns no value. The method should calculate and print the sum of the elements on the major diagonal of the array x. In order to have a major diagonal, the array passed into the method should be a square (n-by-n), if it's not a square your program should handle that situation by throwing an exception. (Do Not worry about ragged arrays) If the array is a square, but there is a non-integer value on the major diagonal, your program should handle that situation by throwing an exception. When handling the exceptions, be as specific as you can be, (i.e. Do Not just use the Exception class to handle all exceptions in one catch block). Make the proper calls to the sumOfDiagonals method from the main method to test your sumOfDiagonals method on all the String arrays provided in the main method.
1) Write a method that returns the range of an array of integers. The range is the difference between the highest and lowest values in the array. The signature of the method should be as follows. public static int computeRange(int[] values)
Write a call to Arrays static method equals with arguments arrayl and array2.
5
Practice / Frequency of Characters Write a method that returns the frequency of each characters of a given String parameter. If the given String is null, then return null If the given String is empty return an empty map Example input: output: empty map explanation: input is empty Example input: null output: null explanation: input is null. Since problem output is focused on the frequency we can comfortably use Map data structure. Because we can use characters as key and the occurrences of them as value. Example input: responsible output: {r=1, e=2, s=2, p=1, o=1, n=1, i=1, b=1, l=1} explanation: characters are keys and oc values ences are
Enhanced selection sort algorithm SelectionSortDemo.java package chapter7; /** This program demonstrates the selectionSort method in the ArrayTools class. */ public class SelectionSortDemo { public static void main(String[] arg) { int[] values = {5, 7, 2, 8, 9, 1}; // Display the unsorted array. System.out.println("The unsorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); // Sort the array. selectionSort(values); // Display the sorted array. System.out.println("The sorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); } /** The selectionSort method performs a selection sort on an int array. The array is sorted in ascending order. @param array The array to sort. */ public static void selectionSort(int[] array) { int startScan, index, minIndex, minValue; for (startScan = 0; startScan < (array.length-1); startScan++) { minIndex = startScan; minValue…
Method Details getCountInRange public static int getCountInRange(int[] array, int lower, int upper) Returns the number of values in the range defined by lower (inclusive) and upper (inclusive) Parameters: array - integer array lower - lower limit upper - upper limit Returns: Number of values found Throws: java.lang.IllegalArgumentException - if array is null or lower is greater than upper Any error message is fine (e.g., "Invalid parameters(s)")
Using jGRASP please de-bug this /**This program demonstrates an array of String objects.It should print out the days and the number of hours spent at work each day.It should print out the day of the week with the most hours workedIt should print out the average number of hours worked each dayThis is what should display when the program runs as it shouldSunday has 12 hours worked.Monday has 9 hours worked.Tuesday has 8 hours worked.Wednesday has 13 hours worked.Thursday has 6 hours worked.Friday has 4 hours worked.Saturday has 0 hours worked.Highest Day is Wednesday with 13 hours workedAverage hours worked in the week is 7.43 hours*/{public class WorkDays{public static void main(String[] args){String[] days = { "Sunday", "Monday", "Tuesday","Wednesday", "Thursday", "Friday", "Saturday"}; int[] hours = { 12, 9, 8, 13, 6, 4}; int average = 0.0;int highest = 0;String highestDay = " ";int sum = 0; for (int index = 0; index < days.length; index++){System.out.println(days[index] + " has "…