Digital Electronics In simplification of a Boolean function of n variables, a group of 2m adjacent 1s leads to a term with n + m literals n – m literals m + 1 literals less than the total number of variables m – 1 literals less than the total number of variables n + m literals n – m literals m + 1 literals less than the total number of variables m – 1 literals less than the total number of variables ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics Which mechanism allocates the binary value to the states in order to reduce the cost of the combinational circuits? State Assignment State Evaluation State Reduction State Minimization State Assignment State Evaluation State Reduction State Minimization ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics One bit full adder has ________ inputs 4 any number 3 2 4 any number 3 2 ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics What is the minimum number of NAND gates required to realize an X-OR gate? 5 6 4 3 5 6 4 3 ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics An X-OR gate gives a high output if there are odd number of 1s for odd decimal value. if it has even number of 0s if the decimal value of digital word is even if there are odd number of 1s for odd decimal value. if it has even number of 0s if the decimal value of digital word is even ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics An any or all gate is the other name of X-OR gate X-NOR gate AND gate OR gate X-OR gate X-NOR gate AND gate OR gate ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS