1) (Choose only one answer) Why does a method to swap two array elements work correctly when a method to swap two integer values does not? a) Because arrays use more memory than primitive values. b) Because of a bug in Java. c) Because arrays are slower and more inefficient than primitives, so swapping is possible. d) Changes to an array parameter's elements will not be seen in the original array by the caller. e) Unlike integers, arrays are objects and use reference semantics.

1) (Choose only one answer) Why does a method to swap two array elements work correctly when a method to swap two integer values does not? a) Because arrays use more memory than primitive values. b) Because of a bug in Java. c) Because arrays are slower and more inefficient than primitives, so swapping is possible. d) Changes to an array parameter's elements will not be seen in the original array by the caller. e) Unlike integers, arrays are objects and use reference semantics.

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

6.29 LAB: Remove all even numbers from an array Use Java programming. Write the removeEvens() method, which receives an array of integers as a parameter and returns a new array of integers containing only the odd numbers from the original array. The main program outputs values of the returned array. Hint: If the original array has even numbers, then the new array will be smaller in length than the original array and should have no blank elements. Ex: If the array passed to the removeEvens() method is [1, 2, 3, 4, 5, 6, 7, 8, 9], then the method returns and the program output is: [1, 3, 5, 7, 9] Ex: If the array passed to the removeEvens() method is [1, 9, 3], then the method returns and the program output is: [1, 9, 3] import java.util.Arrays; public class LabProgram { public static int[] removeEvens(int [] nums) { /* Type your code here */} public static void main(String[] args) { int [] input = {1,2,3,4,5,6,7,8,9};int [] result = removeEvens(input); // Helper method…
a) create a method that accepts a 2D array and shuffles it values (like playing cards) b) test your method from main: print your 2D array before and after c) create a similar method that will return the array. Call and test it from main .
Code in C++ Language As a cashier, you would always hate those times when customers choose to take back their order since you'd always summon your manager and yell, "Ma'am pa-void!" No matter how you hate it, you always have to do it since you have no other choice. Given (1) an array of prices of the items, (2) another array of the items the customer wishes to take back, and (3) the customer's payment, print the change of the customer. Input: The first number indicates the number of items "n" brought to the cashier. The next "n" numbers are the prices of the items. The next number indicates the number of items "m" that the customer wants to take back and not proceed. It is assured that 0 <= m <= n. The next "m" numbers are the items to be void that ranges from item 1 to item "n". The final number is the customer's payment. It is also assured that the given payment >= final price of items. INPUT: 5 103.65 650.95 10.25 1067.30 65.18 2 1 5 2000.00 Output: The change…
Complete the following Java method. This method takes in an array of Strings. The method's task is to find out how many times the most common character frequency appears in all of the array's Strings. As an example, for the array ["mouse", "cat", "dog"], the method should return 9, since the characters "m", "u", "s", "e", "c", "a", "t", "d", and "g" appear only once and this frequency (1) appears 9 times. The character "o", appears twice. This frequency (2) appears only once. Therefore, 9 must be returned. Also, if a character appears multiple times in one String, you must count every occurrence. For example, in the word "houses", the character "s" appears twice. Therefore, each occurrence of "s" must be counted. If there is a tie at the completion of the method, you must still return how many times the most frequent character frequency occurred. Furthermore, in your implementation, you must make use of the Java Class Library's HashMap class in order to map particular characters to…
What is the value of J[2][1] in the following array declaration? int[][] J= {{5, 10 }, {15, 20, 25}, {30, 35}}; a. 20 b. 30 c. 35 d. 15
Please help me to solve the error in the following java code. The question requirement is to merge k arrays into a single sorted array, the output should be: (Winnie, 0), (Eason Chan, 40), (Gloria Tang, 60), (Andy Lau, 60), (McDull, 60), (Denise Ho, 60), (Jennifer Chan, 70), (Joey Yung, 80), (Kay Tse, 90), (Mickey, 90), (Jacky Cheung, 95), (Teddy, 95), (Anita Mui, 100), (Peppa, 100) import java.util.*;import java.util.Arrays; public class StableMerger { static class Student { String name; double grade; public Student(String n, double g) { name = n; grade = g; } public String toString() { return "(" + name + ", " + grade + ")"; } } public static Student[] merge(Student[][] a) { //↓↓↓↓↓↓error code↓↓↓↓↓↓ PriorityQueue<Student> queue = new PriorityQueue<Student>(); int total=0; //add arrays to heap for (int i = 0; i < a.length; i++) {…
Java - Given the following method header, give the code for the function using a binary search of an array. Don’t worry about the precondition (assume this is already true). public static boolean has10 (int[ ] data, int start, int end) // Precondition: The elements data[start]...data[end] are sorted from smallest to largest. This // array segment might be empty (indicated by end being less than start). // Postcondition: A true return value indicates that the number 10 appears in the array // data[start]...data[end]. A false return value indicates that 10 doesn’t appear.
Note:1- you do not need (and should not) to import any additional package/class.2- We do not need an array to handle this program. So you should not use any array.Hint: See if java.lang.Integer.toString() is helpful. Note that the java.lang packageis always imported by default for Java.
PART A: Note: The following code is written only in main -- you assume there is an array bag and you are not adding any methods to that bag. Write the main program to create two array bags of type string. Place 5 strings of your choice in the first bag and 5 strings (of your choice) in the second bag. Your program must:1) determine if there are any strings in the first bag that appears in the second bag as well. If there are, print there are repeated strings. Else print the bags have unique values. 2) Print the content of the both bags and if there are repeated values, print that value only once. PART B: Create two linkedBag objects of type string in main. Place 5 strings in the first bag and five strings in the second bag. Then your code must test if the two linkedBag objects are equal or not. You must traverse both linkedBags and test each items to see if they are the same. Then you must display a message saying the two linkedBags are the same or different. PART C: Write a…
Exercise (Array and Method): Write a method called arrayToString(), which takes an int array and return a String in the form of {a1, a2, ..., an}. Take note that there is no comma after the last element. The method's signature is as follows: public static String arrayToString(int[] array) Also write a test driver to test this method (you should test on empty array, one-element array, and n-element array). Notes: This is similar to the built-in function Arrays.toString(). You could study its source code. Exercise (Array and Method): Write a boolean method called contains(), which takes an array of int and an int; and returns true if the array contains the given int. The method's signature is as follows: public static boolean contains(int[] array, int key) Also write a test driver to test this method. Exercise (Array and Method): Write a method called search(), which takes an array of int and an int; and returns the array index if the array contains the given int; or -1 otherwise. The…
Exercise 1: //The max function the max between a and b, it returns a if a == //b public double max(double a, double b); //The mult function returns the result of a * b public double mult(double a, double b); //The exist in array function returns the index of the element //‘a’ if //‘a’ exist in array ‘arr’ otherwise returns ‘-1’ public int existsInArray(int [] arr, int a); //Are array equals method compares two arrays and returns true // if the elements of array ‘a’ are equal to elements of array // ‘b’, element by element. If equals it returns 0, it returns - // 1 if not public int areArrayEquals(int [] a, int [] b); Devise four executable test cases for every method in the JUnit notation. See the attached handout for a refresher on the notation.
Need help with this question Write a Java program that asks the user to enter an array of integers in the main method. The program should prompt the user for the number of elements in the array and then the elements of the array. The program should then call a method named minGap that accepts the array entered by the user as a parameter and returns the minimum 'gap' between adjacent values in the array. The main method should then print the value returned by the method. The gap between two adjacent values in an array is defined as the difference in value between the first element and the second element. For example, suppose the user entered the following array of integers {1, 3, 6, 5, 12} The first gap is 2 (3 - 1), the second gap is 3 (6 - 3), the third gap is 1 (6 - 5) and the fourth gap is 5 (12 - 6). Thus, the call of minGap(array) should return 1 because that is the smallest gap in the array. If you are passed an array with fewer than 2 elements, you…