If N is a set of natural numbers, then under binary operation a · b = a + b, (N, ·) is
quasi-group
semi-group
monoid
group
The relation R defined on set A = by is
{(- 2, 2), (- 1, 1), (0, 0), (1, 1), (2, 2)}
{(- 2, - 2), (- 2, 2), (-1, 1), (0, 0), (1, - 2), (1, 2), (2, - 1), (2, - 2)}
{(0, 0), (1, 1), (2, 2)}
None of the above
The domain of the function f(x) = is
[0, 2]
[0, 2)
[1, 2)
[1, 2]
C.
[1, 2)
The roots of (x - a)(x - a - 1) + (x - a - 1)(x - a - 2) + (x - a)(x - a - 2) = 0, are always
equal
imaginary
real and distinct
rational and equal
Let f(x) = x2 + ax + b, where a, b R. If f(x) = 0 has all its roots imaginary, then the roots of f(x) + f'(x) + f''(x) = 0 are
real and distinct
imaginary
real and distinct
rational and equal
If f(x) = 2x4 - 13x2 + ax + b is divisible by x2 - 3x + 2, then (a, b) is equal to
(- 9, - 2)
(6, 4)
(9, 2)
(2, 9)
Let S be a finite set containing n elements. Then the total number of commutative binary operation on S is
The output of the circuit is
(x2 + x3) . [(x1 · x2) . x3']
(x2 + x3') . [(x1 · x2) . x3']
(x2 + x3) + [(x1 · x2) . x3']
(x2 . x3) . [(x1 · x2) . x3']