Super Scores I am sure all of you know about SAT Superscore. Superscoring is the process by which colleges consider the highest section scores across all the dates a student took the SAT. Rather than confining the scores to one particular date, this approach will take the student's highest section scores, forming the highest possible composite score. Let us solve a generic problem here. Let us start with a sample input and output 2 3
700 800 775 775 800 700 800 800 1600
First line of input specifies 2 sections and 3 takes for this student. So, we need to find the best score for each section across all the test takes & output the best section scores and the corresponding total - next 3 lines show the scores for each section for each take - For this sample input/output, student got 800 in both sections, so the final total is 1600 Your program should be generic to handle any # of sections and any # of takes 2591421130838 5 int main() 6 int nursections, nuntakes, naxScores; cin >> nun sections >> nuntakes; 9 maxScores - new int [numSections); //dynamic memory allocation of arnay! 10 11 // initialize the array 12 for(int 1-e; Icnum Sections; i++) 13 maxScores[1] - ; 14 15 //CODE HERE 16 17 1/output the max score for each section and compute & output total too. 18 int total -e; 19 for(int 1-e; Icnum Sections; 1.) { 20 cout << maxScores[1] << **; 21 total + maxScores[i]; 22 ) 23 cout << total; 24 ) I

What does operator overloading allow you to do?

1. package newton’s method for approximating square roots (case study 3.6) in a function named newton. this function expects the input number as an argument and returns the estimate of its square root. the script should also include a main function that allows the user to compute square roots of inputs until she presses the enter/return key. 2. convert newton’s method for approximating square roots in project 1 to a recursive function named newton. (hint: the estimate of the square root should be passed as a second argument to the function.) 3. elena complains that the recursive newton function in project 2 includes an extra argument for the estimate. the function’s users should not have to provide this value, which is always the same, when they call this function. modify the definition of the function so that it uses a keyword parameter with the appropriate default value for this argument, and call the function without a second argument to demonstrate that it solves this problem. 4. restructure newton’s method (case study 3.6) by decomposing it into three cooperating functions. the newton function can use either the recursive strategy of project 1 or the iterative strategy of case study 3.6. the task of testing for the limit is assigned to a function named limitreached, whereas the task of computing a new approximation is assigned to a function named improveestimate. each function expects the relevant arguments and returns an appropriate value. 5. a list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. define a predicate issorted that expects a list as an argument and returns true if the list is sorted, or returns false otherwise. (hint: for a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return false if the first item in a pair is greater.)

1. so if i wanted to build a linux server for web services(apache) with 1cpu and 2 gb of memory.-operating at 75% of memory capacity2. a windows server with 2 cpu/ 4gb memory- operating at 85% of memory capacity3. a storage server with 1 cpu/ 2gb memory- operating at 85% of memory capacityhow much memory do i have to add for each server.so that the utilization rate for both cpu and memory is at a baseline of 60%."the details for the cpu like its processor or the memory's speed isnt to be concerned" yeah i kept asking my teacher if he's even sure about the but the whole class seems to be confused and the project is due in 3 days..this is a virtualization project where i have to virtualize a typical server into an exsi hypervisor.