QUESTION BANK

DSTL(BCS-303)
UNIT 4-Algebric Structures

SECTION–A:SHORT ANSWER QUESTIONS

Ques-1: Define:

(a) Groupoid

(b) Semigroup

(c) Monoid

Solu:

(a).GROUPOID:- groupoid is a set GG together with a binary operation o:G×G→Gwhich we

can denote as a∘b for a,b∈G. Unlike a group, a groupoid does not require the operation to
satisfy any specific properties such as associativity, identity, or invertibility.

(b).SEMIGROUP:- If S is a nonempty set and * be a binary operation S, then the algebraic

system {S, * } is called a semigroup , if the operation * is associative.

viz., if for any a,b,c∈S,

(a∗b)∗c=a∗(b∗c)

Since the characteristic property of a binary operation on S is the closure property, it is not
necessary to mention it explicity when algebraic systems are defined.

For example, if E is the set of positive even numbers, then {E, + } and {E, X} are semigroups.

(c ). MONOID:- If a semigroup {M, * } has an identity element with respect to the operation
* , then {M, * } is called a monoid.

viz., if for any a,b,c∈M

(a∗b)∗c=a∗(b∗c)
 and if there exists an element e∈M such that for any a∈M, e∗a=a∗e=a, then the algebraic
system {M, * } is called a monoid.

For example, if N is the set of natural numbers, then {N,+} and {N,X} are monoids with the
identity elements 0 and 1 respectively.

The semigroups {E,+} and {E,X} are not monoids.

Ques-2: Define Group and write its properties.

Solu: A group is a fundamental concept in abstract algebra. It is a set GG equipped with a

binary operation ∗* that satisfies certain properties. Formally, a group is defined as
follows:

A set GG with a binary operation ∗:G×G→G is called a group if it satisfies the following
properties:

1. Closure: For all a,b∈G, the result of the operation a∗b is also in GG.

2. Associativity: For all a,b,c∈G,the equation (a∗b)∗c=a∗(b∗c)holds.

3. Identity Element: There exists an element e∈G such that for every element a∈G, the
equation e∗a=a∗e=a holds. This element e is called the identity element.

4. Inverse Element: For each element a∈G, there exists an element b∈G such that
a∗b=b∗a=e, where e is the identity element. The element b is called the inverse of a and is
often denoted as a^{-1}.

Properties of a Group

1. Uniqueness of Identity: The identity element in a group is unique. If e and e' are both
identity elements, then e = e'.

2. Uniqueness of Inverse: For each element a in a group, its inverse is unique. If b and c are
both inverses of a, then b = c.

3. Cancellation Law: If a * b = a * c or b * a = c * a for a,b,c∈G, then b = c. This is known as the

left and right cancellation law, respectively.

2|Page
4. Self-Inverse: If a * a = e (the identity element), then a is called an involution, or self-inverse.
This is a special case and applies to certain groups.

Ques-3: 𝑆𝑡𝑎𝑡𝑒 𝑎𝑛𝑑 𝑗𝑢𝑠𝑡𝑖𝑓𝑦 "Every cyclic group is an abelian group".

Solu: To justify this statement, we need to understand the definitions of cyclic groups and
abelian groups and then show that the properties of a cyclic group inherently satisfy the
criteria for an abelian group.

1. Cyclic Group: A group G is called cyclic if there exists an element g∈G such that every
element of G can be written as a power of g. In other words, G is generated by g, and we
write G=⟨g⟩.

Formally, for all h∈G, there exists an integer kk such that h = g^k.

2. Abelian Group: A group G is called abelian (or commutative) if for all elements a,b∈G, the
group operation satisfies a* b = b * a.

3. Proof:

o Let G=⟨g⟩ be a cyclic group generated by g.

o Consider any two elements a,b∈G. Since G is cyclic, we can write a = g^m and b = g^n for
some integers m and n.

o We need to show that the operation is commutative, i.e., a* b = b * a.

Let's perform the group operation on a and b:

a * b = g^m * g^n = g^{m+n} (using the properties of exponents in the group operation)

Similarly, consider b∗a:

b * a = g^n * g^m = g^{n+m} (using the same properties of exponents in the group
operation)

Since addition of integers is commutative, we have:

g^{m+n} = g^{n+m}

Therefore:

3|Page
a * b = g^{m+n} = g^{n+m} = b * a

This shows that a * b = b * a for any a,b∈G. Hence, the operation in a cyclic group is
commutative, and thus, every cyclic group is an abelian group

Ques-4: 𝐷𝑒𝑓𝑖𝑛𝑒 𝑅𝑖𝑛𝑔 𝑎𝑛𝑑 𝐹𝑖𝑒𝑙𝑑 with example.

Solu: Ring:

A set R with two binary operations +(addition) and ⋅ (multiplication) is called a ring if it
satisfies the following properties:

1. Additive Closure: For all a,b∈R, a+b∈R.

2. Additive Associativity: For all a,b,c∈R, (a + b) + c = a + (b + c).

3. Additive Identity: There exists an element 0∈R such that for all a∈R, a+ 0 = 0 + a = a.

4. Additive Inverse: For each a∈R, there exists an element -a∈R such that a+ (-a) = (-
a) + a = 0.

5. Multiplicative Closure: For all a,b∈R, a⋅b∈R.

6. Multiplicative Associativity: For all a,b,c∈R, (a⋅b)⋅c=a⋅(b⋅c).

7. Distributive Laws: For all a,b,c∈R, a⋅(b+c)=(a⋅b)+(a⋅c) and (a+b)⋅c=(a⋅c)+(b⋅c).

Example of a Ring

The set of integers Z with the usual operations of addition and multiplication forms a ring. It
satisfies all the properties mentioned above.

Field:

A set FF with two binary operations + (addition) and ⋅ (multiplication) is called a field if it
satisfies the following properties:

1. All Ring Properties: F must be a commutative ring with a multiplicative identity.

4|Page
 2. Multiplicative Inverse: For every non-zero element a∈F, there exists an element
b∈F such that a⋅b=b⋅a=1, where 1 is the multiplicative identity.

Example of a Field

The set of rational numbers Q with the usual operations of addition and multiplication
forms a field. It satisfies all the properties of a ring and also has multiplicative inverses for
every non-zero element.

Ques-5: 𝐿𝑒𝑡 𝑍 𝑏𝑒 𝑡ℎ𝑒 𝑔𝑟𝑜𝑢𝑝 𝑜𝑓 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 𝑤𝑖𝑡ℎ 𝑏𝑖𝑛𝑎𝑟𝑦 𝑜𝑝𝑒𝑟𝑎𝑡𝑖𝑜𝑛 ∗

𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 𝑎 ∗ 𝑏 = 𝑎 + 𝑏 − 2, 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎, 𝑏 𝜖 𝑍. 𝐹𝑖𝑛𝑑 𝑡ℎ𝑒 𝑖𝑑𝑒𝑛𝑡𝑖𝑡𝑦 𝑒𝑙𝑒𝑚𝑒𝑛𝑡
𝑜𝑓 𝑡ℎ𝑒 𝑔𝑟𝑜𝑢𝑝 〈𝑍,∗ 〉.

Solu: To find the identity element e of the group ⟨Z,∗⟩ with the binary
operation defined by a∗b=a+b-2, we need to find an element e∈Z such
that for all a∈Z,

a* e = a

e∗a=a

Substitute e into the operation:

1. Left Identity:

a*e=a+e-2=a

Simplify this equation:

e-2=0

e=2e = 2

2. Right Identity:

e*a=e+a-2=a

Simplify this equation:

e- 2 = 0

e=2e = 2

5|Page
In both cases, we find e=2e = 2. Therefore, the identity element for the
group ⟨Z,∗⟩ is 2.

SECTION-B: LONG ANSWER QUESTIONS

Ques-6: : Consider group G = {1, 2, 3, 4, 5, 6} under multiplication modulo 7.

(a) Construct the multiplication table of G.

(b) Compute (2)^-1, (3)^-1, (6)^-1 .

(c) Compute the orders and subgroups generated by 2 and 3.

Solu: (a) Construct the multiplication table of G under modulo 7

First, we need to find the product of each pair of elements in the set 𝐺 = {1,2,3,4,5,6}

modulo 7.

⋅123456

1123456

2246135

3362514

4415263

5531642

6654321

(b) Compute the inverses ( 2 −1 , 3 −1 , 6 −1 )

6|Page
To find the inverse of an element 𝑎 in the group 𝐺

under multiplication modulo 7, we need to find an element 𝑏 such that 𝑎⋅ 𝑏 ≡ 1 (mod 7).

1. 2 −1 :

We need 2 ⋅ 𝑥 ≡ 1 (mod 7)

2 ⋅ 4 = 8 ≡ 1 (mod 7)

So, 2 -1= 4

2. 3 −1 :

We need 3 ⋅ 𝑥 ≡ 1 (mod 7)

3 ⋅ 5 = 15 ≡ 1 (mod 7)

So, 3 −1 = 5

3. 6 −1 :

We need 6 ⋅ 𝑥 ≡ 1 (mod 7)

6 ⋅ 6 = 36 ≡ 1 (mod 7)

So, 6 −1 =6

(c) Compute the orders and subgroups generated by 2 and 3

1. Order of an element:

The order of an element 𝑎 in a group is the smallest positive integer 𝑛 such that

𝑎 𝑛 ≡ 1 (mod 7).

2. Subgroup generated by an element:

The subgroup generated by an element 𝑎 is the set of all powers of 𝑎

under the group operation.

Element 2:

 21≡2 (mod 7)

7|Page
  22≡4 (mod 7)

 23≡8≡1 (mod 7)

 Order of 2 is 3.

 Subgroup generated by 2 is {1,2,4}

Element 3:

 31≡3 (mod 7)

 32≡9≡2 (mod 7)

 33≡27≡6 (mod 7)

 34≡18≡4 (mod 7)

 35≡12≡5 (mod 7)

 36≡15≡1 (mod 7)

 Order of 3 is 6.

 Subgroup generated by 3 is {1,2,3,4,5,6} (which is the entire group G).

Ques-7:

8|Page