Discussion
Home ‣ Digital Electronics ‣ Combinational Logic Circuits Comments
- Question
Which of the following statements accurately represents the two BEST methods of logic circuit simplification?
Options- A. Boolean algebra and Karnaugh mapping
- B. Karnaugh mapping and circuit waveform analysis
- C. Actual circuit trial and error evaluation and waveform analysis
- D. Boolean algebra and actual circuit trial and error evaluation
- Correct Answer
- Boolean algebra and Karnaugh mapping
- 1. Convert BCD 0001 0111 to binary.
Options- A. 10101
- B. 10010
- C. 10001
- D. 11000 Discuss
- 2. The binary numbers A = 1100 and B = 1001 are applied to the inputs of a comparator. What are the output levels?
Options- A. A > B = 1, A < B = 0, A < B = 1
- B. A > B = 0, A < B = 1, A = B = 0
- C. A > B = 1, A < B = 0, A = B = 0
- D. A > B = 0, A < B = 1, A = B = 1 Discuss
- 3. Which statement below best describes a Karnaugh map?
Options- 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 visual approach to simplifying Boolean expressions. Discuss
- 4. A small circle on the output of a logic gate is used to represent the:
Options- A. Comparator operation.
- B. OR operation.
- C. NOT operation.
- D. AND operation. Discuss
- 5. Which of the examples below expresses the distributive law?
Options- A. (A + B) + C = A + (B + C)
- B. A(B + C) = AB + AC
- C. A + (B + C) = AB + AC
- D. A(BC) = (AB) + C Discuss
- 6. Each "1" entry in a K-map square represents:
Options- A. a HIGH for each input truth table condition that produces a HIGH output.
- B. a HIGH output on the truth table for all LOW input combinations.
- C. a LOW output for all possible HIGH input conditions.
- D. a DON'T CARE condition for all possible input truth table combinations. Discuss
- 7. A certain BCD-to-decimal decoder has active-HIGH inputs and active-LOW outputs. Which output goes LOW when the inputs are 1001?
Options- A. 0
- B. 3
- C. 9
- D. None. All outputs are HIGH. Discuss
- 8. Which of the following expressions is in the sum-of-products form?
Options- A. (A + B)(C + D)
- B. (AB)(CD)
- C. AB(CD)
- D. AB + CD Discuss
- 9. Which gate is best used as a basic comparator?
Options- A. NOR
- B. OR
- C. Exclusive-OR
- D. AND Discuss
- 10. The implementation of simplified sum-of-products expressions may be easily implemented into actual logic circuits using all universal ________ gates with little or no increase in circuit complexity. (Select the response for the blank space that will BEST make the statement true.)
Options- A. AND/OR
- B. NAND
- C. NOR
- D. OR/AND Discuss
Combinational Logic Circuits problems
Search Results
Correct Answer: 10001
Correct Answer: A > B = 1, A < B = 0, A = B = 0
Correct Answer: Karnaugh maps provide a visual approach to simplifying Boolean expressions.
Correct Answer: NOT operation.
Correct Answer: A(B + C) = AB + AC
Correct Answer: a HIGH for each input truth table condition that produces a HIGH output.
Correct Answer: 9
Correct Answer: AB + CD
Correct Answer: Exclusive-OR
Correct Answer: NAND
Comments
There are no comments.More in Digital Electronics:
Programming
Copyright ©CuriousTab. All rights reserved.