Homework-3-3

Are the functions one to one or onto only? I. f : N → Z : x ↔ x II. f : N → N : x ↔ x III. f : Z → N ∪ {0} : x ↔ |x|

For the mapping f from R to R defined by f(x) = 8 – 2x, which of the following indicate type of function? f is a function which is neither onto nor one-to-one а. f is not a function b. f is a function which is onto but not one-to-one С. f is a function which is both onto and one-to-one d. f is a function which is one-to-one but not onto е.

1

None

Write a Paython program ,Please . Let f be the function from A to B where A={1, 2, 3, 4} and B = {a, b, c, d} with f(1)=d, f(2)=b, f(3)=c, and f(4)=a, then check all the condition for f whether f is:(i) One to one function(ii) Onto function(iii) One to one correspondence function Advance Many Many Thanks dear tutor .

Answer the 2 questions, will upvote if complete, short solution/explanation will dopls do not reject. thanks

Which functions are one-to-one? Which functions are onto? Describe the inversefunction for any bijective function.(a) f : Z → N where f is defined by f (x) = x4 + 1(b) f : N → N where f is defined by f (x) = { x/2 if x is even, x + 1 if x is odd}(c) f : N → N where f is defined by f (x) = { x + 1 if x is even, x − 1 if x is odd}

Program solution in language MATLAB And send the solution as M-file

None

Let f be the function from {p,q,r,s,t} to {3, 4, 5, 6} defined by f(p) = 6, f(q) = 3, f(r) = 4, f(s) = 5 and f(t)=6. (In order to get full credit you have to explain why) i. Is f an onto function? if so why? ii. is fa one-to-one function? if so why? iii. is function f is "one-to-one correspondence"? if so why?

2. Recall that a function is called 1-1 correspondence if it is both 1-1 and onto. Add one more rule to the following program to define a 1-1 correspondence function from A=(1,2,3) to B=(a, b, c). a(1..3). b(a; b; c). (f(x,y): b(y)]=1:- a(X). :-b(Y), not f(Y). NOTE: Submit your rule using the rich text box provided.

Give at least ten (10) examples of a situation where you can relate as a function. Please do not copy the answer from google.

Answer as much as you can

Determine whether each of the following functions f : {a,b,c,d} -> {a,b,c,d} is one-to-one and/or onto.  (a) f(a) = b, f(b) = a, f(c) = b, f(d) = c (b)  f(a) = b, f(b) = b, f(c) = d, f(d) = c (c)  f(a) = b, f(b) = a, f(c) = c, f(d) = d (d)  f(a) = d, f(b) = a, f(c) = c, f(d) = b (e)  f(a) = c, f(b) = d, f(c) = a

explain how the following function works step by stepFunction: computeFa Parameters: a - Dimension a of the scrapper num steps number of steps for determining h Description: Computes the value of TA(a) for the dimension ac by applying the Trapezoidal rule for integrating f(x) from a to ta double computeFa (double a, int num_steps) int i=0; double integral = 0; double interval = (a+a)/num steps: double XL = -a; // left hand side of trapezoid double XR = -a interval; // right hand side of trapezoid while (i<num_steps) integral = integral + ((pow (a, 2) - pow((-XL), 2)) pow (M_E, -((XL) /a)) + (pow (a, 2) pow((-XL), 2)) pow (M_E, -((XL)/a))) interval/2; XL = XR; XR = XR + interval; return (integral);

Expand on the concept of Black Box and then go into detail on primivitive functions:

7. Find a closed form representation for the function defined recursively by f(1)-10 and f(n)=5ƒ(%) + n.

Draw the control flow graph of the code based on the image given

Stuck need help! The class I'm taking is computer science discrete structures.  Problem is attached. please view before answering. Please explain answer so I can fully understand.  Thank you so much!

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

XOR function mappings can easily be classified by decision trees. True False

Select the property(ies) of the given function: f:R – {4}→R – {-1} x+1 f (x) = x- 4 f is one to one None of the proposed answers f is a function O fis bijection f is onto

6. Plot the following function on the K-map: f = bd' + a'bd + + ab'cd'. You have to circle each rectangle that represents a product term in the function and pull a line from each rectangle to specify the corresponding term.

Dynamic Programming: Determine a LongestCommon Subsequence (LCS) for the following two stringsusing dynamic programming approach. You need to illustratethe step-by-step procedure based on a table.‘ncaa tournament’ and ‘north carolina’

Example 2: Let f and g be functions from the set of integers to the set of integers defined by f (x)= 2x+3 and g(x)= 3x+2. What is the composition of f and g, and also the composition of g and f?

Step 1. Intersection over Union   # def intersection_over_union(dt_bbox, gt_bbox):  ---> return iou Step 2. Evaluate Sample    We now have to evaluate the predictions of the model. To do this, we will write a function that will do the following: Take model predictions and ground truth bounding boxes and labels as inputs. For each bounding box from the prediction, find the closest bounding box among the answers. For each found pair of bounding boxes, check whether the IoU is greater than a certain threshold iou_threshold. If the IoU exceeds the threshold, then we consider this answer as True Positive. Remove a matched bounding box from the evaluation. For each predicted bounding box, return the detection score and whether we were able to match it or not. def evaluate_sample(target_pred, target_true, iou_threshold=0.5): # ground truth gt_bboxes = target_true['boxes'].numpy() gt_labels = target_true['labels'].numpy()   # predictions dt_bboxes =…

Define upper bound. If f(n) = 3n * 5 for what values of C and n this function is said to be upper bounded.

Answer question number four please.

If f:A->B and g:B->C, does there exist a function h:B->A such that f•k=g (composition)?

Write a Paython program , without using def function Please . Let f be the function from A to B where A={1, 2, 3, 4} and B = {a, b, c, d} with f(1)=d, f(2)=b, f(3)=c, and f(4)=a, then check all the condition for f whether f is:(i) One to one function(ii) Onto function(iii) One to one correspondence function Advance Many Many Thanks dear tutor .