1. Consider the Boolean function F(x, y) = x + y, how many cells in the Kmap representing this function have value of “1”?
A. |
3 |
|
B. |
2 |
|
C. |
4 |
|
D. |
1 |
2.Using Kmap for simplification, we can select multiple smaller groups (instead of a larger group) as long as all “1” are selected.
A. |
False |
B. |
True |
3 In Kmap representation, how many values of “0”
and “1” two neighboring minterms can differ?2. Using Kmap for
simplification, we can select multiple smaller groups (instead of a
larger group) as long as all “1” are selected.
A. |
1 |
|
B. |
2 |
|
C. |
3 |
|
D. |
Depend on the number of variables |
4. Consider the Boolean function F(x, y) = x’y’ + xy, the minterm x’y’ represents the input pair _________________.
A. |
(x, y) = (0, 0) |
|
B. |
(x, y) = (1,1) |
|
C. |
(x, y) = (0, 1) |
|
D. |
(x, y ) = (1, 0) |
5. Using Kmap for simplification, number of elements grouped must be _________________.
A. |
Power of 2 |
B. |
Even numbers |
C. |
Any number as long as it simplifies the given Boolean function |
D. |
All of these |
6. Consider the Boolean function F(x, y) = xy, how many cells in the Kmap representing this function have value of “1”?
A. |
1 |
|
B. |
2 |
|
C. |
3 |
|
D. |
4 |
7. Using Kmap for simplification, groups can contain both “0” and “1” as long as they simplify the given function.
A. |
False |
|
B. |
True |
8. Minterm is to indicate a product term includes
A. |
all of the variables exactly once |
B. |
minimum presentation of a Boolean function |
C. |
minimum term of Boolean operation |
D. |
only variables with value of “1” |
9. Consider a Boolean function consisting of 4 variables, is it correct to say two cells in the upper right and lower left corners of the Kmap will never be grouped?
A. |
False |
B. |
True |
1. A. 3
2. False
Explanation: In a K map, it is always mandatory to select larger group of 1s.
4. A. (x, y) = (0, 0)
5. A. Power of 2
6. A. 1
NOTE: As per Chegg policy, I am allowed to answer specific number of questions (including sub-parts) on a single post. Kindly post the remaining questions separately and I will try to answer them. Sorry for the inconvenience caused
1. Consider the Boolean function F(x, y) = x + y, how many cells in the...
QUESTION 2 Using Kmap for simplification, groups can contain both “0” and “1” as long as they simplify the given function. A. False B. True
Q2: 1. Proof this Boolean expression. Use Boolean Algebra (X+Y). (Z+W).(X'+Y+W) = Y.Z+X.W+Y.W 2. For this BF F(X,,Z)=((XYZ)(X +Z))(X+Y) • Design the digital circuit Derive the Boolean Function of X, Y, Z. Simplify the Function Derive the truth table before and after simplification. Derive the BF F(X,Y,Z) as Maxterms (POS) and miterms (SOP). Implement the F(X,Y,Z) after simplification using NAND gates only. Implement the F(X,Y,Z) after simplification using OR NOR gates only.
using discrete structures 3. Consider the function F(x, y, z) for x, y, z z 0 defined as follows: a. F(x, y, 0)-y+1 b. F(x, 0, 1)-x c, F(x, 0, 2) = 0 d. F(x, 0, z+ 3)-1 e. F(x, y, z)-F(x, F(x, y-1, z), z-1) Using Induction, prove the following a. F(x, y, 1)-x +y b, F(x, y, 2) = xy c. F(x, y, 3)-xy 3. Consider the function F(x, y, z) for x, y, z z 0 defined...
Simplify the following Boolean expressions to the minimum number of terms using the properties of Boolean algebra (show your work and write the property you are applying). State if they cannot be simplified A. X’Y + XY B. (X + Y)(X + Y’) C. (A’ + B’) (A + B)’ D. ABC + A’B + A’BC’ E. XY + X(WZ + WZ’)
1) The Boolean function: F = AB + CD can be implemented by using one 3-to-8 decoder and one OR gate (any other external logic gates cannot be used). True or False. 2) What is the arithmetic equivalence for a shift right operation? 1) Half the value 2) Double the value 3) Add by two 4) Minus by two 3) What is the simplification result for Boolean expression: A(A+B) + A' + C
1. Consider two random variables X and Y with joint density function f(x, y)-(12xy(1-y) 0<x<1,0<p<1 otherwise 0 Find the probability density function for UXY2. (Choose a suitable dummy transformation V) 2. Suppose X and Y are two continuous random variables with joint density 0<x<I, 0 < y < 1 otherwise (a) Find the joint density of U X2 and V XY. Be sure to determine and sketch the support of (U.V). (b) Find the marginal density of U. (c) Find...
Consider the bivariate function f(x.y) = (x + y)/3 for 0< x< 1 and 0<y< 2 and f(x.y) = 0 3. otherwise. (a) Show that f(xy) is a density function. (b) Find the probability that both X and Y are less than one. (c) Find the marginal densities of X and Y and show that they are not independent. (d) Find the conditional density of X given Y when Y = 0.5.
Given g(x, y) = sigma (0, 1, 3), prove that g(x, y) = x + y using boolean algebraic simplification d. Given g(x, y) = Product (0, 1), Prove that g(x, y) - x using boolean algebraic simplification
Consider the Boolean function F1 = X' · Z + X ' · Y · Z + X · Y ' + X · Y' · Z (a) Implement F1, in the form as given, using 2-input ANDs, 2-input ORs and NOT gates. How many gates did you use? (b) Simplify F1 using Boolean algebra identities. Show all the steps & the identities used at each step. (c) Implement the simplified form of F1 using 2-input ANDs, 2-input ORs and...
3. Consider the following Boolean function. F(A, B, C, D)-(0, 1, 6, 7, 12, 13) a. Using K-map, simplify F in S.O.P. form b. What is the gate input count in (a)? c. Draw the logic circu in (a) d. Simply F using K-map in P.O.S. form. c. What is the gate input count in (d)? f. What should be your choice in terms of gate input count? 4. In our class, we implemented a BCD-to-Segment Decoder a. Draw Truth...