Just need help with answers, thanks QUESTION 1 The input...

Just need help with answers, thanks

QUESTION 1

The input combination of A = 1, B = 0, C = 0, and D = 1 would be represented on a Karnaugh map by the square labeled:

BCD

A  

ABCD

A  D

10 points  

QUESTION 2

Which of the following statements accurately represents the two best methods of logic circuit simplification?

Boolean algebra and Karnaugh mapping

Karnaugh mapping and circuit waveform analysis

Boolean algebra and actual circuit trial and error evaluation

Actual circuit trial and error evaluation and waveform analysis

10 points  

QUESTION 3

Each "1" in a K-map square represents:

an input combination that results in a HIGH output.

an input combination that results in a LOW output.

an input combination that results in a DON'T CARE grouping.

None of the above.

10 points  

QUESTION 4

Select the statement that best describes the use of "Don't Care" conditions on a K-map.

Don't Care conditions may only be changed to 1s.

Don't Care conditions should never occur and should not be included in K-map simplification procedures.

Don't Care conditions may only be changed to 0s.

Don't Care conditions may be changed to either a 0 or a 1.

10 points  

QUESTION 5

K-map 4-1

​  D C D C 

  1 0 0 1

 B 0 1 1 0

A B 0 0 0 0

A 1 0 0 1

Which of the following is the simplest output expression for the logic circuit represented by K-map 4-1?

X =  + A  + B D

X =  + C + B D

X = B D + C

X = B D +  

10 points  

QUESTION 6

A logic circuit contains the following: a 3-input NOR gate with inputs A, B, and C, a 2-input NOR gate with inputs C and D, and a 2-input AND gate that is driven by the NOR gate outputs. The correct Boolean expression for the circuit output (X) is:

X =  + 

X = 

X = (A + B + C) (C + D)

X = () ()

10 points  

QUESTION 7

High-level logic compilers can receive input by all but what method?

schematic capture

Boolean equations

truth tables

narrative descriptions

10 points  

QUESTION 8

A combinatorial logic circuit has memory characteristics that "remember" the inputs after they have been removed.

 True

 False

10 points  

QUESTION 9

Using Boolean algebra, the expression Y =    C +  BC + A C + ABC simplifies to:

Y = BC + C

Y = B C +  C + AC

Y = BC + (B) + + 

Y = C

10 points  

QUESTION 10

Which of the following voltage ranges defines acceptable low-level input for a CMOS IC?

2 - 5 V

0 - 2 V

0 - 0.8 V

0 - 1.5 V

Image transcription text

QUESTION 1 The input combination of A = 1, B = 0, C =0, and D = 1 would be represented on a Karnaugh map by the square labeled: O ABCD O ABCD ABCD O ABCD QUESTION 2 Which of the following statements accurately represents the two best methods of logic circuit simplification? Boolean algebra and Karnaugh mapping O Karnaugh mapping and circuit waveform analysis Boolean algebra and actual circuit trial and error evaluation Actual circuit trial and error evaluation and waveform analysis QUESTION 3 Each "1" in a K-map square represents: O an input combination that results in a HIGH output O an input combination that results in a LOW output O an input combination that results in a DON'T CARE grouping None of the above. QUESTION 4 Select the statement that best describes the use of "Don't Care" conditions on a K-map. O Don't Care conditions may only be changed to 1s. Don't Care conditions should never occur and should not be included in K-map simplification procedures. Don't Care conditions may only be changed to Os. Don't Care conditions may be changed to either a 0 or a 1. QUESTION 5 K-map 4-1 CD CD CD A B A B A B AB Which of the following is the simplest output expression for the logic circuit represented by K-map 4-1? OX=ABD + ABD + ABD OX=BCD +BCD + ABD OX=ABD +AC OX= ABD-BD Click Save and Submit to save and submit. Click Save All Answers to save all answers.

... Show more

Image transcription text

QUESTION 6 A logic circuit contains the following: a 3-input NOR gate with inputs A, B, and C, a 2-input NOR gate with inputs C and D. and a 2-input AND gate that is driven by the NOR gate outputs. The correct Boolean expression for the circuit output (X) is: O X = ABC + CD O X = ABC + CD O X = ( A + B + C ) ( C + D) O X = ( A + B + C ) ( C + D) QUESTION 7 High-level logic compilers can receive input by all but what method? schematic capture Boolean equations truth tables narrative descriptions QUESTION 8 A combinatorial logic circuit has memory characteristics that "remember" the inputs after they have been removed. O True O False QUESTION 9 Using Boolean algebra, the expression Y = A B C + ABC + ABC + ABC simplifies to: OY = BC + BC O Y=BC+ABC+ ABC O Y= BC + (BC) + A + A OY = C QUESTION 10 Which of the following voltage ranges defines acceptable low-level input for a CMOS IC? O 2- 5V 0- 2V O 0-0.8 V 0- 1.5 V Click Save and Submit to save and submit. Click Save All Answers to save all answers. Save All Answers SAMSUNG

... Show more