Definition of :
Function — is a relation between two sets that associates every element of the first set to exactly one element of the second set.
Domain — is the set of all possible inputs for the function.
Codomain — is the set of its possible outputs.
Range — is the set of the images of all elements from the domain.
Well defined (unambiguous) function — is a function, which gives the same result when the representation of the input is changed without changing the value of the input.
Types of functions:
Injective (one-to-one) function — is a function, where each element of the codomain is mapped to by at most one element of the domain.
Surjective (onto) function — is a function, where each element of the codomain is mapped to by at least one element of the domain.
Bijective (one to one and onto) funtion — is a function, where each element of the codomain is mapped to by exactly one element of the domain.
Composite function — is a function that takes two functions f(x) and g(x) and produces a function h(x), such that h(x) = g(f(x)).
Comments
Dear Osaf Ahmed, please use the panel for submitting a new question.
Suppose that each student in a discrete structures class is assigned a letter grade from the set {A, B, C, D, F}. And suppose that the grades are A for Asim, C for Iqbal, B for Naeem, A for Mobeen, and F for Sohail. a. Draw set of Domain, set of Co-domain and function (mapping) between Domain and Codomain. b. Write down the Range of the function. c. Label the type of the function.
Leave a comment