Draw logic circuit for a converter that converts 4 bit binary input to its equivalent BCD number. 8m Jun2008 A four bit number can be any number value between 0 to 15 i.e. 0 to F in Hexadecimal. BCD is a number which is represented in binary as a decimal number hence it can have… Read More »
Simplify the following Boolean function in SOP form using K-Map: F (A, B, C, D) = Σ ( 0,1, 2, 4, 6, 8, 9, 12, 14, 15 ). Also, draw the simplified logic circuit diagram. 8m Jun2008 K-Map for F is: Thus, the simplified equations for F (A, B, C, D) = Σ (0,1, 2, 4, 6,… Read More »
Construct the Karnaugh map for the following function, and find the function in sum of product form. Draw the resultant logic diagram. F (A, B, C, D): Σ (0, 2, 4, 5, 6, 7, 8, 10, 13, 15). 5m Dec2007 K-Map for F is: Thus, the simplified equations for F (A, B, C, D) =… Read More »
Simplify the following Boolean function using Karnaugh map method F( A ,B , C , D ) = Σ ( 1, 2 , 5 , 6 , 7 , 8 , 9 , 11 , 12 ,15 ) Also, draw the corresponding logic circuit diagram. 8m Jun2007 K-Map for F is: Thus, the simplified equations for F (A,… Read More »
Draw the logic diagram of a full adder. Create a 2-bit adder-subtractor circuit using the block diagram of the full adder 6m Jun2006 A combinational circuit which performs addition of two bits is called a half adder, while the combinational circuit which performs arithmetic addition of three bits (the third bit is the previous carry bit)… Read More »
Simplify the following boolean function in POS form using K-maps : F (A, B, C, D) = Σ (0, 2, 4, 5, 6, 8, 10, 13, 15) Also draw a logic diagram using only NAND gates. 5m Dec2005 K-Map for F is: Thus, the simplified equations for F (A, B, C, D) =… Read More »
RegisterA holds the 8-bits 11011001. Determine the B operand and the logic micro-operation to be performed in order to change the value in A to: 5m Dec2005 01101101 11111101 First refer the table for Logic micro-operations which can be applied. R1:- 1 0 1 0 (initial value) R2:- 1 1… Read More »