1.
If you apply DeMorgan's theorem to
the expression of Y above , which answer do you get? (a, b, c, or
d)
2.
Which single two-input gate is equivalent to thecircuit of the
figure above?
A. AND
B. OR
C. NAND
D. XNOR
E. XOR
3. A Code-Word generator is to be designed. It uses four binary inputs, ABCD, and one output f. The circuit works as follows: there are only six valid input code words. Each valid code word consists of four-bits words (ABCD) that always contain two “0” and two “1”, not necessarily in order, for instance ABCD = “0101” and ABCD = “1100” are valid code words. The output f will be “1” if the input is a valid code word that corresponds to an even number (using ABCD as binary number with A the most significant digit and D the less significant digit) and “0” if the input is a validinput code that corresponds to a odd number. For instance the code word “1010” will be interpreted as the number ten (an even number) and therefore the output f will be “1”. Observe that a combination such as ABCD ="1000" (contain three equal inputs) is not valid and it will never occur.
The expression for the function f is:
A. f = ?m(2,4,6,8,10,12,14,15)
B. f = ?m(8,9,10,11,12,13,14,15) + d(0,1,2,3,4,5,6,7)
C. f = ?m(6,10,12) + d(0,1,2,4,7,8, 11,13,14,15)
D. None of the above
We need at least 10 more requests to produce the answer.
0 / 10 have requested this problem solution
The more requests, the faster the answer.
1. If you apply DeMorgan's theorem to the expression of Y above , which answer do...
Using DeMorgan's law determine which of the following Boolean expressions are equivalent to the Boolean expression shown below. Y =(A+B)D+C AY = (ABDC) BY = (A+B)(D+) CY - (AB+DC D. Y = (AB)+(DC) EY = A +B) + (D+C) F. Y = (AB+D) +
18. Apply DeMorgan's Theorem to X Y (Z+A) a. X+Y+(Z A) b. X-Y-(Z+ A) e.X+Y+(Z+A) d. X+Y+ (Z-A) e. None of the above 19. From the following diagram, convert it to a boolean expression (A truth table is provided if you so wish to use it, however, remember you need the Boolean expression for credit). B Output C A 0 1 0 0 0 0 0 0 1 1 0 0 1 0 1 1 1 1 a. A+B+C A...
A logic circuit realizing the function f has four inputs A, B, C, and D. The three inputs A, B, and C are the binary representation of the digits 0 through 7 with A being the most-significant bit. The input D is an odd-parity bit, i.e., the value of D is such that A, B, C, and D always contain an odd number of 1’s. (For example, the digit 1 is represented by ABC = 001 and D = 0,...
A Y = A ® B 1 1 1 0 0 1 1 1 Apply the idea of the truth table above and design a 3-bit comparator using XOR or XNOR gates of your choice. The design should be able to determine the equality between two 3-bit words. An LED should be turned ON only when every bit in "Word A" matches every corresponding bit in "Word B". Otherwise, the LED has to be OFF. Hint for I/O port Definitions:...
(a) Write a truth table. The input is 4-bit binary ABCD, A is MSB, D is LSB. The output is also represented by x. (b) Obtain an output expression in the form of a SOP. (c) Use Boolean Algebra to design a circuit consisting of only four inverters, four 3-input and gate, and one 4-input OR gate using the simplified and simplified expression obtained in (b). 4-6. The Excess-3 coding system is a four-bit digital coding system for encoding all...
A Y = A+ B 1 1 1 1 1 1 Apply the idea of the truth table above and design a 3-bit comparator using XOR or XNOR gates of your choice. The design should be able to determine the equality between two 3-bit words. An LED should be turned ON only when every bit in "Word A" matches every corresponding bit in "Word B". Otherwise, the LED has to be OFF Hint for I/O port Definitions: Port Name MSB...
1. (15 pts) Simplify the following Boolean functions using K-maps: a. F(x,y,z) = (1,4,5,6,7) b. F(x, y, z) = (xy + xyz + xyz c. F(A,B,C,D) = 20,2,4,5,6,7,8,10,13,15) d. F(A,B,C,D) = A'B'C'D' + AB'C + B'CD' + ABCD' + BC'D e. F(A,B,C,D,E) = (0,1,4,5,16,17,21,25,29) 2. (12 pts) Consider the combinational logic circuit below and answer the following: a. Derive the Boolean expressions for Fi and F2 as functions of A, B, C, and D. b. List the complete truth table...
1. Use K-maps to reduce each of the following to a minimized SOP form: (a) A + BC + CD (b) ABCD + ABCD + ABCD + ABCD (c) ABCD + CD) + ABCD + CD) + ABCD (d) (AB + ABXCD + CD) (e) AB + AB + CD + CD 2. Use K-maps to find the minimum SOP expression for the logic function shown in the table to the right. Implement the circuit using NAND gates only. Inputs...
acer Question Three Design a circuit with t wo inputs x & y representing the bits in a binary number and outputs a& b also representing bits in a binary number. When t output is reversed. When the input is 1 and 3, the output s O and 2, the Any carry forward is discarded a) Show your truth table b) Find and simplify the Boolean expression for the o utputs a & b. c) Draw one logic circuit to...
Computer Science: Computer Architecture 3. Do the following problems: Consider a circuit with 4 binary inputs. It counts the number of 1’s on its input and expresses (encodes or represents) the count as binary values on 2 output lines. a. Draw a truth table to represent the functions of the circuit. b. Provide SOP expressions for the output lines. c. Simplify the SOP expressions. d. Implement the circuit using 2-input NAND gates. 4. do the fowolling problems: a. Verify: xyz...