Java Consider the following method./** @return array with len random Integers from 1 to 100 inclusive */public int[] getRandomArray(int len){int [] list = new int[len];for(int i = 0; i < len; i++){/* code to add integer to list */}return list;}Which of the following can replace /* codeadd integer to list */ so that getRandomArray works as intended?list[i] = (int) (Math.random() * 101);list[i] = (int) (Math.random() * 99) + 1;list[i] = (int) (Math.random() * 99);list[i] = (int) (Math.random() * 100);list[i] = (int) (Math.random() * 100) + 1;

Consider the following method. /** @return array with len random Integers from 1 to 10 public int[] getRandomArray(int len) { int [] list = new int[len]; for(int i 0; i < len; i++) /* code to add integer to list */ }

Consider the following method. /** @return array with len random Integers from 1 to 10 public int[] getRandomArray(int len) { int [] list = new int[len]; for(int i 0; i < len; i++) /* code to add integer to list */ }

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 removes the duplicate elements froman array list of integers using the following header:public static void removeDuplicate(ArrayList<Integer> list)Write a test program that prompts the user to enter 10 integers to a list and displaysthe distinct integers in their input order and separated by exactly one space.Here is a sample run: Enter 10 integers: 34 5 3 5 6 4 33 2 2 4 ↵EnterThe distinct integers are 34 5 3 6 4 33 2
Your activity: write a same java program that will accept 20 integer in a list and returns the index of the first occurrence of the smallest element in the array. Also, write a program to test your method. Write a Java method, smallestIndex, that takes as its parameters an int array and its size, and returns the index of the (first occurrence of the) smallest element in the array. public class Array_labExercise2 { public static void main(String[] args) { int[] list = {56, 34, 67, 54, 23, 87, 66, 92, 15, 32, 55, 15, 88, 22, 30}; System.out.print("List elements: "); printArray(list); System.out.println(); System.out.println("Index of the (first occurenc of the) " + "smallest element in list is: " + smallestIndex(list)); System.out.println("Smallest element in list is: " + list[smallestIndex(list)]); } public static void printArray(int[] list) { int counter; for (counter = 0; counter < list.length; counter++) System.out.print(list[counter] + " ");…
(IN JAVA) Implement a mergeUniqueValues(arr1, arr2) method. When passed two arrays of strings, it will return an array containing the strings that appear in either or both arrays in sorted order. And the returned array should have no duplicates. For example, if you have two string arrays: arr1: {“Bear”, “Elephant”,”Fox”}arr2: {“Panda”, “Elephant”,”Eagle”} Calling mergeUniqueValues(arr1, arr2) should return a merged and sorted array like: Bear, Eagle, Elephant, Fox, Panda
Write a method quicksort that takes in an ArrayList of integers and returns them in ascending order, using a quicksort style of sorting. Remember that this style relies on choosing a pivot integer and breaking the set into values less than the pivot and more than the pivot, then repeating this process on each half until only single values are left, which are then put back together. public ArrayList<Integer> quickSort(ArrayList<Integer> list) { *code here*}
Write a program in java that prompts the user to enter an inte- ger m and find the smallest integer n such that m * n is a perfect square. (Hint: Store all smallest factors of m into an array list. n is the product of the factors that appear an odd number of times in the array list. For example, consider m = 90, store the factors 2, 3, 3, and 5 in an array list. 2 and 5 appear an odd number of times in the array list. Thus, n is 10.)
) Do a trace on the binary search method below: variable key holds the value 42, and variable list is a reference to an array with these values {16, 22, 25, 37, 38, 41, 49, 52, 59, 66, 71, 76}. public static int binarySearch(int[] list, int key) { int lowIndex = 0; int highIndex = list.length - 1; while (highIndex >= lowIndex) { int midIndex = (lowIndex + highIndex) / 2; if (key < list[midIndex]){ highIndex = midIndex - 1; } else if (key > list[midIndex]){ lowIndex = midIndex + 1; } else if (key == list[midIndex]){ return midIndex; } } // end of while loop return -1; } // end of binary search method Each row in the table below corresponds to one iteration of the while loop in the method above. You can add or remove rows according to the actual number of iterations needed. The first row’s information corresponds to the first iteration. You need to fill…
) Do a trace on the binary search method below: variable key holds the value 42, and variable list is a reference to an array with these values {16, 22, 25, 37, 38, 41, 49, 52, 59, 66, 71, 76}. public static int binarySearch(int[] list, int key) { int lowIndex = 0; int highIndex = list.length - 1; while (highIndex >= lowIndex) { int midIndex = (lowIndex + highIndex) / 2; if (key < list[midIndex]){ highIndex = midIndex - 1; } else if (key > list[midIndex]){ lowIndex = midIndex + 1; } else if (key == list[midIndex]){ return midIndex; } } // end of while loop return -1; } // end of binary search method Each row in the table below corresponds to one iteration of the while loop in the method above. You can add or remove rows according to the actual number of iterations needed. The first row’s information corresponds to the first iteration. You need to fill…
using arrays or Arraylist in java language Write the method named nOdds().* * Given an ArrayList of positive Integers, return a new list * of length "count" containing the first odd numbers from * the original list. The original will contain at least * "count" odd numbers.* * Examples:* nOdds([3, 2, 4, 5, 8], 2) returns [3, 5]* nOdds([3, 2, 4, 5, 8, 9], 3) returns [3, 5, 9]* nOdds([3, 1, 2, 4, 5, 8], 3) returns [3, 1, 5]* * @param list the ArrayList of Integers to search.* @param count the number of odd numbers to copy.* @return the first "count" odd numbers from the list.*/// TODO - Write the nOdds method here. // A utility method for testing@SuppressWarnings("unchecked")public static <T> ArrayList<T> al(T...o){ArrayList<T> result = new ArrayList<T>();for (T s : o) result.add(s);return result;}
FOR JAVA Write a method that takes a one dimensional integer array, an integer (as index) and another integer (as number). Your program must insert the number into the given index, shift the rest of the elements to the right, and return the new array. For instance, if we want to insert the number 0 into position 3 of {1, 2, 3, 4, 5}, your method must return {1, 2, 3, 0, 4, 5}.
Using arrays or ArrayList in java language Write the method named mesh.* * Start with two ArrayLists of String, A and B, each with * its elements in alphabetical order and without any duplicates. * Return a new list containing the first N elements from the two * lists. The result list should be in alphabetical order and without * duplicates. A and B will both have a size which is N or more. * Your solution should make a single pass over A and B, taking * advantage of the fact that they are in alphabetical order, * copying elements directly to the new list.* * Remember, to see if one String is "greater than" or "less than" * another, you need to use the compareTo() method, not the < or > * operators. * * Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]* * @param a an ArrayList of String in alphabetical order.* @param b an ArrayList of…
Mergesort is a method that takes an integer array and returns a sorted copy of the same array. It first sorts the left half of the input array, then the right half of the input array, and finally merges the two sorted halves together into a sorted version of the input array. Implement the mergesort method public static int[] mergesort(int[] arr) { return new int[] {-1}; } *must be in this layout and done in java
java Write a method that takes rows and columns as a parameter, and returns a 2D array of the designated size, filled with empty Strings. I currently have public static String[][] createArray(int row, int col) { String[][]arr=new String[row][col]; return arr; } but it returns the 2d array filled with null?