MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 223 Mcqs, each offering curated multiple-choice questions to sharpen your Digital Electronics knowledge and support exam preparation. Choose a topic below to get started.
| 201. |
Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________. |
| A. | LM + MNOPQ |
| B. | L + MNO + MPQ |
| C. | LM + M + NO + MPQ |
| D. | LM + MNO + MPQ |
| Answer» E. | |
| 202. |
Determine the values of A, B, C, and D that make the product term equal to 1. |
| A. | A = 0, B = 1, C = 0, D = 1 |
| B. | A = 0, B = 0, C = 0, D = 1 |
| C. | A = 1, B = 1, C = 1, D = 1 |
| D. | A = 0, B = 0, C = 1, D = 0 |
| Answer» B. A = 0, B = 0, C = 0, D = 1 | |
| 203. |
A Karnaugh map is a systematic way of reducing which type of expression? |
| A. | product-of-sums |
| B. | exclusive NOR |
| C. | sum-of-products |
| D. | those with overbars |
| Answer» D. those with overbars | |
| 204. |
In Boolean algebra, = A. |
| A. | 1 |
| B. | |
| Answer» B. | |
| 205. |
The Boolean expression is logically equivalent to what single gate? |
| A. | NAND |
| B. | NOR |
| C. | AND |
| D. | OR |
| Answer» B. NOR | |
| 206. |
The systematic reduction of logic circuits is accomplished by: |
| A. | using Boolean algebra |
| B. | symbolic reduction |
| C. | TTL logic |
| D. | using a truth table |
| Answer» B. symbolic reduction | |
| 207. |
For the SOP expression , how many 0s are in the truth table's output column? |
| A. | zero |
| B. | 1 |
| C. | 4 |
| D. | 5 |
| Answer» D. 5 | |
| 208. |
Which of the following is an important feature of the sum-of-products (SOP) form of expression? |
| A. | All logic circuits are reduced to nothing more than simple AND and OR gates. |
| B. | The delay times are greatly reduced over other forms. |
| C. | No signal must pass through more than two gates, not including inverters. |
| D. | The maximum number of gates that any signal must pass through is reduced by a factor of two. |
| Answer» D. The maximum number of gates that any signal must pass through is reduced by a factor of two. | |
| 209. |
Which of the examples below expresses the commutative law of multiplication? |
| A. | A + B = B + A |
| B. | AB = B + A |
| C. | AB = BA |
| D. | AB = A √ó B |
| Answer» D. AB = A √ó B | |
| 210. |
Mapping the standard SOP expression , we get |
| A. | (A) |
| B. | (B) |
| C. | (C) |
| D. | (D) |
| Answer» C. (C) | |
| 211. |
The expression W(X + YZ) can be converted to SOP form by applying which law? |
| A. | associative law |
| B. | commutative law |
| C. | distributive law |
| D. | none of the above |
| Answer» D. none of the above | |
| 212. |
The truth table for the SOP expression has how many input combinations? |
| A. | 1 |
| B. | 2 |
| C. | 4 |
| D. | 8 |
| Answer» E. | |
| 213. |
Determine the values of A, B, C, and D that make the sum term equal to zero. |
| A. | A = 1, B = 0, C = 0, D = 0 |
| B. | A = 1, B = 0, C = 1, D = 0 |
| C. | A = 0, B = 1, C = 0, D = 0 |
| D. | A = 1, B = 0, C = 1, D = 1 |
| Answer» C. A = 0, B = 1, C = 0, D = 0 | |
| 214. |
Which of the following expressions is in the sum-of-products (SOP) form? |
| A. | (A + B)(C + D) |
| B. | (A)B(CD) |
| C. | AB(CD) |
| D. | AB + CD |
| Answer» E. | |
| 215. |
An OR gate with schematic "bubbles" on its inputs performs the same functions as a(n)________ gate. |
| A. | NOR |
| B. | OR |
| C. | NOT |
| D. | NAND |
| Answer» E. | |
| 216. |
The Boolean expression C + CD is equal to ________. |
| A. | C |
| B. | D |
| C. | C + D |
| D. | 1 |
| Answer» B. D | |
| 217. |
What is the primary motivation for using Boolean algebra to simplify logic expressions? |
| A. | It may make it easier to understand the overall function of the circuit. |
| B. | It may reduce the number of gates. |
| C. | It may reduce the number of inputs required. |
| D. | all of the above |
| Answer» E. | |
| 218. |
Which statement below best describes a Karnaugh map? |
| A. | A Karnaugh map can be used to replace Boolean rules. |
| B. | The Karnaugh map eliminates the need for using NAND and NOR gates. |
| C. | Variable complements can be eliminated by using Karnaugh maps. |
| D. | Karnaugh maps provide a cookbook approach to simplifying Boolean expressions. |
| Answer» E. | |
| 219. |
Which of the following combinations cannot be combined into K-map groups? |
| A. | corners in the same row |
| B. | corners in the same column |
| C. | diagonal |
| D. | overlapping combinations |
| Answer» D. overlapping combinations | |
| 220. |
An AND gate with schematic "bubbles" on its inputs performs the same function as a(n)________ gate. |
| A. | NOT |
| B. | OR |
| C. | NOR |
| D. | NAND |
| Answer» D. NAND | |
| 221. |
A variable is a symbol used to represent a logical quantity that can have a value of 1 or 0. |
| A. | 1 |
| B. | |
| C. | 1 |
| D. | |
| Answer» B. | |
| 222. |
Mapping the SOP expression , we get ________. |
| A. | (A) |
| B. | (B) |
| C. | (C) |
| D. | (D) |
| Answer» C. (C) | |
| 223. |
One of De Morgan's theorems states that . Simply stated, this means that logically there is no difference between: |
| A. | a NOR and an AND gate with inverted inputs |
| B. | a NAND and an OR gate with inverted inputs |
| C. | an AND and a NOR gate with inverted inputs |
| D. | a NOR and a NAND gate with inverted inputs |
| Answer» B. a NAND and an OR gate with inverted inputs | |