Question

In: Computer Science

1.            Determine whether the function f from { a, b, c, d } to {a,...

1.            Determine whether the function f from { a, b, c, d } to {a, b, c, d, e} is injective (one-to-one), surjective (onto) and/or bijective (one-to- one correspondence) :

f(a) = a,            f(b) = c,            f(c) = b, f(d) = e

a. Is this function injective?              . surjective?              . bijective?              .

If your answer is no for any of the above, explain:

            b. Is there an inverse for this function?              .

c. Is the composition f ° f always defined?              . Explain:  

2. Determine whether the function from { a, b, c, d } to itself is injective (one-to-one), surjective (onto) and/or bijective (one-to- one correspondence) :

f(a) = a,            f(b) = c, f(c) = b, f(d) = d

a. Is this function injective?              . surjective?              . bijective?              .

If your answer is no for any of the above, explain:

            b. Is there an inverse for this function?              .

c. Is the composition f ° f always defined?              .

3. Determine whether the function from { a, b, c, d } to {a, b, c} is injective (one-to-one), surjective (onto) and/or bijective (one-to- one correspondence) :

f(a) = a,            f(b) = c, f(c) = b, f(d) = a

a. Is this function injective?              . surjective?              . bijective?              .

If your answer is no for any of the above, explain:

b. Is there an inverse for this function?              .

c. Is the composition f ° f always defined?              .

Solutions

Expert Solution

It's an injective function as we can confer from the figure above . It's not surjective because for d in co-domain there is no element in the domain.And for a function to be bijective,it should be injective as well as surjective.

1b.) No,an injective function doesn't have an inverse.If you make it inverse, the current co-domain will be the domain and the current domain will be changed to co-domain. So as there can be no element in the domain of a function without being related to an element of the co-domain, it will not be a function.

1c.)No ,the composition is not always defined because in case f(f(d))=

F(d)=e. (given) .On replacing we get -> f(f(d))=f(e)

And f(e) is not defined.so composition can't be defined.

​​​​​​

It is a bijective function(both injective and surjective).

2b.)Yes ,there is an inverse for a bijective function.

2c.) Yes composition will be defined in this case.

It is a surjective function (onto) as for every element y in co-domain ,there is at least one element in the domain.It is not an injective function because a has more than one element in the domain.

1b.)No it doesn't have a inverse

1c.)Yes composition is defined.


Related Solutions

Assume that: float a, b, c, d, f; and variables b, c, d, f are initialized....
Assume that: float a, b, c, d, f; and variables b, c, d, f are initialized. Write a line of c++ code that calculates the formula below and stores the result to the variable a:
Given a Boolean function: f(a,b,c,d) = m(1,6,7,10,12)+dc(3,4,9,15). i) Design a circuit for implementing f(a,b,c,d) with ONE...
Given a Boolean function: f(a,b,c,d) = m(1,6,7,10,12)+dc(3,4,9,15). i) Design a circuit for implementing f(a,b,c,d) with ONE 4-to-1 MUX and other basic logic gates. USE a and b as select inputs. ii) Draw the circuit. iii) Write the VHDL code for a 4-to-1 MUX, named “mux_4to1”, with input: a, b, c, d, s0, s1; and output: z. iv) Write the complete VHDL code for the above circuit in part (iii), named “Boolean_MUX”.
Find a, b, c, and d such that the cubic function f(x) = ax3 + bx2...
Find a, b, c, and d such that the cubic function f(x) = ax3 + bx2 + cx + d satisfies the given conditions. Relative maximum: (3, 21) Relative minimum: (5, 19) Inflection point: (4, 20)
Find a, b, c, and d such that the cubic function f(x) = ax3 + bx2...
Find a, b, c, and d such that the cubic function f(x) = ax3 + bx2 + cx + d satisfies the given conditions. Relative maximum: (3, 12) Relative minimum: (5, 10) Inflection point: (4, 11) a= b= c= d=
Find a, b, c, and d such that the cubic function f(x) = ax3 + bx2...
Find a, b, c, and d such that the cubic function f(x) = ax3 + bx2 + cx + d satisfies the given conditions. Relative maximum: (3, 9) Relative minimum: (5, 7) Inflection point: (4, 8) a =    b =    c =    d =
Minimize the function with K-Map- F(A,B,C,D)= ПM(0,2,4,5,6,7,9,12).d(3,14)    Design full adder with 4:1 MUX gates
Minimize the function with K-Map- F(A,B,C,D)= ПM(0,2,4,5,6,7,9,12).d(3,14)    Design full adder with 4:1 MUX gates
Use DeMorgan's law and Involution law to find the complement of the following function: f(A,B,C,D) =...
Use DeMorgan's law and Involution law to find the complement of the following function: f(A,B,C,D) = [A+(BCD) ' ] [ (AD) ' + B (C ' + A) ]
Write a program in java to determine whether a given function F from the set {0,1,2,3,...,m}...
Write a program in java to determine whether a given function F from the set {0,1,2,3,...,m} to (0,1,2,3,...,n} is one-to-one and/or onto. The inputs to your program will be: - an integer m - an integer n, and - a two dimensional boolean array F of size (m+1) x (n+1), where F[ i , j ] = 1 if F(i) = j.
Write a C++ program to determine the sum of two 1-D matrices: A = [a b...
Write a C++ program to determine the sum of two 1-D matrices: A = [a b c d] B = [e f g h] The user will provide the values of a to h.
Determine the best distribution (minimum transportation costs) from suppliers A, B, C, and D to the...
Determine the best distribution (minimum transportation costs) from suppliers A, B, C, and D to the five outlets Dallas, Phoenix, Portland, Montreal, and Orlando. Two-stage distribution problem: RIFIN Company has recently developed a new method of manufacturing a type of chemical. The method involves refining a certain raw material that can be obtained from four overseas suppliers, A, B, C, and D, who have access to the four ports at Vancouver, Boston, Miami, and San Francisco, respectively. RIFIN wants to...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT