Count the total number of different one-to-one functions from the set {0, 1} into the set {1, 2, 3,..., 9}.

Matlab Question Write a function to return the index of the value that is nearest to a desired value. The function declaration should be: ind = FindNearest(x, desiredVal). x can be a vector or matrix, and desiredVal is the scalar value you want to find. Do not assume that desiredVal exists in x, rather find the value that is closest to desiredVal. If multiple values are the same distance from desiredVal, return all of their indices. Test your function to make sure it works on a few vectors and matrices. Useful functions are abs, min, and find. Hint: You may have some trouble using min when x is a matrix. To convert a matrix A into a vector you can use the expression b = A(:). Then, expression minVal = min(b) will give you the minimum value in A. To find where this minimum occurs in A, do inds = find(A == minVal);.

Define a MATLAB function named getAndReturnVectorElements() that would accept one vector of any size as the argument. The getAndReturnVectorElements() function should get only the 3rd, 6th, and 9th elements of the vector passed to it and return those 3 elements as a vector (assuming the vector passed to the function does have those elements). The function MUST return a vector. The function should NOT print anything. Note: Do NOT use vectorized code. Other than the built-in functions listed above, do NOT use any built-in functions. You MUST use the "programming concept" method of writing code. For example, if I call the getAndReturnVectorElements() function and pass the [1 2 3 4 5 6 7 8 9 10] vector to it, then the function would return the [3 6 9 ] vector. If I call the getAndReturnVectorElements() function and pass the [88 44 22] vector to it, then the function would return the [22] vector. If I call the getAndReturnVectorElements() function and pass the [88...

Define predefined functions.

In your own words, discuss when a piecewise function is being used.

Please write the function using SML -

For the following nested definitions of functions f1 and f2, how is the nesting link of each activation record of the called function set? Here it is assumed that random() function generates a random integer. function f1() { int x1; function f2() { int x2 = random(); if x1 – x2 <=0 return x1 + x2; else f2(); } }

Compute and print the sum and average of a collection of floating-point data items numItems, numItems, numItems sum average sum, sum numItems average Read the number of data items Compute the sum Compute the average Print the sum and the average computeSum computeAve printSumAve You have been asked to accumulate a sum and to average a list of data values using functions. Because these tasks surface in many problems, design a general set of functions you can reuse in other programs. • The problem is described and analyzed in the lecture slides. You will prompt a user to enter some numbers that you will accumulate, find their sum and average. You will rely on the functions in the accompanying figure to accomplish this. You will display the sum and average of these numbers before you exit the program. Upload a file with the source code of your program after you have tested it. Show me a working program during the lab or during my office hours.

Build a database of predefined function presets.

How do high-order functions differ from pure functions?

Explain an example how to use predefined functions.

4. Which function calls would provide the most helpful test of this function? Remember: With tests, you are attempting to figure out all the possible ways the function could be broken. function findMin(num1, num2){ if(num1 < num2){ return num1; } else { return num2; } } function findMin (num1 num2 if( numl < num2 ) return numl } else ( return num2 O A. findMin(-1, 0) findMin(2,4) findMin(5,10) Ов. findMin(5,3) findMin(7,2) findMin(5,1) O C. findMin(1,1) findMin(-2,2) findMin(0,3) O D. findMin(-1,1) findMin(1,-1) findMin(1,1)

Write a function solver that takes a non-negative integer upper_bound as an argument, and prints all non-negative integers i line-by-line in ascending order such that i is at most upper_bound, and i+100 and i+268 are perfect squares. Note that the function solver prints the numbers instead of returning them, but you may want to define a helper function is_perfect_square to return whether a number is a perfect square.