Register
Webpage for Digital Logic:

Recent questions tagged digital-logic

0 votes
1 answer
784
Morris Mano Edition 3 Exercise 2 Question 15 (Page No. 71)
The sum of all the minterms of the boolean function of the n variable is 1. Prove the above statement with n = 3. give a Procedure for a general proof
The sum of all the minterms of the boolean function of the n variable is 1.Prove the above statement with n = 3.give a Procedure for a general proof
User Avatar
2 votes
2 answers
785
Morris Mano Edition 3 Exercise 2 Question 14 (Page No. 71)
Convert the following to the other canonical Form $(a) F(A,B,C,D) = \prod(0,1,2,3,4,6,12)$ $(b) F(x,y,z) = \sum(1,3,7)$
Convert the following to the other canonical Form$(a) F(A,B,C,D) = \prod(0,1,2,3,4,6,12)$$(b) F(x,y,z) = \sum(1,3,7)$
User Avatar
1 votes
2 answers
786
Morris Mano Edition 3 Exercise 2 Question 13 (Page No. 71)
Express the complement of the following function in the sum of minterms. $(a) F(A,B,C,D) = \sum(0,2,6,11,13,14)$ $(b) F(x,y,z) = \prod(0,3,6,7)$
Express the complement of the following function in the sum of minterms.$(a) F(A,B,C,D) = \sum(0,2,6,11,13,14)$$(b) F(x,y,z) = \prod(0,3,6,7)$
User Avatar
5 votes
2 answers
787
Morris Mano Edition 3 Exercise 2 Question 12 (Page No. 70)
Express the following function in the sum of minterms and The product of the maxterms. (a) F(A,B,C,D) = B’D + A’D + BD (b)F(x,y,z)=(xy + z)(xz + y)
Express the following function in the sum of minterms and The product of the maxterms.(a) F(A,B,C,D) = B’D + A’D + BD(b)F(x,y,z)=(xy + z)(xz + y)
User Avatar
2 votes
1 answer
790
Morris Mano Edition 3 Exercise 2 Question 9 (Page No. 70)
Obtain the truth tables of the following Boolean Functions. Express Each Function in Sum of minterm And Product of Maxterm. (xy + z)((y + xz) (A’ + B)(B’ + C) y’z + wxy’ +wxz’ + w’x’z
Obtain the truth tables of the following Boolean Functions. Express Each Function in Sum of minterm And Product of Maxterm.(xy + z)((y + xz)(A’ + B)(B’ + C)y’z + wx...
User Avatar
1 votes
2 answers
793
Morris Mano Edition 3 Exercise 2 Question 6 (Page No. 70)
Find the complement of the following boolean expressions x’y + xy’ (AB’ + C)D’ + E AB(CD’ + C’D) + A’B’(C + D’)(C’ + D) (X + Y’ + Z)(X’ + Z’)(X + Y)
Find the complement of the following boolean expressionsx’y + xy’(AB’ + C)D’ + EAB(CD’ + C’D) + A’B’(C + D’)(C’ + D)(X + Y’ + Z)(X’ + Z’)(X + Y)...
User Avatar
2 votes
1 answer
796
Morris Mano Edition 3 Exercise 2 Question 3 (Page No. 69)
Simplify the Boolean expression to the minimum numbers of the literals. $ABC + A’B + ABC’$ $X’YZ + XZ$ $( X+ Y)’(X’ + Y’)$ $XY + X(WZ + WZ’)$ $(BC’ + A’D)(AB’ + CD’)$
Simplify the Boolean expression to the minimum numbers of the literals. $ABC + A’B + ABC’$$X’YZ + XZ$$( X+ Y)’(X’ + Y’)$$XY + X(WZ + WZ’)$$(BC’ + A’D)(A...
User Avatar
2 votes
1 answer
797
Morris Mano Edition 3 Exercise 2 Question 2 (Page No. 69)
Simplify the following boolean Expressions to the minimum number of Literals x’y’ + xy + x’y (x + y)(x + y’) x’y + xy’ + xy + x’y’ x’ + xy + xz’ + xy’z’ xy’ + y’z’ + x’z’
Simplify the following boolean Expressions to the minimum number of Literalsx’y’ + xy + x’y(x + y)(x + y’)x’y + xy’ + xy + x’y’x’ + xy + xz’ + xy’z�...
User Avatar
2 votes
1 answer
799
Morris Mano Edition 3 Exercise 1 Question 33 (Page No. 35)
Show the content of the each of the registers if the two binary numbers added have decimal equivalent 257 and 514.
Show the content of the each of the registers if the two binary numbers added have decimal equivalent 257 and 514.
User Avatar
0 votes
1 answer
801
Morris Mano Edition 3 Exercise 1 Question 31 (Page No. 34)
The State of the 12 bit Register is 010110010111. What is the Content if it represents. a three decimal digit in BCD. a three Decimal digit in Excess-3 a three Decimal Digit in 2421
The State of the 12 bit Register is 010110010111. What is the Content if it represents.a three decimal digit in BCD.a three Decimal digit in Excess-3a three Decimal Digit...
User Avatar
0 votes
0 answers
804
Morris Mano Edition 3 Exercise 1 Question 28 (Page No. 34)
Decode the following ASCII Code: 1001010 1101111 1101000 1101110 0100000 1000100101111 1100101.
Decode the following ASCII Code: 1001010 1101111 1101000 1101110 0100000 1000100101111 1100101.
User Avatar
0 votes
0 answers
805
Morris Mano Edition 3 Exercise 1 Question 27 (Page No. 34)
Write your full name in ASCII using the 8-bit code with the leftmost most bit always 0. Include a space between the names and the period after a middle initial.
Write your full name in ASCII using the 8-bit code with the leftmost most bit always 0. Include a space between the names and the period after a middle initial.
User Avatar
0 votes
0 answers
806
Morris Mano Edition 3 Exercise 1 Question 26 (Page No. 34)
List the 10 BCD with the even parity in the leftmost position. (total of the five bits per digit).Repeat with the odd parity.
List the 10 BCD with the even parity in the leftmost position. (total of the five bits per digit).Repeat with the odd parity.
User Avatar
0 votes
1 answer
807
Morris Mano Edition 3 Exercise 1 Question 25 (Page No. 34)
Assign a binary number to some orderly manner to the 52 playing cards. use the minimum number of the bits.
Assign a binary number to some orderly manner to the 52 playing cards. use the minimum number of the bits.
User Avatar
0 votes
1 answer
808
Morris Mano Edition 3 Exercise 1 Question 24 (Page No. 34)
Represent the decimal number 3864 in 2421. Show that the code is self-complementing by taking the 9’s complement of 3864
Represent the decimal number 3864 in 2421. Show that the code is self-complementing by taking the 9’s complement of 3864
User Avatar
Page: