Explore topic-wise MCQs in Computer Science Engineering (CSE).

This section includes 315 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.

51.

Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.

A. b(ac)’ + ac’
B. ac’ + b’
C. abc + b’ + c
D. bc’ + a’b
Answer» B. ac’ + b’
Discussion
52.

If an expression is given that x+x’y’z=x+y’z, find the minimal expression of the function F(x,y,z) = x+x’y’z+yz?

A. y’ + z
B. xz + y’
C. x + z
D. x’ + y
Answer» D. x’ + y
Discussion
53.

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’
Discussion
54.

Simplify the expression: XY’ + X’ + Y’X’.

A. x’ + y
B. xy’
C. (xy)’
D. y’ + x
Answer» D. y’ + x
Discussion
55.

Find the simplified term Y’ (X’ + Y’) (X + X’Y)?

A. xy’
B. x’y
C. x + y
D. x’y’
Answer» B. x’y
Discussion
56.

Simplify the expression: A’(A + BC) + (AC + B’C).

A. (ab’c+bc’)
B. (a’b+c’)
C. (a+ bc)
D. ac
Answer» C. (a+ bc)
Discussion
57.

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
Discussion
58.

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.
Discussion
59.

Find the simplified expression A’BC’+AC’.

A. b
B. a+c
C. (a+b)c’
D. b’c
Answer» D. b’c
Discussion
60.

a ⊕ b =

A. (a+b)(a`+b`)
B. (a+b`)
C. b`
D. a` + b`
Answer» B. (a+b`)
Discussion
61.

                     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
Discussion
62.

(X+Y`)(X+Z) can be represented by

A. (x+y`z)
B. (y+x`)
C. xy`
D. (x+z`)
Answer» B. (y+x`)
Discussion
63.

The set for which the Boolean function is functionally complete is

A. {*, %, /}
B. {., +, -}
C. {^, +, -}
D. {%, +, *}
Answer» C. {^, +, -}
Discussion
64.

Minimization of function F(A,B,C) = A*B*(B+C) is

A. ac
B. b+c
C. b`
D. ab
Answer» E.
Discussion
65.

There are                    numbers of Boolean functions of degree n.

A. n
B. 2(2*n)
C. n3
D. n(n*2)
Answer» C. n3
Discussion
66.

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
Discussion
67.

A                    is a Boolean variable.

A. literal
B. string
C. keyword
D. identifier
Answer» B. string
Discussion
68.

What is the use of Boolean identities?

A. minimizing the boolean expression
B. maximizing the boolean expression
C. to evaluate a logical identity
D. searching of an algebraic expression
Answer» B. maximizing the boolean expression
Discussion
69.

The                        of all the variables in direct or complemented from is a maxterm.

A. addition
B. product
C. moduler
D. subtraction
Answer» B. product
Discussion
70.

Which of the following is a Simplification law?

A. m.(~m+n) = m.n
B. m+(n.o) = (m+n)(m+o) c) ~(m+n) = ~m.~n
C. d) m.(n.o) = (m.n
D. .o
Answer» B. m+(n.o) = (m+n)(m+o) c) ~(m+n) = ~m.~n
Discussion
71.

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
Discussion
72.

Algebra of logic is termed as

A. numerical logic
B. boolean algebra
C. arithmetic logic
D. boolean number
Answer» D. boolean number
Discussion
73.

A free semilattice has the                 property.

A. intersection
B. commutative and associative
C. identity
D. universal
Answer» E.
Discussion
74.

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.
Discussion
75.

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
Discussion
76.

The graph given below is an example of

A. non-lattice poset
B. semilattice
C. partial lattice
D. bounded lattice
Answer» B. semilattice
Discussion
77.

A                  has a greatest element and a least element which satisfy 0<=a<=1 for every a in the lattice(say, L).

A. semilattice
B. join semilattice
C. meet semilattice
D. bounded lattice
Answer» E.
Discussion
78.

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
Discussion
79.

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
Discussion
80.

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
Discussion
81.

Consider the set N* of finite sequences of natural numbers with a denoting that sequence a is a prefix of sequence b. Then, which of the following is true?

A. every non-empty subset of has a greatest lower bound
B. it is uncountable
C. every non-empty finite subset of has a least upper bound
D. every non-empty subset of has a least upper bound
Answer» B. it is uncountable
Discussion
82.

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}
Discussion
83.

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
Discussion
84.

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
Discussion
85.

The less-than relation, <, on a set of real numbers is

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
Discussion
86.

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» C. can’t say
Discussion
87.

a(b+c) = ac+bc is the representation for which property?

A. g-ii
B. g-iii
C. r-ii
D. r-iii
Answer» E.
Discussion
88.

For the group Sn of all permutations of n distinct symbols, what is the number of elements in Sn?

A. n
B. n-1
C. 2n
D. n!
Answer» E.
Discussion
89.

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
Discussion
90.

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
Discussion
91.

A Ring is said to be commutative if it also satisfies the property

A. r-vi
B. r-v
C. r-vii
D. r-iv
Answer» E.
Discussion
92.

A Ring satisfies the properties

A. r-i to r-v
B. g-i to g-iv
C. g-i to r-v
D. g-i to r-iii
Answer» E.
Discussion
93.

An Abelian Group satisfies the properties

A. g-i to g-v
B. g-i to r-iv
C. g-i to r-v
D. r-i to r-v
Answer» B. g-i to r-iv
Discussion
94.

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
Discussion
95.

All groups satisfy properties

A. g-i to g-v
B. g-i to g-iv
C. g-i to r-v
D. r-i to r-v
Answer» C. g-i to r-v
Discussion
96.

How many different non-isomorphic Abelian groups of order 8 are there?

A. 5
B. 4
C. 2
D. 3
Answer» D. 3
Discussion
97.

A set of representatives of all the cosets is called

A. transitive
B. reversal
C. equivalent
D. transversal
Answer» E.
Discussion
98.

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
Discussion
99.

An isomorphism of a group onto itself is called

A. homomorphism
B. heteromorphism
C. epimorphism
D. automorphism
Answer» E.
Discussion
100.

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
Discussion