Question 1 |

Which of the given number has its IEEE-754 32-bit floating point representation as (0 10000000 110 0000 0000 0000 0000 0000)

2.5 | |

3 | |

3.5 | |

4.5 |

Question 1 Explanation:

Question 2 |

The range of integers that can be represented by an n bit 2's complement number system is:

-2^{n-1} \text { to }\left(2^{n-1}-1\right) | |

-\left(2^{n-1}-1\right) \text { to }\left(2^{n-1}-1\right) | |

-2^{n-1} \text { to } 2^{n-1} | |

-\left(2^{n-1}+1\right) \text { to }\left(2^{n-1}-1\right) |

Question 2 Explanation:

Question 3 |

How many 32K x 1 RAM chips are needed to provide a memory capacity of 256K-bytes?

8 | |

32 | |

64 | |

128 |

Question 3 Explanation:

Question 4 |

A modulus -12 ring counter requires a minimum of

10 flip-flops | |

12 flip-flops | |

8 flip-flops | |

6 flip-flops |

Question 4 Explanation:

Question 5 |

The complement of the Boolean expression A B(\bar{B} C+A C) is

(\bar{A}+\bar{B})+(B+\bar{C}) \cdot(\bar{A}+\bar{C}) | |

(\bar{A} \cdot \bar{B})+(B \bar{C}+\bar{A} \bar{C}) | |

(\bar{A}+\bar{B}) \cdot(B+\bar{C})+(A+\bar{C}) | |

(A+B) \cdot(\bar{B}+C)(A+C) |

Question 5 Explanation:

Question 6 |

The code which uses 7 bits to represent a character is :

ASCII | |

BCD | |

EBCDIC | |

Gray |

Question 6 Explanation:

Question 7 |

If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be

0,17 | |

16,1 | |

1,16 | |

8,8 |

Question 7 Explanation:

Question 8 |

Minimum number of 2x1 multiplexers required to realize the following function, f=\bar{A} \bar{B} C+\bar{A} \bar{B} \bar{C}

Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available.

Assume that inputs are available only in true form and Boolean a constant 1 and 0 are available.

1 | |

2 | |

3 | |

7 |

Question 8 Explanation:

Question 9 |

The number of 1's in the binary representation of (3*4096 + 15*256 + 5*16 + 3) are:

8 | |

9 | |

10 | |

12 |

Question 9 Explanation:

Question 10 |

The boolean expression A B+A B^{\prime}+A^{\prime} C+A C is independent of the boolean variable

A | |

B | |

C | |

None of these |

Question 10 Explanation:

There are 10 questions to complete.