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 m – 1 literals less than the total number of variables n + m literals m + 1 literals less than the total number of variables n – m literals m – 1 literals less than the total number of variables n + m literals m + 1 literals less than the total number of variables ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics 1s Complement of 11001010 is 00110111 11001011 11001001 00110101 00110111 11001011 11001001 00110101 ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics A sequence of binary digits is known as word string input string byte string bit string word string input string byte string bit string ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics In VLSI, the number of gate circuits per chip is 10,000 to 99,999 50,000 to 99,999 < 10,000 > 10,000 10,000 to 99,999 50,000 to 99,999 < 10,000 > 10,000 ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics The most suitable gate for comparing two bits is OR NAND X-OR AND OR NAND X-OR AND ANSWER DOWNLOAD EXAMIANS APP
Digital Electronics The Quine– McClusky method of minimization of a logic expression is a (i) graphical method (ii) algebraic method (iii) tabular method (iv) a computer-oriented algorithm The correct answers are (ii) and (iv) (i) and (iii) (iii) and (iv) (i) and (ii) (ii) and (iv) (i) and (iii) (iii) and (iv) (i) and (ii) ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS