# ISRO CSE 2015

 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)
 A 2.5 B 3 C 3.5 D 4.5
Digital Logic   Number System
Question 1 Explanation:
 Question 2
The range of integers that can be represented by an n bit 2's complement number system is:
 A $-2^{n-1} \text { to }\left(2^{n-1}-1\right)$ B $-\left(2^{n-1}-1\right) \text { to }\left(2^{n-1}-1\right)$ C $-2^{n-1} \text { to } 2^{n-1}$ D $-\left(2^{n-1}+1\right) \text { to }\left(2^{n-1}-1\right)$
Digital Logic   Number System
Question 2 Explanation:
 Question 3
How many 32K x 1 RAM chips are needed to provide a memory capacity of 256K-bytes?
 A 8 B 32 C 64 D 128
Computer Organization   Memory Chip Design
Question 3 Explanation:
 Question 4
A modulus -12 ring counter requires a minimum of
 A 10 flip-flops B 12 flip-flops C 8 flip-flops D 6 flip-flops
Digital Logic   Sequential Circuit
Question 4 Explanation:
 Question 5
The complement of the Boolean expression $A B(\bar{B} C+A C)$ is
 A $(\bar{A}+\bar{B})+(B+\bar{C}) \cdot(\bar{A}+\bar{C})$ B $(\bar{A} \cdot \bar{B})+(B \bar{C}+\bar{A} \bar{C})$ C $(\bar{A}+\bar{B}) \cdot(B+\bar{C})+(A+\bar{C})$ D $(A+B) \cdot(\bar{B}+C)(A+C)$
Digital Logic   Boolean Algebra
Question 5 Explanation:
 Question 6
The code which uses 7 bits to represent a character is :
 A ASCII B BCD C EBCDIC D Gray
Digital Logic   Number System
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
 A 0,17 B 16,1 C 1,16 D 8,8
Digital Logic   Combinational Circuit
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.
 A 1 B 2 C 3 D 7
Digital Logic   Combinational Circuit
Question 8 Explanation:
 Question 9
The number of 1's in the binary representation of $(3*4096 + 15*256 + 5*16 + 3)$ are:
 A 8 B 9 C 10 D 12
Digital Logic   Number System
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 A B B C C D None of these
Digital Logic   Boolean Algebra
Question 10 Explanation:
There are 10 questions to complete.