Write a cpp program and define two arrays, one with the name of “old marks" and one with the name of “updated marks". Generate the marks with the rand() function and with a check that it should not generate a number greater than 100 and less than 20 for each array. Each value generated by rand() function should be stored in the respective arrays. After storing the randomly generated marks in updated array, add all the marks in old array and in the updated array separately. Take an average of old array marks and take an average of updated array marks and find that updated marks are better than old marks or not. Note: Pass all the values as arguments to the function named “chuck"

Write a cpp program and define two arrays, one with the name of “old marks" and one with the name of “updated marks". Generate the marks with the rand() function and with a check that it should not generate a number greater than 100 and less than 20 for each array. Each value generated by rand() function should be stored in the respective arrays. After storing the randomly generated marks in updated array, add all the marks in old array and in the updated array separately. Take an average of old array marks and take an average of updated array marks and find that updated marks are better than old marks or not. Note: Pass all the values as arguments to the function named “chuck"

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 C++ function, lastLargestIndex, that takes as parameters an int array and its size and returns the index of the last occurrence of the largest element in the array. Also, write a program to test your function.
Write a program to sort the elements in 1D array in descending order and also implement linear search on the same array. Both sorting and searching operations should be done inside user-defined function: "Task". So,for achieving the required functionality,pass,array into the function: Task () from main () using pass by reference/or address approach.
Write a C++ function, bool ok(int q[]), which takes an array q and returns true if the array represents a valid configuration of the eight queens and returns false otherwise.
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, largestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the largest element in the array. Also, write a C++ program to test your function.
Write a function that receives a two-dimensional array, prints out the data by row along with the sum of the row values. Each value should be printed separated by a space. After the last element in the row has been printed, the sum should be printed on the same line, followed by a newline.
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.
Implement a range function for a dynamic array which returns a new dynamic array that is a subset of the original. input parameters: array - (the array and any related parameters) start - index of the first elementend - index of the last elementInterval - An integer number specifying the incrementation of index This function returns a new dynamic array containing the elements from the start thru the end indices of the original array.All array indexing must be done using pointer arithmetic. For example, given the array: 49 96 99 47 76 29 22 16 30 22 If the start and end positions were 5 and 9 with step 2, return a new dynamic array: 29 16 22 Please use following main to test your function. int main(){int *p = new int[10]{49,96,99,47,76,29,22,16,30,22}; int *q = range(p,10,5,9,2);for(int i=0;i<3;i++) cout<<q[i]<<" "; // print 29 16 22 cout<<endl;delete [] q;q = range(p,10,1,8,3); for(int i=0;i<3;i++)cout<<q[i]<<" "; // print 96 76 16 cout<<endl;…
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…
Write a function that takes two int arrays arr1 and arr2, and their size n as parameters. The functionreturns the number of elements that exist in arr1 and arr2 with indexes i1 and i2 respectively such that i1>=i2.(Example: arr1: [ 1,5,2,3,4,0,7] arr2: [0,1,3,7,4,2] then the function returns 3 ( 0,3,7) )
Write a C function and program that calculates the array size after deleting a certain element of a 10-element integer array from the array. Sample: Series: 1 2 2 3 4 4 5 5 6 6 Array size after 4 deleted: 8 Note: A CALL BY REFERENCE function will be written. The element we want to delete will be entered by the user. The entered number can be repeated more than once in the array, the asking array size will be calculated after all duplicates are deleted.
Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true.If no such element is not found, the function returns -1.int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A.void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: Start with accumulator = A[0] For i=1...length-1 compute accumulator=f(accumulator, A[i]) Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array.int reduce(int* A, int n, int (*f)(int,int));