-> 1. Convert these numbers to appropriate number base: 11110000 (signed binary) (decimal) 11001111 (signed binary) -- (

[answerhappygod]

1 Convert These Numbers To Appropriate Number Base 11110000 Signed Binary Decimal 11001111 Signed Binary 1 (38.81 KiB) Viewed 30 times

-> 1. Convert these numbers to appropriate number base: 11110000 (signed binary) (decimal) 11001111 (signed binary) -- (decimal) 11001111 (unsigned binary) (decimal) 11001111 (unsigned binary) (hexadecimal) FFCO (signed hex) (binary) FFCO (signed hex) ... (decimal) -> -> 2. Assume a Boolean function F(x.7.2) = xy + y2 + xy + xyz. a- Write this function in the form of truth table. b- Write the function in minterm form Realize the function with gates in Sum-of-Products (SOP) form (draw the circuit diagram). d- Try to minimize the function F and realize the minimized function. 3. We have a Boolean function f(x,y,z) = 2(0,1,2,7) a. Write down the truth table and realize the function without reduction. - Try to minimize the function Realize the function by using only NAND gates. 4. Realize fx, y, z) = (0,2,3,4,7) a. In terms of minterms and draw the circuit diagram. b. In terms of maxterms, draw the circuit diagram. Minimize the given boolian function.