Question: (c) Consider the following binary relation R C S x S, where S = {a, b, c, d, c, f, g): R = {(a, a),

(c) Consider the following binary relation R C S x S, where S = {a, b, c, d, c, f, g): R = {(a, a), (a, b), (b, a), (b, d), (c, b), (d, a), (d, c). (e, f), (f.e ), (f.g) ). This relation can be represented by a directed graph as below. e i. (2 marks) What is the minimum number of elements in S x S you need to add to make R reflexive? ii. (2 marks) symmetric? iii. (3 marks) Pick a minimion number of elements in S x S to add to R to make it become transitive

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!

Let the alphabet \ Sigma = { a , b } . Recall that a string x in \ Sigma is called a palindrome if x = xr ( x reads the same backward as forward ) . ( a ) Consider the following binary relation R on...

Let the alphabet = {a,b). A string r E . is called a palindrome if x = rr (z reads the same backward as forward); for example, the string abaaaba is a palindrome. Consider the following binary...

1. [10 points (a) [6 points] Let the alphabet -{a, b). A string z E , is called a palindronne if z-rr (r reads the same backward as forward); for example, the string abaaaba is a palindrome. Consider...

1. Consider the following binary relation R: {(a, a), (c, d), (d, b) } where each ordered pair belongs to the Cartesian product {a, b, c, d} x {a, b, c, d}. a . b . . b C. d . . d (a) Draw the...

Problem 1 (1 point) Let A = {a, b, c, d} Write a binary relation R on set A where |R| = 4. Problem 2 (2 points each) Let R1 = {(1, 2), (2, 3), (3, 4)} R2 = {(1, 1), (1, 2), (2, 1), (2, 2), (2, 3),...

1. (Warming Up) a. Let the function f : N - N be defined by f(n) = 3 . n i. Give Dom(f). Codom(f ) and Im(f). ii. Is f one -to-one ? Is it onto ? iii. Does f-1 exist ? iv. Compute (f . f)(1) and both...

Consider the following binary relation: Bundle (x1, x2) is weakly preferred to (y1, y2), i.e., (x1, x2) > (y1, y2) if and only if max{x1, x2} > max{y1, y2}. Show whether or not this relation is (a)...

Consider the following binary relation: Bundle (x1; x2) is weakly preferred to (y1; y2), i.e., (x1; x2) weakly preferred (y1; y2) if and only if min ofx1; x2g > min ofy1; y2 . Show whether or not...

Consider the following binary relation 5 , defined over the set of all NFAs by setting, for any NFAs M 1 , M 2 : Mi 5 M 2 iff L ( M ) C L ( M 2 ) That is , Mi 5 M 2 iff the language recognised by M...

Consider the following binary relation 5, defined over the set of all NFAs by setting, for any NFAs M1, M2: M M iff L(M) C L(M2) That is, M M2 iff the language recognised by M is a subset of the...

Wide Angle Bhd is constructing a new office building at a cost of RM2 million. When building is in the final stage of completion Wide Angle Bhd faces financial difficulties as the company needs a...

Mark each of the following statements as valid or in valid. If a statement is invalid explain why. a. A=B; b. list->link = A -> link; c. list -> link->info = 45; d. *list = B; e. *A = *B;...

Now it's time for you to practice what you've learned. Suppose that a stock is expected to pay a dividend of $ 4 . 7 0 at the end of this year and it is expected to grow at a constant rate of 3 . 5 0...

what are some other things to consider when designing a website.

2. Now change the performance so that you play out the dream in your inner the-atre. Apply colours to the images you envision. Give some pictures a stronger colour than others and vice versa. Also...

1. Imagine that you have already achieved a dream or a goal you have set for yourself. Both the goal and the dream correspond to your basic values. Try to visualize this dream or goal. What do you...

4. What means will you use to achieve these values?