Assume that a N x M matrix is stored in a file. However, the file is corrupted somehow, and some numbers replaced with asterisk symbol (*). Write a method that reads given corrupted file and fills the missing data with the average of the column. For example, given matrix 1 2 3 4. 6. 7 10 11 12, missing data should be replaced with 2+8+11 = 7. 3

Assume that a N x M matrix is stored in a file. However, the file is corrupted somehow, and some numbers replaced with asterisk symbol (*). Write a method that reads given corrupted file and fills the missing data with the average of the column. For example, given matrix 1 2 3 4. 6. 7 10 11 12, missing data should be replaced with 2+8+11 = 7. 3

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

Explain why the ff. methods / implementations run in O(N) time: a. ArrayVector: b. SLLVector: c. ArraySequence: d. DLLSequence: insert_at_rank and remove_at_rank insert_at_rank and remove_at_rank insert_first and remove at_rank and rank_of
Write a method called manipulate-2-Dim that receives a two-dim array of integer numbers called a matrix. The method should return the sum of elements in the even rows of the array.
use the RUST
Example: This sample loop creates a matrix M with consecutively numbered elements M:= for ie 0. 1 for je 0.2 M.+3-i + j 1,j M 0 1 2 M = 3 45
Upload only 1.c file. Any filename. Create a program which validates whether a given array alternates between positive and negative numbers. Examples: Input: [3, -2, 5, -5, 2, -8] →Output: true Input: [-6, 1, -1, 4, -3] → Output: true Input: [4, 4, -2, 3, -6, 10] → Output: false
Complete the method int getMaxRow(int[][] a) to return the index of the "row" in the two-dimensional array a with the highest row sum. (The row sum is the sum of all the elements in a particular row.)
Write the Java method scrambleArray, a void method that returns with the values of given double array scrambled (i.e., randomized).
Consider the following method. /** Postcondition: m is displayed in a rectangular matrix for example: 1 2 3 4 5 6 7 8 public static void displayMatrix (int [] [] m) for (int r = 0; r < m.length; r++) for (int c = 0; c < m.length; c++) System.out.print (m[r] [c] + " "); System.out.println (); Will method displayMatrixsatisfy its postcondition? Yes, but only if the row-size and col-size are identical, No, all the numbers will display in one column. Yes, all the numbers will display in a correct rectangular display. No, because the code will generate an IndexArrayoutofBoundsException error. No, all the numbers will display in one row. ОООО О
Write a method to add two matrices. The header ofthe method is as follows:public static double[][] addMatrix(double[][] a, double[][] b) In order to be added, the two matrices must have the same dimensions and thesame or compatible types of elements. Let c be the resulting matrix. Each elementcij is aij + bij. For example, for two 2 x 2 matrices a and b, c is given. Write a test program that prompts the user to enter two 2 x 2 matrices anddisplaystheir sum. Here is a sample run: ↵EnterEnter matrix1: 1 2 3 4 ↵EnterEnter matrix2: 0 2 4 1The matrices are added as follows1.0 2.0 0.0 2.0 1.0 4.03.0 4.0 + 4.0 1.0 = 7.0 5.0
Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. The array's size may differ from 4. new code can only be added between existing code. as seen in image.
Create four methods named insertionSort(), bubblesort(), mergesort() and quicksort(). Implement the sorting algorithms in the corresponding methods. In the main method, create four arrays a, b, c, d and initialize them with the same values. Pass these four arrays in four different functions. Create four instance variables named insertionSwap, bubbleSwap, countMerge, and countQuickSort and initialize them to 0. In methods insertionSort(), bubblesort() and quicksort(), increment the variables insertionSwap, bubbleSwap, and countQuickSort respectively by one whenever they call the method swap(). In method mergesort(), increment the variable countMerge by one to count the swaps. Use method swap() to swap the values.
Question: Write a java method that take two integer array with the same size. This method suppolsed to return an array that holds merged elements in reverse order. For example: a= 10, 20, 30, 40 b= 50, 60, 70, 80 This method should return: 80 40 70 30 60 20 50 10. Test your method and print out merged array elements. Note: Don't compress your file, just upload source code.