Explanation Given information: A = { a [ 1 ] , a [ 2 ] , ... , a [ n ] } . Calculation: We need to create an algorithm that will check if some relation is transitive. The input will be a relation R on a set A = { a | 1 | , a | 2 | , ... , a | n | } Input: A = { a [ 1 ] , a [ 2 ] , ... , a [ n ] } , R [ a r e l a t i o n o n t h e s e t A ] For each pair of elements ( a , b ) ∈ R and ( b , c ) ∈ R , we will need to check if ( a , c ) ∈ R . if we find some ( a , b ) ∈ R and ( b , c ) ∈ R such that ( a , c ) ∉ R , then the algorithm will need to return that the relation is not transitive, else the algorithm will need to return that the relation is transitive. Algorithm body: a n s w e r : = " transitive" i : = 1 while i ≤ n and a n s w e r = " transitive" j : = 1 while j ≤ n and a n s w e r = " transitive" k : = 1 while k ≤ n and a n s w e r = " transitive" if ( a [ i ] , a [ j ] ) ∈ R and ( a | j | , a | k | ) ∈ R and ( a | i | , a | k | ) ∉ R then a n s w e r : = " not transitive" k : = k + 1 j : = j + 1 i : = i + 1 Finally, the algorithm will return the answer, which is “transitive” or “not transitive”

5th Edition

ISBN: 9780357097717

Author: EPP

Publisher: CENGAGE L

See similar textbooks

Videos

Question

Chapter 8.2, Problem 56ES

To determine

To write a computer algorithm to test whether a relation R defined on a finite set A is transitive or not, where A={a[1],a[2],...,a[n]}.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 8.2, Problem 55ES

Chapter 8.3, Problem 1TY

Students have asked these similar questions

Please help me with these questions. I am having a hard time understanding what to do. Thank you

3) roadway Calculate the overall length of the conduit run sketched below. 2' Radius 8' 122-62 Sin 30° = 6/H 1309 16.4%. 12' H= 6/s in 30° Year 2 Exercise Book Page 4 10 10 10 fx-300MS S-V.PA Topic 1

© © Q Tue 7 Jan 10:12 pm myopenmath.com/assess2/?cid=253523&aid=17... ookmarks 吕 Student Account... 8 Home | Participant... 001st Meeting with y... E F D c G B H I A J P K L N M Identify the special angles above. Give your answers in degrees. A: 0 B: 30 C: 45 D: 60 E: 90 > १ F: 120 0 G: H: 1: 180 0 J: K: L: 240 0 Next- M: 270 0 0: ZÖÄ N: 300 0 Aa zoom P: Question Help: Message instructor MacBook Air Ο O Σ >> | All Bookmarks

Chapter 8 Solutions

DISCRETE MATHEMATICS WITH APPLICATION (

Ch. 8.1 - If R is a relation from A to B, xA , and yB , the...Ch. 8.1 - Prob. 2TY Ch. 8.1 - Prob. 3TY Ch. 8.1 - Prob. 4TY Ch. 8.1 - If R is a relation on a set A, the directed graph...Ch. 8.1 - As in Example 8.1.2, the congruence modulo 2...Ch. 8.1 - Prove that for all integers m and n,m-n is even...Ch. 8.1 - The congruence modulo 3 relation, T, is defined...Ch. 8.1 - Define a relation P on Z as follows: For every...Ch. 8.1 - Prob. 5ES

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

To write a computer algorithm to test whether a relation R defined on a finite set A is transitive or not, where A = { a [ 1 ] , a [ 2 ] , ... , a [ n ] } .

Solution Summary: The author explains how to write an algorithm to test whether a relation R defined on the finite set A is transitive or not.

Videos

To write a computer algorithm to test whether a relation R defined on a finite set A is transitive or not, where A={a[1],a[2],...,a[n]}.

Want to see the full answer?

Chapter 8 Solutions