Given the function F(x,y) = y'+(x+y) :
a) Make a truth table for F. [4 marks]
b) Express F as a sum of products. [3 marks]
c) Simplify F, either algebraically or by an explanation based upon the truth table. [3 marks]
a)
x | y | y' + (x +y) |
0 | 0 | 1 |
0 | 1 | 1 |
1 | 0 | 1 |
1 | 1 | 1 |
b)
It can be written in SOP as :
x'y' + x'y + xy' + xy
c)
F(x,y) = y'+(x+y)
We can further write as
x + (y'+y)
But we know
y'+y = 1
So we can write
x + 1 = 1
So F(x,y) = 1
Given the function F(x,y) = y'+(x+y) : a) Make a truth table for F. [4 marks]...
Given the function F(x,y,z) = xyztx,y2+xyz (a) List the truth table for F (b) Draw the logic diagram using the original Boolean expression (c) Simplify the expression (using any method you know) (d) Draw the logic diagram for the simplified expression.
Given the function : F = x + ( (yz)’(x’ + y’+ z’) )’ A) Write the truth table of F. B) Draw the K-map for F. C) Using the K-map, write the fully simplified Sum-Of-Products expression for F. D) Write the fully simplified product-of-sums expression for F
6. Given F(x,y,z) = x'yz + xz (20 points) 1) Express F as a sum of minterms using algebraic manipulation. (5 points) F(x, y, z)= (x'y + 2) Draw the truth table for F (5 points) 3) Implement the original function F using 2-input gates. (5 points) 4) Simplify Fusing algebraic mplify F using algebraic manipulation. (5 points)
[Marks) page2 [2] 3. Based on the following graph of function y = f(x), make a neat sketch of the graph of each indicated function: - y = f(x) y = f(-x) y = f(x) [3] 4. Write an equation for the quadratic function whose graph is given: A
Consider the function given below, F = (X+Y)(X + XY)2 + X(Y + 2) + XY + XYZ (a) Simplify the given function to its Sum of Products. (b) Draw gate-level schematic of simplified F function. (c) Realize this function with CMOS transistors and draw transistor-level schematic.
Given the following truth table, provide the corresponding product-of-sum boolean function. Does not simplify the function. In the answer, sort each sum in the order of "x, y, z". The sums should appear in the same order as that of the corresponding inputs in the truth table from top down. For example, in (x+y+z)(x'+y'+z') the sum x+y+z appears before x'+y'+z' because in the truth table the input (0,0,0) (x+y+z=0 for this input) is in the first row and the input...
4. Draw a system diagram and generate a truth table for the function. F(X, Y, Z) - XY Y.Z+Z'Y
. (a) Construct the truth-table for the Boolean function given by the formula A)). (3 marks) BJA (C (b) Find a Boolean circuit with AND, OR and NOT gates only that computes the Boolean function in (a) above and contains as few gates as possible. (4 marks) -((A (c) Determine whether the formula in (a) is equivalent to the formula (BA) (CA-A).
Given the Function F1(w, x, y, z) and F2(x0, x1, y0, y1), write the truth table for each function. F1(w, x, y, z) - Specified by the lab instructor F2(x0, x1, y0, y1) is a two bit adder. The function F2(x0, x1, y0, y1) has 3 outputs - 2 bits for the sum and 1 bit for the carry out Cout 3. Given the Function F1(w, x, y, z) and F2(x0, X1, yo, yı), write the truth table for each...
XYZ f(x,y,z) 111 110 101 100 011 010 001 000 Based on this truth table. What is the sum of products form? How to use a K-map to figure out the minimal form for this boolean function. What is the circuit digram for the minimized form?