MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 379 Mcqs, each offering curated multiple-choice questions to sharpen your VITEEE knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Minimize the following Boolean expression using Boolean identities. F(A,B,C) = (A+BC’)(AB’+C) |
| A. | a + b + c’ |
| B. | ac’ + b |
| C. | b + ac |
| D. | a(b’ + c) |
| Answer» E. | |
| 2. |
What is the simplification value of MN(M+ N’) + M(N + N’)? |
| A. | m |
| B. | mn+m’n’ c) (1+m) |
| C. | d |
| D. | m+n’ |
| Answer» C. d | |
| 3. |
Simplify the expression XZ’ + (Y + Y’Z) + XY.TOPIC 5.5 MINIMIZATION OF BOOLEAN ALGEBRA |
| A. | (1+xy’) |
| B. | yz + xy’ + z’ |
| C. | (x + y +z) |
| D. | xy’+ z’ |
| Answer» D. xy’+ z’ | |
| 4. |
Evaluate the expression: (X + Z)(X + XZ’)+ XY + Y. |
| A. | xy+z’ |
| B. | y+xz’+y’z |
| C. | x’z+y |
| D. | x+y |
| Answer» E. | |
| 5. |
a ⊕ b = |
| A. | (a+b)(a`+b`) |
| B. | (a+b`) |
| C. | b` |
| D. | a` + b` |
| Answer» B. (a+b`) | |
| 6. |
is a disjunctive normal form. |
| A. | product-of-sums |
| B. | product-of-subtractions |
| C. | sum-of-products |
| D. | sum-of-subtractions |
| Answer» D. sum-of-subtractions | |
| 7. |
(X+Y`)(X+Z) can be represented by |
| A. | (x+y`z) |
| B. | (y+x`) |
| C. | xy` |
| D. | (x+z`) |
| Answer» B. (y+x`) | |
| 8. |
The set for which the Boolean function is functionally complete is |
| A. | {*, %, /} |
| B. | {., +, -} |
| C. | {^, +, -} |
| D. | {%, +, *} |
| Answer» C. {^, +, -} | |
| 9. |
Minimization of function F(A,B,C) = A*B*(B+C) is |
| A. | ac |
| B. | b+c |
| C. | b` |
| D. | ab |
| Answer» E. | |
| 10. |
A is a Boolean variable. |
| A. | literal |
| B. | string |
| C. | keyword |
| D. | identifier |
| Answer» B. string | |
| 11. |
There are numbers of Boolean functions of degree n. |
| A. | n |
| B. | 2(2*n) |
| C. | n3 |
| D. | n(n*2) |
| Answer» C. n3 | |
| 12. |
Inversion of single bit input to a single bit output using |
| A. | not gate |
| B. | nor gate |
| C. | and gate |
| D. | nand gate |
| Answer» B. nor gate | |
| 13. |
The of all the variables in direct or complemented from is a maxterm. |
| A. | addition |
| B. | product |
| C. | moduler |
| D. | subtraction |
| Answer» B. product | |
| 14. |
The logic gate that provides high output for same inputs |
| A. | not |
| B. | x-nor |
| C. | and |
| D. | xor |
| Answer» C. and | |
| 15. |
F(X,Y,Z,M) = X`Y`Z`M`. The degree of the function is |
| A. | 2 |
| B. | 5 |
| C. | 4 |
| D. | 1 |
| Answer» D. 1 | |
| 16. |
Algebra of logic is termed as |
| A. | numerical logic |
| B. | boolean algebra |
| C. | arithmetic logic |
| D. | boolean number |
| Answer» D. boolean number | |
| 17. |
A free semilattice has the property. |
| A. | intersection |
| B. | commutative and associative |
| C. | identity |
| D. | universal |
| Answer» E. | |
| 18. |
Every poset that is a complete semilattice must always be a |
| A. | sublattice |
| B. | complete lattice |
| C. | free lattice |
| D. | partial lattice |
| Answer» C. free lattice | |
| 19. |
The graph is the smallest non-modular lattice N5. A lattice is if and only if it does not have a isomorphic to N5. |
| A. | non-modular, complete lattice |
| B. | moduler, semilattice |
| C. | non-modular, sublattice |
| D. | modular, sublattice |
| Answer» E. | |
| 20. |
A sublattice(say, S) of a lattice(say, L) is a convex sublattice of L if |
| A. | x>=z, where x in s implies z in s, for every element x, y in l |
| B. | x=y and y<=z, where x, y in s implies z in s, for every element x, y, z in l |
| C. | x<=y<=z, where x, y in s implies z in s, for every element x, y, z in l |
| D. | x=y and y>=z, where x, y in s implies z in s, for every element x, y, z in l |
| Answer» D. x=y and y>=z, where x, y in s implies z in s, for every element x, y, z in l | |
| 21. |
A has a greatest element and a least element which satisfy 0 |
| A. | semilattice |
| B. | join semilattice |
| C. | meet semilattice |
| D. | bounded lattice |
| Answer» E. | |
| 22. |
The graph given below is an example of |
| A. | non-lattice poset |
| B. | semilattice |
| C. | partial lattice |
| D. | bounded lattice |
| Answer» B. semilattice | |
| 23. |
If every two elements of a poset are comparable then the poset is called |
| A. | sub ordered poset |
| B. | totally ordered poset |
| C. | sub lattice |
| D. | semigroup |
| Answer» C. sub lattice | |
| 24. |
A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as |
| A. | sublattice |
| B. | lattice |
| C. | trail |
| D. | walk |
| Answer» C. trail | |
| 25. |
A partial order ≤ is defined on the set S ={x, b1, b2, … bn, y} as x ≤ bi for all i and bi ≤ y for all i, where n ≥ 1. The number of total orders on the set S which contain the partial order ≤ is |
| A. | n+4 |
| B. | n2 |
| C. | n! |
| D. | 3 |
| Answer» D. 3 | |
| 26. |
The inclusion of sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, 5}} is necessary and sufficient to make R a complete lattice under the partial order defined by set containment. |
| A. | {1}, {2, 4} |
| B. | {1}, {1, 2, 3} |
| C. | {1} |
| D. | {1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5} |
| Answer» D. {1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5} | |
| 27. |
Suppose X = {a, b, c, d} and π1 is the partition of X, π1 = {{a, b, c}, d}. The number of ordered pairs of the equivalence relations induced by |
| A. | 15 |
| B. | 10 |
| C. | 34 |
| D. | 5 |
| Answer» C. 34 | |
| 28. |
If the longest chain in a partial order is of length l, then the partial order can be written as disjoint antichains. |
| A. | l2 |
| B. | l+1 |
| C. | l |
| D. | ll |
| Answer» D. ll | |
| 29. |
The less-than relation, |
| A. | not a partial ordering because it is not asymmetric and irreflexive equals antisymmetric |
| B. | a partial ordering since it is asymmetric and reflexive |
| C. | a partial ordering since it is antisymmetric and reflexive |
| D. | not a partial ordering because it is not antisymmetric and reflexive |
| Answer» B. a partial ordering since it is asymmetric and reflexive | |
| 30. |
Does the set of residue classes (mod 3) form a group with respect to modular addition? |
| A. | yes |
| B. | no |
| C. | can’t say |
| D. | insufficient data |
| Answer» B. no | |
| 31. |
a.(b.c) = (a.b).c is the representation for which property? |
| A. | g-ii |
| B. | g-iii |
| C. | r-ii |
| D. | r-iii |
| Answer» B. g-iii | |
| 32. |
An ‘Integral Domain’ satisfies the properties |
| A. | g-i to g-iii |
| B. | g-i to r-v |
| C. | g-i to r-vi |
| D. | g-i to r-iii |
| Answer» D. g-i to r-iii | |
| 33. |
Consider the set B* of all strings over the alphabet set B = {0, 1} with the concatenation operator for strings |
| A. | does not form a group |
| B. | does not have the right identity element |
| C. | forms a non-commutative group |
| D. | forms a group if the empty string is removed from |
| Answer» B. does not have the right identity element | |
| 34. |
The elements of a vector space form a/an under vector addition. |
| A. | abelian group |
| B. | commutative group |
| C. | associative group |
| D. | semigroup |
| Answer» B. commutative group | |
| 35. |
A set of representatives of all the cosets is called |
| A. | transitive |
| B. | reversal |
| C. | equivalent |
| D. | transversal |
| Answer» E. | |
| 36. |
An isomorphism of a group onto itself is called |
| A. | homomorphism |
| B. | heteromorphism |
| C. | epimorphism |
| D. | automorphism |
| Answer» E. | |
| 37. |
A function is defined by f(x)=2x and f(x +y) = f(x) + f(y) is called |
| A. | isomorphic |
| B. | homomorphic |
| C. | cyclic group |
| D. | heteromorphic |
| Answer» B. homomorphic | |
| 38. |
Lagrange’s theorem specifies |
| A. | the order of semigroup is finite |
| B. | the order of the subgroup divides the order of the finite group |
| C. | the order of an abelian group is infinite |
| D. | the order of the semigroup is added to the order of the group |
| Answer» C. the order of an abelian group is infinite | |
| 39. |
a * H = H * a relation holds if |
| A. | h is semigroup of an abelian group |
| B. | h is monoid of a group |
| C. | h is a cyclic group |
| D. | h is subgroup of an abelian group |
| Answer» E. | |
| 40. |
a * H is a set of coset. |
| A. | right |
| B. | left |
| C. | sub |
| D. | semi |
| Answer» C. sub | |
| 41. |
Two groups are isomorphic if and only if is existed between them. |
| A. | homomorphism |
| B. | endomorphism |
| C. | isomorphism |
| D. | association |
| Answer» D. association | |
| 42. |
A normal subgroup is |
| A. | a subgroup under multiplication by the elements of the group |
| B. | an invariant under closure by the elements of that group |
| C. | a monoid with same number of elements of the original group |
| D. | an invariant equipped with conjugation by the elements of original group |
| Answer» E. | |
| 43. |
Intersection of subgroups is a |
| A. | group |
| B. | subgroup |
| C. | semigroup |
| D. | cyclic group |
| Answer» C. semigroup | |
| 44. |
A group of rational numbers is an example of |
| A. | a subgroup of a group of integers |
| B. | a subgroup of a group of real numbers |
| C. | a subgroup of a group of irrational numbers |
| D. | a subgroup of a group of complex numbers |
| Answer» C. a subgroup of a group of irrational numbers | |
| 45. |
Let K be a group with 8 elements. Let H be a subgroup of K and H |
| A. | semigroup |
| B. | subgroup |
| C. | cyclic group |
| D. | abelian group |
| Answer» D. abelian group | |
| 46. |
is not necessarily a property of a Group. |
| A. | commutativity |
| B. | existence of inverse for every element |
| C. | existence of identity |
| D. | associativity |
| Answer» B. existence of inverse for every element | |
| 47. |
{1, i, -i, -1} is |
| A. | a commutative subgroup |
| B. | a lattice |
| C. | a trivial group |
| D. | a monoid |
| Answer» D. a monoid | |
| 48. |
A cyclic group is always |
| A. | abelian group |
| B. | monoid |
| C. | semigroup |
| D. | subgroup |
| Answer» B. monoid | |
| 49. |
Matrix multiplication is a/an property. |
| A. | commutative |
| B. | associative |
| C. | additive |
| D. | disjunctive |
| Answer» C. additive | |
| 50. |
A monoid is called a group if |
| A. | (a*a)=a=(a+c) |
| B. | (a*c)=(a+c) |
| C. | (a+c)=a |
| D. | (a*c)=(c*a)=e |
| Answer» E. | |