Q. A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is
P1 || P2 || P3 || ..... || Pk if and only if:

View solution

Q. The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is

View solution

Q. If an integer needs two bytes of storage, then the maximum value of a signed integer is

View solution

Q. If an integer needs two bytes of storage, then the maximum value of unsigned integer is

View solution

Q. Negative numbers cannot be represented in

View solution

Q. X – = Y + 1 means

View solution

Q. The absorption law in Boolean algebra say that

View solution

Q. The number of 1’s present in the binary representation of

10 × 256 + 5 × 16 + 5 is

View solution

Q. The hexadecimal number equivalent to (1762.46)8 is

View solution

Q. (A + B)(AB)’ is equivalent to

View solution

Q. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is

View solution

Q. What is decimal equivalent of BCD 11011.1100?

View solution

Q. The simplified form of the Boolean expression (X+Y+XY)(X+Z) is

View solution

Q. The answer of the operation (10111)2 * (1110)2 in hex equivalence is

View solution

Q. How many 1’s are present in the binary representation of

3 × 512 + 7 × 64 + 5 × 8 + 3

View solution

Q. The Boolean expression x’y’z+yz+xz is equivalent to:

View solution

Q. The octal equivalent of hexadecimal (A.B)16 is:

View solution

Q. The dual of the switching function x+yz is:

View solution

Q. The octal equivalent of the hexadecimal number FF is:

View solution

Q. The idempotent law in Boolean algebra says that:

View solution