MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 23 Mcqs, each offering curated multiple-choice questions to sharpen your Digital Circuits knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In case of XOR/XNOR simplification we have to look for the following _______________ |
| A. | Diagonal Adjacencies |
| B. | Offset Adjacencies |
| C. | Straight Adjacencies |
| D. | Both diagonal and offset adjencies |
| Answer» E. | |
| 2. |
There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and _________________ operations. |
| A. | X-NOR |
| B. | XOR |
| C. | NOR |
| D. | NAND |
| Answer» B. XOR | |
| 3. |
It should be kept in mind that don’t care terms should be used along with the terms that are present in ___________ |
| A. | Minterms |
| B. | Expressions |
| C. | K-Map |
| D. | Latches |
| Answer» B. Expressions | |
| 4. |
Don’t care conditions can be used for simplifying Boolean expressions in ___________ |
| A. | Registers |
| B. | Terms |
| C. | K-maps |
| D. | Latches |
| Answer» D. Latches | |
| 5. |
Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given ___________ |
| A. | Function |
| B. | Value |
| C. | Set |
| D. | Word |
| Answer» B. Value | |
| 6. |
Product-of-Sums expressions can be implemented using ___________ |
| A. | 2-level OR-AND logic circuits |
| B. | 2-level NOR logic circuits |
| C. | 2-level XOR logic circuits |
| D. | Both 2-level OR-AND and NOR logic circuits |
| Answer» E. | |
| 7. |
The prime implicant which has at least one element that is not present in any other implicant is known as ___________ |
| A. | Essential Prime Implicant |
| B. | Implicant |
| C. | Complement |
| D. | Prime Complement |
| Answer» B. Implicant | |
| 8. |
Each product term of a group, w’.x.y’ and w.y, represents the ____________ in that group. |
| A. | Input |
| B. | POS |
| C. | Sum-of-Minterms |
| D. | Sum of Maxterms |
| Answer» D. Sum of Maxterms | |
| 9. |
The K-map based Boolean reduction is based on the following Unifying Theorem: A + A’ = 1. |
| A. | Impact |
| B. | Non Impact |
| C. | Force |
| D. | Complementarity |
| Answer» C. Force | |
| 10. |
A Karnaugh map (K-map) is an abstract form of ____________ diagram organized as a matrix of squares. |
| A. | Venn Diagram |
| B. | Cycle Diagram |
| C. | Block diagram |
| D. | Triangular Diagram |
| Answer» B. Cycle Diagram | |
| 11. |
IT_SHOULD_BE_KEPT_IN_MIND_THAT_DON‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•T_CARE_TERMS_SHOULD_BE_USED_ALONG_WITH_THE_TERMS_THAT_ARE_PRESENT_IN?$# |
| A. | Minterms |
| B. | Maxterm |
| C. | K-Map |
| D. | Latches |
| Answer» B. Maxterm | |
| 12. |
There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and _________________ operations.$ |
| A. | X-NOR |
| B. | XOR |
| C. | NOR |
| D. | NAND |
| Answer» B. XOR | |
| 13. |
Using the transformation method you can realize any POS realization of OR-AND with only.$ |
| A. | XOR |
| B. | NAND |
| C. | AND |
| D. | NOR |
| Answer» E. | |
| 14. |
Entries known as _______________ mapping. |
| A. | Diagonal |
| B. | Straight |
| C. | K |
| D. | None of the Mentioned |
| Answer» B. Straight | |
| 15. |
In case of XOR/XNOR simplification we have to look for the following____________________ |
| A. | Diagonal Adjacencies |
| B. | Offset Adjacencies |
| C. | Straight Adjacencies |
| D. | Both diagonal and offset adjencies |
| Answer» E. | |
| 16. |
These logic gates are widely used in _______________ design and therefore are available in IC form. |
| A. | Circuit |
| B. | Digital |
| C. | Analog |
| D. | Block |
| Answer» C. Analog | |
| 17. |
Don’t care conditions can be used for simplifying Boolean expressions i?# |
| A. | Examples |
| B. | Terms |
| C. | K-maps |
| D. | Latches |
| Answer» D. Latches | |
| 18. |
Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given |
| A. | Function |
| B. | Value |
| C. | Set |
| D. | None of the Mentioned |
| Answer» B. Value | |
| 19. |
Product-of-Sums expressions can be implemented using |
| A. | 2-level OR-AND logic circuits |
| B. | 2-level NOR logic circuits |
| C. | 2-level XOR logic circuits |
| D. | Both 2-level OR-AND and NOR logic circuits |
| Answer» E. | |
| 20. |
The prime implicant which has at least one element that is not present in any other implicant is known as |
| A. | Essential Prime Implicant |
| B. | Implicant |
| C. | Complement |
| D. | None of the Mentioned |
| Answer» B. Implicant | |
| 21. |
Each product term of a group, w’.x.y’ and w.y, represents the ____________in that group.$ |
| A. | Input |
| B. | POS |
| C. | Sum-of-Minterms |
| D. | None of the Mentioned |
| Answer» D. None of the Mentioned | |
| 22. |
The K-map based Boolean reduction is based on the following Unifying Theorem: A + A’ = 1.$ |
| A. | Impact |
| B. | Non Impact |
| C. | Force |
| D. | None of the Mentioned |
| Answer» C. Force | |
| 23. |
There are ______ cells in a 4-variable K-map. |
| A. | 12 |
| B. | 16 |
| C. | 18 |
| D. | None of the Mentioned |
| Answer» C. 18 | |