• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

Set Theory & Algebra

Question 1

A binary operation [Tex]\\oplus[/Tex] on a set of integers is defined as x [Tex]\\oplus[/Tex] y = x2 + y2. Which one of the following statements is TRUE about [Tex]\\oplus[/Tex]?
  • Commutative but not associative
  • Both commutative and associative
  • Associative but not commutative
  • Neither commutative nor associative

Question 2

Consider the set S = {1, ω, ω2}, where ω and w2 are cube roots of unity. If * denotes the multiplication operation, the structure (S, *) forms
  • A group
  • A ring
  • An integral domain
  • A field

Question 3

Which one of the following in NOT necessarily a property of a Group?
  • Commutativity
  • Associativity
  • Existence of inverse for every element
  • Existence of identity

Question 4

Consider the binary relation R = {(x, y), (x, z), (z, x), (z, y)} on the set {x, y, z}. Which one of the following is TRUE?
  • R is symmetric but NOT antisymmetric
  • R is NOT symmetric but antisymmetric
  • R is both symmetric and antisymmetric
  • R is neither symmetric nor antisymmetric

Question 5

For the composition table of a cyclic group shown below

[caption width="800"] [/caption]

Which one of the following choices is correct?

  • a, b are generators

  • b, c are generators

  • c, d are generators

  • d, a are generators

Question 6

If P, Q, R are subsets of the universal set U, then 

2

  • Qc U Rc
     

  • P U Qc U Rc
     

  • Pc U Qc U Rc
     

  • U
     

Question 7

Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are:

  • n and n

  • n2 and n

  • n2 and 0

  • n and 1

Question 8

How many different non-isomorphic Abelian groups of order 4 are there
  • 2
  • 3
  • 4
  • 5

Question 9

Consider the set S = (A, B, C, D}. Consider the following 4 partitions π1, π2, π3, π4 on S : π1 = {ABCD}'  , π2 = {AB}' , {CD}' , π3 = {ABC}' , {D}' ,  π4 = A' , B' , C' , D'.  Let P be the partial order on the set of partitions S' = {π1, π2, π3, π4} defined as follows : πi P πj if and only if πi refines πj. The poset diagram for (S', P ) is :

  • [caption width="800"] [/caption]


     


  •  

    [caption width="800"] [/caption]
  • [caption width="800"] [/caption]


     

  • [caption width="800"] [/caption]


     

Question 10

gatecs200727
  • A
  • B
  • C
  • D

There are 121 questions to complete.

Last Updated :
Take a part in the ongoing discussion