Discrete Mathematics Questions and Answers – Groups – Burnside Theorem

This set of Discrete Mathematics Multiple Choice Questions & Answers (MCQs) focuses on “Groups – Burnside Theorem”.

1. Which of the following is not an abelian group?
a) semigroup
b) dihedral group
c) trihedral group
d) polynomial group
View Answer

Answer: b
Explanation: The dihedral group(Dih4) of order 8 is a non-abelian p-group. But, every group of order p2 must be abelian group.

2. If we take a collection of {∅, {2}, {3}, {5}} ordered by inclusion. Which of the following is true?
a) isomorphic graph
b) poset
c) lattice
d) partially ordered set
View Answer

Answer: b
Explanation: This is a poset. Since {2}, {3} and {5} have no common upper bound, it is not a lattice.

3. _______ characterizes the properties of distributive lattices.
a) Congruence Extension Property
b) Algebraic extension property
c) Poset
d) Semigroup
View Answer

Answer: b
Explanation: An algebra A describes the congruence extension property (CEP) if for every B≤A and θ∈Con(B) there exists a φ∈Con(A) such that θ = φ∩(B×B). A class M of algebras has the CEP if every algebra in the class has the CEP. The Congruence Extension Property specifically characterizes the distributive lattices among all lattices.

4. Suppose that H be an X-set and suppose that a∼b and |Xa|=|Xb|, the which of the following is true?
a) Xa is powerset of Xb
b) Xa is isomorphic to Xb
c) Xa is homomorphic to Xb
d) Xb is the subset of Xa
View Answer

Answer: b
Explanation: According to Burnside theorem, Xa is isomorphic to Xb and in particular |Xa|=|Xb|.

5. If he 4 sides of a square are to be colored by colors. How many different colourings with 50 colours are there if two arrangements that can be obtained from each other by rotation are identical?
a) 773762
b) 363563
c) 4536822
d) 1563150
View Answer

Answer: d
Explanation: There are m4 + m2 + 2m elements after performing all rotations. Dividing this by the number of transformations 4 produces the desired number of distinct colorings \(\frac{m^4 + m^2 + 2m}{4}\). Hence, the number of distinct colorings with 50 colors is 1563150.
Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

6. Let H be a finite group. The order of Sylow p-subgroup of H for every prime factor p with multiplicity 9 is?
a) p+6
b) p9
c) pp
d) 3!*p2
View Answer

Answer: b
Explanation: We know that, for a finite group H, there exists a Sylow p-subgroup of H having order p9 for every prime factor p with multiplicity 9.

7. How many indistinguishable necklaces can be made from beads of 4 colors with exactly 9 beads of each color where each necklace is of length 16?
a) 76967234
b) 5652209
c) 14414400
d) 8686214
View Answer

Answer: c
Explanation: If B is the set of all possible permutations of these 16 beads, then the required answer is |B| = 16!/(9!)4 = 14414400.

8. Invariant permutations of two functions can form __________
a) groups
b) lattices
c) graphs
d) rings
View Answer

Answer: a
Explanation: Suppose, there are two functions f1 and f2 which belong to the same equivalence class since there exists an invariant permutation say, π(a permutation that does not change the object itself, but only its representation), such that: f2*π≡f1. So, invariant permutations can form a group, as the product (composition) of invariant permutations is again an invariant permutation.

9. Suppose P(h) is a group of permutations and identity permutation(id) belongs to P(c). If ϕ(c)=c then which of the following is true?
a) ϕ-1∈P(h)
b) ϕ-1∈P(h)
c) ϕ-1∈P(h)
d) ϕ-1∈P(h)
View Answer

Answer: b
Explanation: Let, ϕ and σ both can fix h, then we can have ϕ(σ(h)) = ϕ(h) = h. Hence, ϕ∘σ fixes h and ϕ∘σ∈P(h). Now, all colorings can be fixed by the identity permutation. So id∈P(h) and if ϕ(h) = h then ϕ-1(h) = ϕ-1(ϕ(h)) = id(h) = h which implies that ϕ-1∈P(h).

10. An isomorphism of Boolean algebra is defined as _______
a) order isomorphism
b) unordered isomorphism
c) order homomorphism
d) hyper-morphism
View Answer

Answer: a
Explanation: We know that very σ-complete Boolean algebra is a Boolean algebra. An isomorphism of Boolean algebras is termed as an order isomorphism. All meets and joins present in an order isomorphism domain is preserved. Hence, a Boolean algebra isomorphism preserves all meets and joins in its domain.

Sanfoundry Global Education & Learning Series – Discrete Mathematics.

To practice all areas of Discrete Mathematics, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]

Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.