(2 pts) Which of the following statements is not true of a hardware description language (HDL) simulator?
a. Input values are determined automatically by the HDL simulator
b. A designer provides input values intended to test the system
c. Output values are determined automatically by the HDL simulator
d. An HDL’s key purpose is to support simulation
a.
(2 pts) Which of the following statements is true of Verilog?
a. Verilog is an HDL that originated in 1985 at a company called Gateway Design Automation
b. Verilog is an HDL that was first published in 1987 as an IEEE standard
c. Verilog was developed at the behest of the U.S. Dept. of Defense
d. Verilog’s syntax is borrowed largely from Ada, an earlier DoD language for software programming
a.
(2 pts) Which of the following is true of an assignment statement p = x & y & z?
a. The assignment operator must be <=
b. The assignment operator must be ==
c. An assignment statement assigns the right-side variable with the result of the left-side expression
d. An assignment statement assigns the left-side variable with the result of the right-side expression
d.
(2 pts) Identify the example that represents the accurate conversion of a Boolean expression to Verilog.
a. x = a’bc’ is converted to x = a & b & c
b. x = a + b + c’ is converted to x = a | b | c
c. x = (pq) (rs) + a is converted to x = (p & q) (r & s) + a
d. x = (pq) + (rs) + a’ is converted to x = (p & q) | (r & s) | ~a
d.
Short-Answer Questions (40 pts)
(5 pts) Perform the following number-system conversions (show your work):
a. $129_{10} = ()_{2}$
b. $0011010_{2} = ()_{10}$
c. $0F100_{16} = ()_{2}$
d. $1001101101101_{2} = ()_{16}$
a. $129_{10} = (10000001)_{2}$
b. $0011010_{2} = (26)_{10}$
c. $0F100_{16} = (0000 1111 0001 0000 0000)_{2}$
d. $1001101101101_{2} = (136D)_{16}$
(5 pts) Draw the NAND(x,y) gate CMOS transistor circuit. Show the conduction path and output value when:
a. x = 1 and y = 0
b. x = 1 and y = 1
(5 pts) Convert the following equation directly to gate-level circuits: F = a + bcd’ + a’e + f’
(5 pts) Expand F(w,y,z) = wy to
a. sum-of-minterms form
b. product-of-maxterms form
a. F(w,y,z) = wyz’ + wyz
b. F(w,y,z) = (w + y + z)(w + y + z’)(w + y’ + z)(w + y’ + z’)(w’ + y + z)(w’ + y +z')
(5 pts) A car has a fuel-level detector that outputs the current fuel-level as a 3-bit binary number, with 000 meaning empty and 111 meaning full. Create a circuit that illuminates a “low fuel” indicator light (by setting an output L to 1) when the fuel level drops below level 3.
Step 1: Capture the function (truth table)
Step 2A: Create equation (canonical form)
L = F2’F1’F0’ + F2’F1’F0 + F2’F1F0’
Step 2B: Create circuit
(5 pts) Convert the function F shown in the truth table in Table below to an product-of-sum equation. Don’t minimize the equation.
F = (a + b + c)(a + b’ + c)(a + b’ + c’)(a’ + b + c)(a’ + b + c')
(5 pts) Use the theorems of boolean algebra to simplify the following logic function: F = m·n·o + q’·p’·n’ + p·r·m + q’·o·m·p’ + m·r (hint, the result has three terms. Don’t spend too much time on this one. If stuck, move on first)
