The words you are searching are inside this book. To get more targeted content, please make full-text search by clicking here.

•Scissors decapitates lizard •Lizard eats paper •Paper disproves Spock •Spock vaporizes rock •Rock crushes scissors

Discover the best professional documents and content resources in AnyFlip Document Base.
Search
Published by , 2016-01-21 03:18:03

In Class Problem Set #17 - Florida Institute of Technology

•Scissors decapitates lizard •Lizard eats paper •Paper disproves Spock •Spock vaporizes rock •Rock crushes scissors

In Class Problem Set #17

CSE 1400 and MTH 2051
Fall 2012

Representing Relations

1. Consider the rules of “Rock-Paper-Scissors-Lizard-Spock”

• Scissors cuts paper • Scissors decapitates lizard
• Paper covers rock • Lizard eats paper
• Rock crushes lizard • Paper disproves Spock
• Lizard poisons Spock • Spock vaporizes rock
• Spock smashes scissors • Rock crushes scissors

(a) Draw a graph which shows the rules of “Rock-Paper-Scissors-
Lizard-Spock”
Answer: Let R, P, Sc, L, Sp stand for Rock, Paper, Scissors,
Lizard, Spock. The graph of rules is
R

P Sp

Sc L
(b) Construct an adjacency matrix which shows the rules of

“Rock-Paper-Scissors-Lizard-Spock”
Answer: Let R, P, Sc, L, Sp stand for Rock, Paper, Scissors,
Lizard, Spock. The adjacency matrix is

in class problem set #17 2

R P Sc L Sp
R 10 1 1 0
P 11 0 0 1
Sc 0 1 1 1 0
L 01 0 1 1
Sp 1 0 1 0 1

(c) Is the game a partial order? Why or why not?
Answer: The answer is no, the game is not a partial order. I’ve
made the game reflexive by my choice. By looking at the adja-
cency matrix, you can determine that the game is antisymmet-
ric. However, the game is not transitive, which you can see by
looking at the graph. For example, Rock smashes Lizara and
Lizard poisons Spock, but Rock does not beat Spock: The edges
are directed.

(d) Is the game an equivalence? Why or why not?
Answer: The answer is no, the game is not an equivalence rela-
tion. By looking at the adjacency matrix, you can determine that
the game is not symmetric and the game is not transitive.

2. Construct an adjacency matrix for the divides relation on the set
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}.
Answer:

0123456789

01000000000
11111111111
21010101010
30001001001
40000100010
50000010000
60000001000
70000000100
80000000010
90000000001

3. Construct an adjacency matrix for the congruence mod 5 relation
on the set {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}.
Answer:

in class problem set #17 3

0123456789

01000010000
10000001000
20010000100
30001000010
40000100001
51000010000
60100001000
70010000100
80001000010
90000100001


Click to View FlipBook Version