LOGICS KAYA TO!!

0

(x + y)' (x' + y')'

1001 0011 0111

93710 in BCD code is

A'C + AC'

f(A,B,C) = m1 + m3 + m4 +m6

xy'z'

f(w,x,y,z) = (xy' + w'z) (wx' + y'z')

x'y + yz + xy'z'

f(x,y,z) = x'y + xy'z' + xyz

xy + x'z

yz + xyz' + x'y'z

0

Applying one of the theorems, simplified expression for (X + Y'Z)(X + Y'Z)' = ?

171707.58

Convert 1111001111000111.10102 to Octal

11010110

Convert 21410 to binary

X' + Y'

De Morgan Theorem states that (X+Y)' = X'∙ Y' and (X∙Y)' =?

(A + B + C) (A + B + C') (A + B' + C)

Derive the algebraic expression for F and express it in the maxterm expansion form

A'BC+ AB'C'+ AB'C+ ABC'+ ABC

Derive the algebraic expression for F and express it in the minterm expansion form

Z = π M (2,3,4,5,6,9,10,11,12,13)

Design a combinational logic circuit that has four inputs (A,B,C,D) and one output Z. The output is 1 iff the input has three consecutive 0's or three consecutive 1's. For example, if A=1, B=0, C=0 and D=0. then Z=1, but if A=0, B=1, C=0 and D=0 then Z=0. (Hint: Draw the truth table first then perform K-mapping or minterm expansion) The abbreviated maxterm expansion of Z is

A'B'C' + ABC + BCD + B'C'D'

Design a combinational logic circuit that has four inputs (A,B,C,D) and one output Z. The output is 1 iff the input has three consecutive 0's or three consecutive 1's. For example, if A=1, B=0, C=0 and D=0. then Z=1, but if A=0, B=1, C=0 and D=0 then Z=0. (Hint: Draw the truth table first then perform K-mapping or minterm expansion) The simplified SOP of function Z associated with the problem is

0

FF' =

(W + X')(W + Y)(W + Z)

Factor W + X'YZ to obtain a POS

same as previous output

For S-R Latch: If S=1 R=1 Clock=0, What is the value of Q and Q'?

the minterm numbers that are not present in F

For a given F, the minterm expansion of F' can be obtained by

3

How many bits are needed to represent 8 different colours? Each colour must have a unique code

0 carry 1

In binary addition, 1 + 1 =?

a parallel circuit

In switching circuits the OR gate can be thought of as

ACD' + BE

Multiply out and simplify (A + B) (C + B)(D' + B) (ACD' + E)

MARY JANE SAMONTE

PINAKAMATAGAL NA NAGTUTURO SA SOIT

R + T'

R'T' + RS' + RS

A + BC

Simplifying the function F will result to

B' (E' + C) ( E' + A' + D')

The POS equivalent to A'B'C + B'CD' + B'E'

XY + X'Y'

The XNOR function X๏Y is equivalent to

F = π M (2,5,6,7)

The abbreviated maxterm expansion of the truth table is

F = Σm (0,1,3,4)

The abbreviated minterm expansion of the truth table is

C + B

The circuit expression of F when simplified reduces only to

[(A' + B)'∙ B]'∙ C + B

The circuit output of F is

AB' + C

The complement of (A' + B) C' is

ac'd'fg

The consensus term of abc'd' and ab'fg is

XY' + Y = X + Y

The duality of (X + Y')Y = XY is

adding 0011

The excess-3 code is obtained from the 8-4-2-1 code by

Y' + Z'

The expression Y' + YZ' can be further simplified into.

d.

The output for F is NOTE: XNOR SYMBOL ≡

AB'C'D'

The product term for which F(A,B,C,D) = 1 iff. A = 1, B = C = D = 0 is

W + X + YZ

The simplified F is equivalent to

AB'CD + E'FCD

The simplified form of [AB' + (CD)' + E'F] CD is

F = X'Y + XZ

The simplified form of the circuit above is

A' + BD' + B'D

The simplified form of the given circuit is

A + B + C' + D'

The sum term for which F(A,B,C,D) = 0 iff A = B = 0 and C = D = 1

ABC + ABD

Using De Morgan's theorem, the minimum SOP of [(AB)' + C'D']' is

ACD' + BE

Using the theorem (X+Y)∙(X+Z)= X+YZ. The SOP equivalent of (A + B) (B + C) (D' + B) (ACD' + E)

F' is equivalent to

W' X' Y' + W' X' Z'

Hexadecimal

What do you call a number system with a radix of 16?

101

What is 0.62510 in binary?

0110

When 0.710 is converted to binary the repeating bit is

Gray code

Which of the following is not a weighted code?