ECET 299 Week 11 Final Digital Circuits Complete Solutions

MC
(TCO 3) Week 11, Final
Attempt 3(Current
What is Exam)

the
frequency
for a
periodic
waveform
with a
period of
100
µsec?(7
points)



100 Hz


10 kHz


100 kHz


10 MHz

Instructor Explanation: Dueck, Chapter 1.5


MC Week 11,
(TCO 3) In the decimal number 481, what is the powers-of-ten weight of the Final
digit 4?(7 points) Attempt
3(Curren
t Exam)



400


100

1
10

4
10

Instructor Explanation: Dueck, Chapter 1.3


MC
(TCO 3) How many bits are required to represent decimal numbers from Week 11,
Final
-32,768 to +32,767?(7 points) Attempt
3(Curren
t Exam)



10


15


16

, 18

Instructor Explanation: Dueck, Chapter 1.3


MC Week 11,
(TCO 3) The binary number 1100 is equivalent to what decimal number?(7 Final
points) Attempt
3(Curren
t Exam)



3


6


12


24

Instructor Explanation: Dueck, Chapter 1.3


MC
(TCO 3) The decimal number 25 is equal to what binary number?(7 points) Week 11,
Final
Attempt
3(Curren
t Exam)



10001


10011


10101


11001

Instructor Explanation: Dueck, Chapter 1.3


MC Week 11,
(TCO 3) What is the decimal number -34 expressed in 8-bit 2‟s complement Final
form?(7 points) Attempt
3(Curren
t Exam)



01011110


10100010


11011110

, 01011101

Instructor Explanation: Dueck, Chapter 7.3


MC
(TCO 3) What is the largest number that can be represented by 10 bits? (7 Week 11,
Final
points) Attempt
3(Curren
t Exam)



512


1023


1024


2048

Instructor Explanation: Dueck, Chapter 1.3


MC Week 11,
(TCO 3) What is the basic logic function that generates a LOW only if all of its Final
digital inputs are LOW?(7 points) Attempt
3(Curren
t Exam)



AND


OR


NOT


NAND

Instructor Explanation: Dueck, Chapter 2.1


MC
(TCO 3) If an input to a 3-input NAND gate is shorted to ground, the Week 11,
Final
output is (7 points) Attempt
3(Curren
t Exam)



HIGH.


LOW.


switching.


unknown.

, Instructor Explanation: Dueck, Chapter 2.2


MC
(TCO 3) Which logic gate implements the Boolean expression: Week 11,
Final
Attempt
3(Curren
t Exam)


? (7 points)

AND


OR


NAND


NOR

Instructor Explanation: Dueck, Chapter 2.2


Week 11, Final Attempt 3(Current Exam)
MC
(TCO 3)
How
many
entries
are
required
in a
truth
table to
describe
all
states
for a 4-
input
NAND
gate?(7
points)



4


8


16


32

Instructor Explanation: Dueck, Chapter 2.2


MC Week 11, Final Attempt 3(Current Exam)
(TCO 3) What is the Boolean equivalent of the expression: