MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 70 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
How many number of prime implicants are there in the expression F(x, y, z) = y’z’ + xy + x’z. |
| A. | 7 |
| B. | 19 |
| C. | 3 |
| D. | 53 |
| Answer» D. 53 | |
| 52. |
Using which component a shift register is implemented? |
| A. | register |
| B. | transistor |
| C. | latch |
| D. | flip-flop |
| Answer» E. | |
| 53. |
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) | |
| 54. |
When designing a circuit to emulate a truth table, both Product-of-Sums (POS) expressions and Sum-of-Products (SOP) expressions can be derived from? |
| A. | k-map |
| B. | NAND gate |
| C. | NOR gate |
| D. | X-NOR gate |
| Answer» B. NAND gate | |
| 55. |
To display time in railway stations which digital circuit is used? |
| A. | seven segment decoder |
| B. | eight segment encoder |
| C. | 8:3 multiplexer |
| D. | 9 bit segment driver |
| Answer» B. eight segment encoder | |
| 56. |
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 | |
| 57. |
Determine the number of prime implicants of the following function F? |
| A. | 621 |
| B. | 187 |
| C. | 3⁵ |
| D. | 5 |
| Answer» E. | |
| 58. |
Equivalence of automata states that ____________ |
| A. | two automata accept the same set of input strings |
| B. | two automata have same set of states |
| C. | two automata does not contain initial input symbols |
| D. | two automata share equal transition function |
| Answer» B. two automata have same set of states | |
| 59. |
Simplify the expression using K-maps: F(A,B,C) = π(0,2,4,5,7). |
| A. | (x+y)(y+z)(x+z)(x’+z’) |
| B. | (x+z’)(y+z)(x+y) |
| C. | (x+y’+z)(x+z’) |
| D. | (y’+z’)(x’+y)(z+y’) |
| Answer» B. (x+z’)(y+z)(x+y) | |
| 60. |
Minimization of function F(A,B,C) = A*B*(B+C) is _________ |
| A. | AC |
| B. | B+C |
| C. | B` |
| D. | AB |
| Answer» E. | |
| 61. |
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 |
| D. | M.(N.O) = (M.N).O |
| Answer» B. M+(N.O) = (M+N)(M+O) | |
| 62. |
The ___________ of all the variables in direct or complemented from is a maxterm. |
| A. | addition |
| B. | product |
| C. | moduler |
| D. | subtraction |
| Answer» B. product | |
| 63. |
Algebra of logic is termed as ______________ |
| A. | Numerical logic |
| B. | Boolean algebra |
| C. | Arithmetic logic |
| D. | Boolean number |
| Answer» D. Boolean number | |
| 64. |
The logic gate that provides high output for same inputs ____________ |
| A. | NOT |
| B. | X-NOR |
| C. | AND |
| D. | XOR |
| Answer» C. AND | |
| 65. |
What is the definition of Boolean functions? |
| A. | An arithmetic function with k degrees such that f:Y–>Yᵏ |
| B. | A special mathematical function with n degrees such that f:Yⁿ–>Y |
| C. | An algebraic function with n degrees such that f:Xⁿ–>X |
| D. | A polynomial function with k degrees such that f:X²–>Xⁿ |
| Answer» C. An algebraic function with n degrees such that f:Xⁿ–>X | |
| 66. |
A ________ value is represented by a Boolean expression. |
| A. | Positive |
| B. | Recursive |
| C. | Negative |
| D. | Boolean |
| Answer» E. | |
| 67. |
Boolean algebra can be used ____________ |
| A. | For designing of the digital computers |
| B. | In building logic symbols |
| C. | Circuit theory |
| D. | Building algebraic functions |
| Answer» B. In building logic symbols | |
| 68. |
Which of the following is/are the universal logic gates? |
| A. | OR and NOR |
| B. | AND |
| C. | NAND and NOR |
| D. | NOT |
| Answer» D. NOT | |
| 69. |
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 | |
| 70. |
What are the canonical forms of Boolean Expressions? |
| A. | OR and XOR |
| B. | NOR and XNOR |
| C. | MAX and MIN |
| D. | SOM and POM |
| Answer» E. | |