Problem description: create a dynamic 2d array class. this class should overload the call operator () for the following behaviors: return (modifiable) lvalue element for a non-const object return (read-only) rvalue element for a const object return a copy of the data values for row return a copy of all the data as a 1d vector create a testscores class which uses a dynamic 2d array object as an internal data structure. this class should have the following behaviors: get the scores for a given student get the average score for a given student get the class average get the standard deviation for the class create a bandpassfilter which allow only scores within one-sigma to pass through. answer the questions: how many scores passed through? what percentage is this? how does this compare to a normal distribution? demonstrate your classes with a testscores object which has 15 students with five(5) test scores each. generate scores between 45 and 100 using a random generator. document your code, tell me what you are doing, and make it readable. quality of craftsmanship is part of the grading.

The idea that, for each pair of devices v and w, there’s a strict dichotomy between being “in range” or “out of range” is a simplified abstraction. more accurately, there’s a power decay function f (·) that specifies, for a pair of devices at distance δ, the signal strength f(δ) that they’ll be able to achieve on their wireless connection. (we’ll assume that f (δ) decreases with increasing δ.) we might want to build this into our notion of back-up sets as follows: among the k devices in the back-up set of v, there should be at least one that can be reached with very high signal strength, at least one other that can be reached with moderately high signal strength, and so forth. more concretely, we have values p1 ≥ p2 ≥ . . ≥ pk, so that if the back-up set for v consists of devices at distances d1≤d2≤≤dk,thenweshouldhavef(dj)≥pj foreachj. give an algorithm that determines whether it is possible to choose a back-up set for each device subject to this more detailed condition, still requiring that no device should appear in the back-up set of more than b other devices. again, the algorithm should output the back-up sets themselves, provided they can be found.\