Write a static function called "normalize" that takes a two-dimensional (2D) array of integer elements and returns normalized 2D array of elements of type double. For normalizing, the method should divide each input element with its row average (i.e., mean). For example, if a row is {1, 2, 3} then mean is (1+2+3)/3 = 2.0, and the row in result array should be {1/2.0, 2/2.0, 3/2.0} i.e., {0.5, 1.0, 1.5}. Here is the full example of 2D array: normalize(new int[][]{{1,2,3}, {3,4,5}}) should return {{0.5, 1.0, 1.5}, {0.75, 1.0, 1.25}}.

Write a static function called "normalize" that takes a two-dimensional (2D) array of integer elements and returns normalized 2D array of elements of type double. For normalizing, the method should divide each input element with its row average (i.e., mean). For example, if a row is {1, 2, 3} then mean is (1+2+3)/3 = 2.0, and the row in result array should be {1/2.0, 2/2.0, 3/2.0} i.e., {0.5, 1.0, 1.5}. Here is the full example of 2D array: normalize(new int[][]{{1,2,3}, {3,4,5}}) should return {{0.5, 1.0, 1.5}, {0.75, 1.0, 1.25}}.

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

Implement a C function, named median, that receives two arrays as parameters passed and returns the median of the values stored in these two arrays. The two arrays are sorted. The prototype of the function MUST be: double median(int a[], int b[], int sizeA, int sizeB);For example, if I have int a[] = {1, 2, 10, 12, 100}; and int b[] = {3, 11, 20, 500, 600}; then the median is (11+12)/2 = 11.5.
Write a function that gets an array of points and sorts the array using qsort(). Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)½ is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation: (1,1) is first because 12+12=2 is the smallest (3,2) is next because 32+22 = 13 is the second smallest Both (3,4) and (5,0) have the same sum of squares, 25, but 3<5 so…
Write a program that creates an array of size 6 and input values to it through user input. It turnsout that these values that the user inputs were biased, and had an offset relative to the index ofthe array (for example, the first value had no bias since index = 0, the second value had a bias of 1since index = 1, and so on...).Pass this array to a function, that should remove the bias from each value by subtracting the biasfrom the original value. You need to subtract values using a for loop.Print the updated values of the array in the main function after the call to this bias removerfunction.
Write a function is ordered that takes an integer array and its size as parameters and returns true if the array elements are ordered in nondecreasing order and returns false if not. For example, integers in {10,0,1,1,5,1009} are ordered in nondecreasing order. On the other hand, integers in {1, 2, 3, 8, 4, 19} are not since 8 > 4
Write a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…
You are asked to write a C function that finds the longest sequence of increasing numbers in an array. You should implement a function that receives an array passed as a parameter, and prints the longest sequence of increasing numbers. The prototype of the function MUST be: void longestSequence(int a[], int sizeA); For example, we have an int array with values as 1, 3, 10, -1, 7, 6, 10, 30, 0. Your code should identify the longest sequence of increasing numbers and print Longest sequence is -1, 7, 6, 10, 30. Array size cannot be 0
Implement a function GetMinimumCutSegments(int[] arr, int k) that takes in an array arr of positive integers and an integer k, and returns the minimum number of contiguous segments of the array that must be concatenated to form an array of size k. The function should return -1 if it is not possible to create an array of size k by concatenating contiguous segments of the input array. Example: Input: [1, 2, 3, 4], 6 Output: 2 Explanation: The minimum number of contiguous segments that must be concatenated to form an array of size 6 is 2. The two segments that can be concatenated are [1, 2] and [3, 4]. Input: [1, 2, 3, 4], 7 Output: -1 Explanation: It is not possible to create an array of size 7 by concatenating contiguous segments of the input array. Constraints: The input array arr will have at most length 100. The integer k will be at least 1 and at most 10^6. Can you write a C# function that solves this problem? public int GetMinimumCutSegments(int[] arr, int k) { // Your code…
Write a function that gets an array of ints of length n, and a number k, and returns the longest subsequence of consecutive k’s in the array. For example - On input ([1, 1, 3, 3, 3, 1, 5, 1], 1), the function returns 3 - On input ([1, 3, 3, 2, 3, 3, 3, 3], 3), the function returns 4 - On input ([3, 5, 2, 5, 2, 5, 5], 3), the function returns 2 - On input ([1, 2, 3, 3, 3, 3], 5), the function returns 0 // returns the length of the longest subsequence // of consecutive k’s in the array int longest_seq(const int* ar, int n, int k); test for the function: void test_q1() { inta1[] = {1, 1, 3, 3, 3, 1, 5, 1}; if (longest_seq(a1, 8, 1) == 2) printf("Q1-1 ok\n"); else printf("Q1-1 ERROR\n"); inta2[] = {1,3,3,2,3,3,3,3}; if (longest_seq(a2, 8, 3) == 4) printf("Q1-2 ok\n"); else printf("Q1-2 ERROR\n"); }
Write a function template that gets an array of generic type T as well as the number of items within the array, calculates the standard deviation of the items within the array and returns it. The user will first give an integerItemCount value (int) and that many integer values (all ints). Then, the user will give a doubleItemCount value (int) and that many double values (all doubles). Then, the program will use the function template to calculate the standard deviations of both arrays and print them out as first the standard deviation of the int array, then the standard deviation of the double array. Standard deviation of an array with size N, values are given as , and arithmetic mean as μ can be calculated as: Requirements: You MUST define and use a function template that takes an array of generic type T and an integer which defines the size of the array Getting all the user input, calling the appropriate version of the function via the template and printing the output should be done…
Write a function called remove_punct() that accepts an array of characters and the number of items in the array as parameters, removes the punctuation (',', '!', '.') characters from the array, and returns the number of punctuation characters removed. For example, if the array contains ['C', 'p', 't', 'S', ',', '1', '2', '1', '.', 'i', 's', 'f', 'u', 'n', '!'], then the function should remove the punctuation characters. The function must remove the characters by shifting all characters to the right of each punctuation character, left by one spot in the array. This will overwrite the punctuation characters, resulting in: ['C', 'p', 't', 'S', '1', '2', '1', 'i', 's', 'f', 'u', 'n']. In this case, the function returns 3. Note: if the array does not contain any punctuation characters, then the array is unchanged and the function returns 0.
Write a function/ program that produces the following: int findDifference(const string a1[], int n1, const string a2[], int n2); Return the position of the first corresponding elements of a1 and a2 that are not equal. n1 is the number of interesting elements in a1, and n2 is the number of interesting elements in a2. If the arrays are equal up to the point where one or both runs out, return the smaller of n1 and n2. Notwithstanding each function's behavior described below, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array. Here's an example: string cast[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; string roles[4] = { "samwell",…
Write a function that gets a 2-d array of ints arr[height][width], and returns an array SUM of length height such that SUM[i] contains the sum of all values in the i’th row of the array. For example - On input {{ 1, 2, 3}, {4, 7, -2}, {9, 10, 11}, {1, 5, 4}}; the function returns { 6, 9, 30, 10} // returns array SUM with SUM[i] = sum in the i’th row int* sum_row(int height, int width, const int ar[height][width]); Test for the function: void test_q2() { intar[4][3] = {{1, 2, 3}, {4, 7,-2}, {9,10,12}, {1, 5, 4}}; int* m = sum_row(4,3, ar); intm0 = m[0]; intm1 = m[1]; intm2 = m[2]; intm3 = m[3]; free(m); // checking dynamic memory allocation if (m0==6 && m1==9 && m2==31 && m3==10) printf("Q2 ok\n"); else printf("Q2 ERROR\n"); }