Explanation Given information: A = { a [ 1 ] , a [ 2 ] , ... , a [ n ] } . Calculation: We need to create an algorithm that will check if some relation is symmetric. 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 ) in R , if we will need to check if ( b , a ) ∈ R . If we find some ( a , b ) ∈ R such that ( b , a ) ∉ R , then the algorithm will need to return that the relation is not symmetric, else the algorithm will need to return that the relation is symmetric. Algorithm body: a n s w e r : = " symmetric" i : = 1 while i ≤ n and a n s w e r = " symmetric" j : = 1 while j ≤ n and a n s w e r = " symmetric" if ( a [ i ] , a [ j ] ) ∈ R

5th Edition

ISBN: 9780357540244

Author: EPP

Publisher: CENGAGE L

See similar textbooks

Videos

Question

Chapter 8.2, Problem 55ES

To determine

To write a computer algorithm to test whether a relation R defined on a finite set A is symmetric 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 54ES

Chapter 8.2, Problem 56ES

Students have asked these similar questions

14. (a) Find all the eigenvalues and their algebraic and geometric multiplicities. (b) Find bases for the corresponding eigenspaces. (c) Is the matrix is diagonalizable? Explain. If it is, then find P and D. 5 2 -9 6

on donne f(x) da fonction derive dhe do fonction fcsos calcule f'(x) orans chacun des Cas sulants: 3 1) f(x)=5x-11, 2- f (x) = ->³ 3-1(x) = x² 12x +π; 4-f(x)=- 5-f(x) = 33-4x6-609)=-3x²+ 7= f(x) = x + 1.8-f(x) = 4 s-f(x) = x++ X+1 -x-1 2 I 3x-4 дево

13. Check to see if the following set of functions is orthogonal on the interval [-3, 3] with respect to the integral inner product. Show all work. Recall that a set of functions is orthogonal if all pairs of functions are orthogonal. Пх COS 3 {cos (), sin().1} 3

Chapter 8 Solutions

WEBASSIGN F/EPPS DISCRETE MATHEMATICS

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 symmetric 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 is symmetric or not.

Videos

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

Want to see the full answer?

Chapter 8 Solutions