Convert the following decimal number 38 into a hexadecimal number.
Write the minimal POS expression for a given function:
f(A,B,C,D) = M( 1 , 5 , 7 , 10 , 12 , 13 , 15 )
Let A= 1100 1010 and B= 0000 0100 be two 8-bit 2's complement numbers. Their product in 2's complement is _______.
Consider the following circuit:
The above circuit counts from 0 to ____.
How many full adders needed to construct 8-bit parallel adder?
Given a logic circuit below
What is the output of above circuit if y1, y2, y3 is a binary number?
The orange box in the below figure consists of a minimum complexity circuit that uses only AND , OR and NOT gates. The function f(x,y,z) = 1 where any of the following conditions are satisfied :
- x is not equal to y and z is grounded
- y is equal to z , and x is set low
- x is equal to y , y is equal to z but x not equal to z
Then which of the following equations leads to correct design for the minimum complexity circuit :
The number of literals in simplified function F=(x+y)(x’+y)(x+y’)(x’+y’)
Identify the minimal product-of-sums function described by the K-map given in the figure. Where ϕ is don’t care
The simplified form of the Boolean expression Y= can be written as.