int[][] a4 = {{18,25,15}};int[][] a5 = {{100},{280},{300}};int[][] a6 = new int[a4.1ength][a5[@].1ength];a6 = multiply(a4, a5);// more statements herepublic static int[][] multiply(int[][] a1, int[]] a2) {int[][] product = new int[al.length][a2[@].1ength];int element = 0;int r, c;initializeArray(product);for (r = 0; r < product.length; r++) {for (c = 0; c < product[r].1ength; c++) {for (int x = 0; x < a1[r].iength; x++) {product[r][c] += al[r][x] * a2[x][c];}return product;} Consider the following code segment that includes a method calledmultiply. The multiply method is a sample method for the multiplicationof an n by m array and an m by p array. Suppose the multiply method isinvoked as shown, what will be the value of the expressiona6[0][0]?Note that the initializeArray method puts a 0 to every cell of the arraypassed to initializeArray. *

Given: To find the value of a6[0][0].

Consider the following code segment that includes a method called multiply. The multiply method is a sample method for the multiplication of an n by m array and an m by p array. Suppose the multiply method is invoked as shown, what will be the value of the expression a6[0][0]? Note that the initializeArray method puts a 0 to every cell of the array passed te initializeArray,"

Consider the following code segment that includes a method called multiply. The multiply method is a sample method for the multiplication of an n by m array and an m by p array. Suppose the multiply method is invoked as shown, what will be the value of the expression a6[0][0]? Note that the initializeArray method puts a 0 to every cell of the array passed te initializeArray,"

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 method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example: Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {
Write a method SortTheEvens(), that first shifts all the even numbers of an input array to the left side in that array and then sorts all even numbers in that array.Note: You are not allowed to use direct indexing and can only use ptr++ and ptr-- operators. i.e. *(ptr + i) and ptr[i] are not allowed.Do using c++ programming language.
# the method take another circular array and returns a linear array containing the common elements between the two circular arrays. def intersection(self, c2): # To Do print("==========Test 10==========") lin_arr9 = [10, 20, 30, 40, 50, None, None, None] c10 = CircularArray(lin_arr9, 5, 5) c10.printFullLinear() # This should print: 40, 50, None, None, None, 10, 20, 30 lin_arr10 = [5, 40, 15, 25, 10, 20, 5, None, None, None, None, None] c11 = CircularArray(lin_arr10, 8, 7) c11.printFullLinear() # This should print: 10, 20, 5, None, None, None, None, None, 5, 40, 15, 25 output = c10.intersection(c11) print(output) # This should print: [10, 20, 40]
public static void reverseAscendingSubarrays(int[] items) Rearrange the elements of the given array of integers in place (that is, do not create and return a new array) so that the elements of every maximal strictly ascending subarray are reversed. For example, given the array {5, 7, 10, 4, 2, 7, 8, 1, 3}, after executing this method, the elements of the array would be {10, 7, 5, 4, 8, 7, 2, 3, 1}. Given another argument array {5, 4, 3, 2, 1}, the contents of that array would stay as {5, 4, 3, 2, 1} seeing that its each element is a maximal ascending subarray of length one. public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire…
Write method findZero, as started below. findZero should return the index of the first element of array A that contains the value zero, starting from position 0 up through position pos. If no element of A from position 0 to position pos contains the value zero, then findZero should return –1. For example:(in java) Array (A) Position (pos) Value returned by findZero(A, pos) 1 0 2 5 6 0 -1 1 0 2 5 6 1 1 1 0 2 5 6 2 1 1 0 2 0 6 2 1 1 0 2 0 6 4 1 1 2 3 4 5 4 -1 Complete method findZero below. Assume that it is called only with values that satisfy its assumptions as stated below. // Description: Returns smallest index k // such that (0 <= k <= pos) and (A[k] == 0) // Assumptions: 0 <= pos < A.length public int findZero(int[] A, int pos) {
Write the method sum2D() which accepts a two dimensional integer array and returns the sum of all the elements of the array.
Implement the following method to sort the rows in a two-dimensionalarray. A new array is returned and the original array is intact.public static double[][] sortRows(double[ ][ ] m)Write a test program that prompts the user to enter a 4 x 4 matrix of doublevalues and displays a new row-sorted matrix. Here is a sample run: Enter a 4−by−4 matrix row by row:0.15 0.875 0.375 0.225 ↵Enter0.55 0.005 0.225 0.015 ↵Enter0.30 0.12 0.4 0.008 ↵Enter0.07 0.021 0.14 0.2The row−sorted array is0.15 0.225 0.375 0.8750.005 0.015 0.225 0.550.008 0.12 0.30 0.40.021 0.07 0.14 0.2
Consider the following incomplete code for generateMatrix method. Assume that the initializeArray method that is invoked by generateMatrix assigns 0 to every cell of the array that is passed to it. Suppose the expression generateMatrix(3); will return an array of the following form: a. row < 0 && col > size - 1b. row > 0 && col > size - 1c. row < 0 && col < size - 1d. row < 0 && col > sizee. row < 0 || col > size - 1
I need to write a method that will move all of the even values in an array to the front positions, otherwise it should preserve their order. I've written a function that can determine if the value in an element is even, but how can I tell the method to move them to the front AND keep the order of the others? My method looks like this at the moment: //TODO: part f - move all evens to front public static void moveEvensToFront(int[] values) { for (int i = 0; i < values.length; i++){ if(values[i] % 2 == 0){ //swap to front? } } } The questions is from Big Java 6th Edition. E7.10.f
A method to make an almost sorted array into fully sorted.@param arr: an array of integers, with all the numbers are sortedexcepted the last one@param size: the number of elements in an array*/public static void insertLast(int[] arr, int size){// your work}To make it concrete, let's use the example shown in Figure 1. In this example, the arraycontains [1, 3, 4, 5, 6, 7, 2], and the size of the array is 7. As we can see, The inputarray are sorted excepted the last one. The goal here is to place last element into a correctposition so all numbers will be sorted. This is exactly what the method insertLast is toperform.1Figure 1: Sampel output for insertion sort part 1.As we recall from the lecture, the idea is keep shifting all larger number (compared with thelast number) to the right until we nd the number is smaller than the last number. In ourexample,1. Compare 7 with 2. Since 7 > 2, we copy 7 to its right.2. Compare 6 with 2. Since 6 > 2, we copy 6 to its right.3. Compare 5 with…
Instrument shellsort to print the number of compares divided by the array sizefor each increment. Write a test client that tests the hypothesis that this number is asmall constant, by sorting arrays of random Double values, using array sizes that areincreasing powers of 10, starting at 100
Implement the following method to sort the columns in a twodimensional array. A new array is returned and the original array is intact.public static double[ ][ ] sortColumns(double[ ][ ] m) Write a test program that prompts the user to enter a 4 X 4 matrix of doublevalues and displays a new column-sorted matrix. Here is a sample run: Enter a 4−by−4 matrix row by row:0.15 0.875 0.375 0.225 ↵Enter0.55 0.005 0.225 0.015↵Enter0.30 0.12 0.4 0.008 ↵Enter0.07 0.021 0.14 0.2 ↵EnterThe column−sorted array is0.07 0.005 0.14 0.0080.15 0.021 0.225 0.0150.30 0.12 0.375 0.20.55 0.875 0.4 0.225