Q. -8 is equal to signed binary number ?

View solution

Q. DeMorgan’s first theorem shows the equivalence of

View solution

Q. When signed numbers are used in binary arithmetic, then which one of the following notations would have unique representation for zero.

View solution

Q. In digital ICs, Schottky transistors are preferred over normal transistors because of their

View solution

Q. The decimal equivalent of Binary number 11010 is

View solution

Q. 1’s complement representation of decimal number of -17 by using 8 bit representation is

View solution

Q. The excess 3 code of decimal number 26 is

View solution

Q. The chief reason why digital computers use complemented subtraction is that it

View solution

Q. In a positive logic system, logic state 1 corresponds to

View solution

Q. Convert decimal 153 to octal. Equivalent in octal will be

View solution

Q. The decimal equivalent of (1100)2 is

View solution

Q. The binary equivalent of (FA )16 is

View solution

Q. Karnaugh map is used for the purpose of

View solution

Q. The 2’s complement of the number 1101110 is

View solution

Q. The decimal equivalent of Binary number 10101 is

View solution

Q. Divide overflow is generated when

View solution

Q. Arithmetic shift left operation

View solution

Q. The content of a 4-bit register is initially 1101. The register is shifted 2 times to the right with the serial input being 1011101.
What is the content of the register after each shift?

View solution

Q. If a register containing data (11001100)2 is subjected to arithmetic shift left operation, then the content of the register after 'ashl' shall be

View solution

Q. In addition of two signed numbers, represented in 2' s complement form generates an overflow if

View solution