I do not get this one in the java language.I do not understand c[i].length and eg. c[2].lengthand the third for loop. /** multiplyMatrix multiplies two matrices and returns the result */public static double[][] multiplyMatrix(double[][] a, double[][] b) {double[][] c = new double[3][3];for (int i0; i < c.length; i++) {for (int j = 0; j < c[i].length; j++) {0; h < c.length; h++) {for (int hc[i][j] += a[i][h] * b[h][j];}}}return c;

length function in Java is used to find length/size/number of elements of an array. For example, int…

public static double[][] multiplyMatrix(double[][] a, double[][] b) { double[][] c = new double[3][3]; for (int i 0; i < c.length; i++) { for (int j = 0; j < c[i].length; j++) { for (int h = 0; h < c.length; h++) { * b[h][j]; c[i][j] += a[i][h] } } return c;

public static double[][] multiplyMatrix(double[][] a, double[][] b) { double[][] c = new double[3][3]; for (int i 0; i < c.length; i++) { for (int j = 0; j < c[i].length; j++) { for (int h = 0; h < c.length; h++) { * b[h][j]; c[i][j] += a[i][h] } } return c;

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

import java.util.Scanner;import java.util.ArrayList; public class UserIDSorting {// TODO: Write the partitioning algorithm - pick the middle element as the // pivot, compare the values using two index variables l and h (low and high), // initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessarypublic static int partition(ArrayList<String> userIDs, int i, int k) {} // TODO: Write the quicksort algorithm that recursively sorts the low and // high partitionspublic static void quicksort(ArrayList<String> userIDs, int i, int k) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in); ArrayList<String> userIDList = new ArrayList<String>(); String userID; userID = scnr.next();while (!userID.equals("-1")) {userIDList.add(userID);userID = scnr.next();}// Initial call to quicksort quicksort(userIDList, 0, userIDList.size() - 1); for (int i = 0; i < userIDList.size(); ++i)…
create a generic array stack and push/pop a million random ints using java.util.Random class. you also want to detect the time it takes to push and pop elements from the stack and you need to run the test multple times to see how the running time grows with increasing number of operations. use a outer loop that runs the program a million times (e.g. for(int i = 1; i<1000000; i+=1000000)).
After multiplying all even numbers by 10, write code to sum all elements in each row and print the results. code used to multiply all even number by 10 below import java.util.Random; public class Main { public static void main(String[] args) { Random random = new Random(); // Generating a 5x5 matrix int[][] matrix = new int[5][5]; for (int i = 0; i < matrix.length; i++) { for (int j = 0; j < matrix[i].length; j++) { matrix[i][j] = random.nextInt(101); // from 0 to 100 } } // Printing the original matrix System.out.println("Original matrix: "); for (int i = 0; i < matrix.length; i++) { for (int j = 0; j < matrix[i].length; j++) { System.out.print(matrix[i][j] + " "); } System.out.println(); } // Multiplying even numbers by 10 for (int i = 0; i < matrix.length; i++) { for (int j = 0; j <…
in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary. Implement a Java program that will populate a 5x5 matrix with randomlygenerated integers from 0 to 100.(1) print your matrix in a table form.(2) modify your code to multiply all even numbers by 10 and print the matrix.Your output of questions (1) and (2) should match the format of the followingsample outputs:
// MergeSortTest.java// Sorting an array with merge sort.import java.security.SecureRandom;import java.util.Arrays; public class MergeSortTest { // calls recursive sortArray method to begin merge sorting public static void mergeSort(int[] data) { sortArray(data, 0, data.length - 1); // sort entire array } // splits array, sorts subarrays and merges subarrays into sorted array private static void sortArray(int[] data, int low, int high) { // test base case; size of array equals 1 if ((high - low) >= 1) { // if not base case int middle1 = (low + high) / 2; // calculate middle of array int middle2 = middle1 + 1; // calculate next element over // split array in half; sort each half (recursive calls) sortArray(data, low, middle1); // first half of array sortArray(data, middle2, high); // second half of array // merge two sorted arrays after split calls…
in Python Minima in permutations. Write a program that takes an integer n from the command line, generates a random permutation, prints the permutation, and prints the number of left-to-right minima in the permutation (the number of times an element is the smallest seen so far). Then write a program that takes integers m and n from the command line, generates m random permutations of length n, and prints the average number of left-to-right minima in the permutations generated
import java.util.ArrayList;import java.util.Random; class Main { public static void main(String[] args) { Random rand = new Random(); ArrayList<Integer> a = new ArrayList<Integer>(); for(int i = 0; i < 100; i++) { a.add(rand.nextInt(100)); } print(a); System.out.println("----"); sort(a); print(a); // simplified Quicksort public static void sort(ArrayList<Integer> a) { if (a.size() <= 1) return; // Pick a Pivot int m = a.size() / 2; int pivot = a.get(m); } ArrayList<Integer> smaller = new Arraylist<Integer>(); ArrayList<Integer> same = new ArrayList<Integer>(); ArrayList<Integer> larger = new ArrayList<Integer>(); for (Integer x : a) { if (x < pivot) { smaller.add(x); } else if(x > pivot) { larger.add(x); } else { same.add(x); } } sort(smaller); sort(larger); a.clear(); a.addAll(smaller);…
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
Java Quick Sort but make it read the data 10, 7, 8, 9, 1, 5 from a file not an array // Java implementation of QuickSort import java.io.*; class GFG { // A utility function to swap two elements static void swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } /* This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot */ static int partition(int[] arr, int low, int high) { // pivot int pivot = arr[high]; // Index of smaller element and // indicates the right position // of pivot found so far int i = (low - 1); for (int j = low; j <= high - 1; j++) { // If current element is smaller // than the pivot if…
Using JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.
Question1. Use recursion [ a. Write a Java method to find the largest element in the array using recursion. public static int largestelement(int[] arr,int n){ } b. Write a Java method to find a target in an array using binary search. (Note the array is sorted descendingly) public static int binarysearch(int[] arr, int target,int l,int r){ } c. Call the methods largestelement() and binarysearch() using the following array a=[13,10,9,8,4,3] and target=10 ANSWER: Output screen capture:
URGENT JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.