

MCQOPTIONS
Saved Bookmarks
This section includes 26 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Fundamentals knowledge and support exam preparation. Choose a topic below to get started.
1. |
a ⊕ b = ________ |
A. | (a+b)(a`+b`) |
B. | (a`+b`)b) (a+b`) |
C. | b` |
D. | a` + b` |
Answer» B. (a`+b`)b) (a+b`) | |
2. |
__________ 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 | |
3. |
(X+Y`)(X+Z) can be represented by _____ |
A. | (X+Y`Z) |
B. | (Y+X`) |
C. | XY` |
D. | (X+Z`) |
Answer» B. (Y+X`) | |
4. |
The set for which the Boolean function is functionally complete is __________ |
A. | {*, %, /} |
B. | {., +, -} |
C. | {^, +, -} |
D. | {%, +, *} |
Answer» C. {^, +, -} | |
5. |
Minimization of function F(A,B,C) = A*B*(B+C) is _________ |
A. | AC |
B. | B+C |
C. | B` |
D. | AB |
Answer» E. | |
6. |
A _________ is a Boolean variable. |
A. | Literal |
B. | String |
C. | Keyword |
D. | Identifier |
Answer» B. String | |
7. |
There are _________ numbers of Boolean functions of degree n. |
A. | n |
B. | 2(2*n) |
C. | n3 |
D. | n(n*2) |
Answer» C. n3 | |
8. |
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 | |
9. |
_________ is used to implement the Boolean functions. |
A. | Logical notations |
B. | Arithmetic logics |
C. | Logic gates |
D. | Expressions |
Answer» D. Expressions | |
10. |
The max term when X=Y=Z=1 is ________ |
A. | x’+y’+z’ |
B. | xyz |
C. | x’y’z’ |
D. | x+y+z |
Answer» B. xyz | |
11. |
The min term when X=Y=Z=0 is _____________ |
A. | x’+y’+z’ |
B. | xyz |
C. | x’y’z’ |
D. | x+y+z |
Answer» D. x+y+z | |
12. |
The minterm of any expression is denoted by ___________ |
A. | Mt |
B. | m |
C. | M |
D. | min |
Answer» C. M | |
13. |
What is the complement of X’Y’Z? |
A. | X+YZ |
B. | X’+Y+’Z’ |
C. | X+Y+Z’ |
D. | XYZ’ |
Answer» D. XYZ’ | |
14. |
The complement term for X’.Y’.Z + X.Y will be _____________ |
A. | XYZ’+X’Y’ |
B. | (X+Y+Z’)(X’+Y’) |
C. | (X+Y+Z’)(X’+Y) |
D. | (X+Y+Z’)(X’+Y) |
Answer» C. (X+Y+Z’)(X’+Y) | |
15. |
The number of literals in the expression F=X.Y’ + Z are _____________ |
A. | 4 |
B. | 3 |
C. | 2 |
D. | 1 |
Answer» C. 2 | |
16. |
Boolean Function is of the form of ________ |
A. | Truth values |
B. | K=f(X,Y,X) |
C. | Algebraic Expression |
D. | Truth Table |
Answer» B. K=f(X,Y,X) | |
17. |
THE_MAX_TERM_WHEN_X=Y=Z=1_IS_________?$ |
A. | x’+y’+z’ |
B. | xyz |
C. | x’y’z’ |
D. | x+y+z |
Answer» B. xyz | |
18. |
The min term when X=Y=Z=0 is ____________? |
A. | x’+y’+z’ |
B. | xyz |
C. | x’y’z’ |
D. | x+y+z |
Answer» D. x+y+z | |
19. |
The minterm of any expression is denoted by ___________ |
A. | Mt |
B. | m |
C. | M |
D. | min |
Answer» C. M | |
20. |
What is the complement of X’Y’Z?$ |
A. | X+YZ |
B. | X’+Y+’Z’ |
C. | X+Y+Z’ |
D. | XYZ’ |
Answer» D. XYZ‚Äö√Ñ√∂‚àö√ë‚àö¬• | |
21. |
The complement term for X’.Y’.Z + X.Y will be _____________$ |
A. | XYZ’+X’Y’ |
B. | (X+Y+Z’)(X’+Y’) |
C. | (X+Y+Z’)(X’+Y) |
D. | (X+Y+Z’)(X’+Y) |
Answer» C. (X+Y+Z‚Äö√Ñ√∂‚àö√ë‚àö¬•)(X‚Äö√Ñ√∂‚àö√ë‚àö¬•+Y) | |
22. |
The number of literals in the expression F=X.Y’ + Z are _____________$ |
A. | 4 |
B. | 3 |
C. | 2 |
D. | 1 |
Answer» C. 2 | |
23. |
The general form for calculating the number of rows in a truth table is ________ |
A. | 2<sup>n</sup> |
B. | 2<sup>n+1</sup> |
C. | 2<sup>n</sup> |
D. | 2<sup>n+1</sup> |
Answer» D. 2<sup>n+1</sup> | |
24. |
In the boolean function w=f(X,Y,Z), what is the RHS referred to as ________ |
A. | right hand side |
B. | expression |
C. | literals |
D. | boolean |
Answer» C. literals | |
25. |
The result of X+X.Y is X. |
A. | True |
B. | False |
Answer» B. False | |
26. |
Boolean Function is of the form of ________ |
A. | Truth values |
B. | K=f(X,Y,X) |
C. | Algebraic Expression |
D. | Truth Table |
Answer» B. K=f(X,Y,X) | |