m1t1 1-3

A:0. Worksheet IV-.. Worksheet IV 2021 1. Identify each of the following expressions as SOP, standard SOP, POS, or standard POS: (a) AB + ABD + ĀCD (c) ABC + ABC (b) (A + B + C)(A + B + C) (d) A(A + C)(A + B) 2. Convert each SOP expression in Question 1 to standard form. 3. Convert each POS expression in Question 1 to standard form. 4. Obtain the truth table of the following functions, and express each function in sum-of-minterms and product-of-maxterms form: (a (xy + 2)(y + x) (c) x'z + wx'y + wy:' + w'y' (b) (x +y')(y' + z) (d) (xy + yz' + x'z)(x + z) .5. Simplify the following Boolean expressions to a minimum number of literals: (a) ABC + A'B + ABC' (c) (x + y)'(x' + y') (e) (BC' + A'D)(AB' + CD') (b) x'yz + xz (d) xy + x(wz + wz') (f) (x + y' + z')(x' + z') 6. Write the Boolean equations and draw the logic diagram of the circuit whose outputs are defined by the following truth table: 1 1 1 Page 1 of 1

1. Consider the function of 3 variables specified with the following sum of products (SOP) form. F(X, Y, Z) = XY'Z'+ X'Y a) Specify the function with a canonical SOP form. Use minterm numbers. Minterm numbers can be identified using product terms presented with "0-1-dash" notation. b) Specify the function with a canonical product of sums (POS) from. Use Maxterm numbers. c) Minimize the function using K-map: obtain the minimal SOP and POS forms for the function.

Please help and be very thorough

Information theory course

2:38 docs.google.com A In register indexed addressing mode, the - effective address is given by the sum of the index register value and displacement. difference of the index register value and displacement. index register value. O The Data bus is - a group of bidirectional 20 lines. a group of bidirectional 16 lines. a group of unidirectional 20 lines. Indicate the result of SAR BL, CL, if CL=4- and BX=FOE2H FFFEH FFE2H FOFEH Indicate the rSSuIEOFCMP DH, AL , if-

1:22 Homework2 S24_64688b88db19e... 3. Implement the following equation on a PLD structure: F = AB+BC + AC Done 4. Use Karnaugh maps to simplify the following Boolean functions expressed in the sum of minterms. Please clearly show your Karnaugh maps, circling, and place your final Boolean equation on the line provided. a. 3 Variables: A(x,y,z) = m0+ m4+m5+m7 b. 3 Variables: B(x,y,z) = m1 + m2 + m4 + m6 c. 4 Variables: C(w, x, y, z) = (0, 2, 4, 5, 7, 8, 10, 13, 14) d. 4 Variables: D(w, x, y, z) = (0, 1, 5, 6, 8, 9, 10, 12, 13, 14) Q

Convert the Moore state diagram of the following figure into an equivalent ASM chart. Check only one variable in each decision box. Minimize the number of decision boxes in each ASM block.

also show all groupings on the K-Map

Create the Kmap and then simplify for the functions (leave in sum-of-products form): F(w, x, y, z) = w′x′y′z + w′x′yz′ + w′xy′z + w′xyz + w′xyz′ + wxy′z + wxyz + wx′y′z

Given the multiplexer circuit below, which of the following Boolean expressions is equivalent to function F of this circuit? 0 1 FO 4-to-1 MUX 2-to-1 MUX вс F1 2-to-1 1 MUX Select one: a. A'C + AB + AC b. A'B'C + AB + AC' + BC C. A'B'C + A'BC' + AB'C d. A'B'C • ABC 012

Q2. Construct the Mealy and Moore state diagrams for a sequence detector that outputs a 1 when the pattern 100 is detected in the data stream. Sample sequence of data. Fill in the output z 01 0 1 1 1 0 01 0 0 Input (x) Output (z) 00 1000 101 0 0 10 1 001 a) Draw the Mealy State diagram

Implement the following function F by using one 8-to-1 multiplexer. F(A, B, C, D) = ∑m(2, 5, 6, 7, 13, 14, 15)

let us say we are given ZA and Z'B and those two are prime implicants of a specific function. The Z standing for a variable, while the A and B are both two product terms. Consider A*B does not equal to zero, Is their consensus AB an implicant? Also is it a prime implicant? If the answer is yes a prime implicant then prove it. If the anwer is no not a prime implicant give a counterexample to show the opposite.

The Karnaugh map for a Boolean function is given as CD C'D АВ C'D CD CD A'B A'B 1 АВ 1 1 1 АВ 1 1 The simplified Boolean equation for the above Karnaugh Map is 1