retagged by
1,741 views
4 votes
4 votes

On a set $A = \{a,b,c,d\}$ a binary operation $*$ is defined as given in the following table.

$$\begin{array}{|c|cccc|}\hline\text{*}&a&b&c&d\\\hline \text{a}&a&c&b&d\\\text{b}&c&b&d&a\\\text{c}&b&d&a&c\\\text{d}&d&a&c&b\\\hline   \end{array}$$

The relation is

  1. Commutative but not associative
  2. Neither commutative nor associative
  3. Both commutative and associative
  4. Associative but not commutative
retagged by

5 Answers

2 votes
2 votes
$A$  is correct.

Work through some examples. Like  $a*b=b*a=c$,  $c*b=b*c=d$ and so on.

It is not associative w.r.t this example:   $(a*b)*c=c*c=a$  but $a*(b*c)=a*d=d$,  which are not equal.
Answer:

Related questions

3 votes
3 votes
1 answer
1
admin asked Mar 31, 2020
762 views
Which one of the following is NOT necessarily a property of a Group?CommutativityAssociativityExistence of inverse for every elementExistence of identity
1 votes
1 votes
4 answers
2
admin asked Mar 30, 2020
938 views
The number of integers between $1$ and $500$(both inclusive) that are divisible by $3$ or $5$ or $7$ is _________.$269$$270$$271$$272$
0 votes
0 votes
1 answer
3
admin asked Mar 30, 2020
2,658 views
In how many ways $8$ girls and $8$ boys can sit around a circular table so that no two boys sit together?$(7!)^2$$(8!)^2$$7!8!$$15!$
0 votes
0 votes
1 answer
4
admin asked Mar 30, 2020
2,312 views
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to:$15$$30$$56$$...