Question 1:Determine the most accurate O(...) bound for each function and explain how you calculatedit. You may assume that the functions take an array a of size n as input.1 int max(int* a, int size)2 {345678910111213141516 }4567 W N3891 int maxElement (int* a, int size)2101112 }56789if (size < 2){}if (a [0] > a[1]){return a [0];1011121314}else{}151617 }return -1;return a [1];int max = a [0];for (int i = 1; i < size; i++){1 int maxSubseqSum (int* a, int size)2 {34if (a[i] > max){max = a[i];}}return max;Page 2 of 5int max =a [0];for (int i = 1; i < size; i++)sum =0;for int j i; j < size; j++){}sum = sum + a[j];if (sum > max){}}return max;max = sum;

In this answer, we will be analyzing various functions to determine their time complexity. We will…

Question 1: Determine the most accurate O(...) bound for each function and explain how you calculated it. You may assume that the functions take an array a of size n as input. 1 int max(int* a, int size) 2 { 3 4 120 60 5 7 8 9 10 11 12 13 14 15 16 } 123456 2 { 7 8 9 10 11 12} 1234LO CON (b) 1 int maxElement (int* a, int size) 1 int 2 { 5 6 if (size < 2) { return -1; 7 8 9 10 11 12 13 14 15 16 17} if (a [0] > a [1]) { return a [0]; } else } return a [1]; int max = a [0]; for (int i = 1; i < size; i++) { if (a[i]> max) { a[i]; } max = return max; maxSubseqSum (int* a, int size) a [0]; for (int i = 1; i < size; i++) { int max = } Page 2 of 5 sum = 0; for (int j = i; j < size; j++) sum sum + a[j]; if (sum max) { } return max; max sum;

Question 1: Determine the most accurate O(...) bound for each function and explain how you calculated it. You may assume that the functions take an array a of size n as input. 1 int max(int* a, int size) 2 { 3 4 120 60 5 7 8 9 10 11 12 13 14 15 16 } 123456 2 { 7 8 9 10 11 12} 1234LO CON (b) 1 int maxElement (int* a, int size) 1 int 2 { 5 6 if (size < 2) { return -1; 7 8 9 10 11 12 13 14 15 16 17} if (a [0] > a [1]) { return a [0]; } else } return a [1]; int max = a [0]; for (int i = 1; i < size; i++) { if (a[i]> max) { a[i]; } max = return max; maxSubseqSum (int* a, int size) a [0]; for (int i = 1; i < size; i++) { int max = } Page 2 of 5 sum = 0; for (int j = i; j < size; j++) sum sum + a[j]; if (sum max) { } return max; max sum;

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

What will the following function produce when it is called with the following array? a=1:1:9 switch_even_odd(a) Function shown below: function retval = switch_even_odd (A) for i=1:length(A) switch (A(1)) case { 1,3,5,7,9 } A(i) = A(i) + 1; case { 0,2,4,6,8 } A(i) = A(i) + 1; case "str" printf ("variable is a string\n"); otherwise printf ("variable is neither a single digit or even or odd\n"); endswitch endfor retval = Aendfunction
Write a function int mark(char key),char answer(]) The function will be used to grade multiple-choice exam. The exam has 6 questions, each answered with a letter in the range 'a', to 'f'. All the answers for a student are stored in the character array answer. The key-answer is also stored in array key. Both arrays (answer) and (key) are passed to the function mark as parameters. The function mark returns the number of correct answers given by by the student. For example if the key is={'a','b','a','d','e','c'}, and the answer is {'a','c','a','d','f','d'}. the function returns 3 (since there are 3 correct answers).
A set of data is given with the rebound height of tennis balls in centimeters from height 250cm (data.txt). Write three MatLab user-defined functions: usersort, GroupData and MeanStD. The function xo = usesort(x) should be able to sort an array in ascending order, the function [f, X] = GroupData(x) should create labels of the data and should return the labels X and the number of data for each label f and the function [A,s] = MeanStD(x) should return the mean value and the standard deviation as defined by the last equations in the slides 11 and 12. The labels X should start from the smallest round integer (use fix in MatLab) and should go until the largest round integer (use fix) with interval equal to 1. Each label should count the points that are smaller by half interval until larger by half interval. Calculate the density function of the Gauss distribution and define the following probabilities that a randomly chosen value of x will be: (i) no greater than 174cm, (ii) between 174cm…
write by c programing ID: 53632 Define a function F1 that takes an array of integer Arr[] of size equal to your student ID as formal parameter and performs the following: • Initialize elements of array Arr with your student ID. • Declares local 1D array B of size equal to your student ID and prompts the user to fill the array B with integers between 50 and 15000. • Using a for loop, the function counts and prints the values less than or equal to your student ID in the array B. The function then returns the count.
Define the following function that takes an array of integers to fill it with randomly created integers between the given range. The second argument of the function is the size of the array, "first" is the first value for random integers and "nums" is the number of terms in the given range. (i.e., when first is 10 and nums 35, the range will be between [10-44]) The function also returns the minimum value in this array. int myRandArr(int arr[], int size, int first, int nums); Write the main function to create an array and test your function. For this purpose, create and integer array between the range [-15-15] and display values together with the minimum value. Sample Output: Elements of randomly created array: 4 13 -11 -12 -2 The min of those values: -12
Write a program to solve quadratic equations for real roots. No need to use imaginary numbers. ax^2 +bx +c= 0 Requirements:-Define an array of type double with size 3 in main() to store the 3 coefficients.-Read the 3 coefficients from user input.-Create the function prototype and definition for the function getRootCount(discriminant, coefficients) Parameters: discriminant: output to be calculated by the function coefficients: input array of 3 coefficients Return: number of roots: 0, 1, or 2 -Create the function prototype and definition for a function to determine the numbers of roots: getRootCount(discriminant, coefficients); Parameters: discriminant: output value to be calculated by the function (reference parameter) coefficients: input array of 3 coefficients Return: number of roots: 0, 1, or 2 (int) -Create the function prototype and definition for a function to solve equations and get the root(s): solveEquation(discriminant,…
Write a function using Java Function Name: winInRowParameters: board: 2D integer array, row: integer, piece: integerReturn: booleanAssume board is valid 2D int array, row is valid index in the board, piece is X==1/O==2Look at indicated row at given index in board. If that row has at least 3 consecutive entries withgiven type of piece (X/O) (3 in a row XXX, OOO), then return true, otherwise false.
Consider the following function reverse, that attempts to reverse an array in place (i.e. without the use of additional storage). It does it by interchanging the first and last elements, then the second and second from last etc. All of the interchanges are done by calling function interchange. Here are the two functions and a main program: (See attachement) When I run the program, I expect to see the output reverse the array, but it doesn’t. Why? What very simple change will fix it (so the program will print 3, 2, 1, ) and explain your change.