Aspire Faculty ID #18839 · Topic: UGC NET Computer Science Nov 2021 (Paper II) · Just now
UGC NET Computer Science Nov 2021 (Paper II)

Let $(X,*)$ be a semigroup. Furthermore, for every $a$ and $b$ in $X$, if $a\ne b$, then $a*b\ne b*a$.

Based on the defined semigroup, choose the correct equalities from the options given below.

A. For every $a$ in $X,\ a*a=a$

B. For every $a,b$ in $X,\ a*b*a=a$

C. For every $a,b,c$ in $X,\ a*b*c=a*c$

Solution

Given condition means if two elements commute, then they must be equal.

For A:

$a*(a*a)=(a*a)*a$ by associativity.

So, $a$ and $a*a$ commute.

Hence, $a=a*a$.

So, A is true.

For B:

$a*(a*b*a)=(a*a)*b*a=a*b*a$

$(a*b*a)*a=a*b*(a*a)=a*b*a$

So, $a$ and $a*b*a$ commute.

Hence, $a*b*a=a$.

So, B is true.

For C:

Using B, $c*a*c=c$ and $a*c*a=a$.

Now,

$(a*b*c)(a*c)=a*b*(c*a*c)=a*b*c$

$(a*c)(a*b*c)=(a*c*a)*b*c=a*b*c$

So, $a*b*c$ and $a*c$ commute.

Hence, $a*b*c=a*c$.

So, C is also true.

Previous 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)

Nearest first
1
Match List I with List IIList IList IIA. $x+x=x$I. Identity LawB. $x+0=x$II. Absorption LawC. $x+1=1$III. Idempotent La…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
2
Which of the following Graphs is(are) planar?
Topic: UGC NET Computer Science Nov 2021 (Paper II)
3
For which value of $n$ is Wheel graph $W_n$ regular?
Topic: UGC NET Computer Science Nov 2021 (Paper II)
4
Let us assume a person climbing the stairs can take one stair or two stairs at a time. How many ways can this person cl…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
5
A company stores products in a warehouse. Storage bins in this warehouse are specified by their aisle, location in the …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
6
How many ways are there to assign $5$ different jobs to $4$ different employees if every employee is assigned at least …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
7
 Which of these statements about the floor and ceiling functions are correct?Statement I: $\lfloor 2x\rfloor=\lflo…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
8
Which of the following are logically equivalent?A. $\neg p\to(q\to r)$ and $q\to(p\lor r)$B. $(p\to q)\to r$ and $p\to(…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
9
Given below are two statements, one is labelled as Assertion A and the other is labelled as Reason R.Assertion A: Softw…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
10
 Given below are two statementsStatement I: Cleanroom software process model incorporates the statistical quality …
Topic: UGC NET Computer Science Nov 2021 (Paper II)

Next 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)

Ascending by ID
1
Consider the following linear optimization problem:Maximize $Z=6x+5y$Subject to $2x-3y\le 5$$x+3y\le 11$$4x+y\le 15$and…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
2
Which of the following languages are not regular?A. $L=\{(01)^n0^k\mid n>k,\ k\ge 0\}$B. $L=\{c^nb^ka^{n+k}\mid n\ge…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
3
Any string of terminals that can be generated by the following context-free grammar, where $S$ is start nonterminal sym…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
4
Let$L_1=\{0^n1^n0^m\mid n\ge 1,\ m\ge 1\}$$L_2=\{0^n1^m0^m\mid n\ge 1,\ m\ge 1\}$$L_3=\{0^n1^n0^n\mid n\ge 1\}$Which of…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
5
Given below are two statementsStatement I: The family of context free languages is closed under homomorphism.Statement …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
6
What is the minimum number of states required to the finite automaton equivalent to the transition diagram given below?
Topic: UGC NET Computer Science Nov 2021 (Paper II)
7
Find the regular expression for the language accepted by the automata given below.
Topic: UGC NET Computer Science Nov 2021 (Paper II)
8
 What language is accepted by the pushdown automaton$M=({q_0,q_1,q_2},\{a,b\},\{a,b,z\},\delta,q_0,z,\{q_2\})$with…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
9
Match List I with List IIList IList IIA. $S\to XY,\ X\to 0,\ Y\to 1$I. Greibach Normal FormB. $S\to aS\mid bSS\mid c$II…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
10
Which of the following concepts can be used to identify loops?A. Depth first orderingB. DominatorsC. Reducible graphsCh…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Ask Your Question or Put Your Review.

loading...