Que. 1 |
The majour disadvantage of magnetic tapes is |
A |
|
cost |
B |
|
unreliability of stored data |
C |
|
slow data recording |
D |
|
data is to be accessed sequentially |
|
Que. 2 |
In time division multiplexing |
A |
|
time is doubled betwen bits and byte |
B |
|
time slicing at CPU level takes place |
C |
|
total time available in the channel is divided between several
users and each users is alloted a time slice |
D |
|
none of these |
|
Que. 3 |
The number of full and half-adders required to add 16-bit numbers
is |
A |
|
8 half-adders, 8 full-adders |
B |
|
1 half-adder, 15 full-adders |
C |
|
16 half-adders, 0 full-adders |
D |
|
4 half-adders, 12 full-adders |
|
Que. 4 |
The simultaneous equations on the Boolean variables x, y, z and w, x+y+z=l
xy =0 xz+w = l x+[(complement)z w] =0 have the following solution
for x, y, z and w, respectively. |
A |
|
0 1 0 0 |
B |
|
1 1 0 1 |
C |
|
1 0 1 1 |
D |
|
1 0 0 0 |
|
Que. 5 |
The 2's complement representation of (-539) 10 in hexadecimal is |
A |
|
ABE
(BDBC |
B |
|
wx'y'+xy+xz |
C |
|
DE5 |
D |
|
9E7 |
|
Que. 6 |
How many gates are needed for 3-bit up counter using standard binary and
using T flip-flop?Assume unlimited fan-in |
A |
|
4 |
B |
|
3 |
C |
|
2 |
D |
|
1 |
|
Que. 7 |
A boolean function x'y'+xy+x'y is equivalent to |
A |
|
x'+y' |
B |
|
x+y |
C |
|
x+y' |
D |
|
x'+y |
|
Que. 8 |
In an SR latch by crossing coupling two NAND gates if both S and R inputs
are set to 0 then it will result in |
A |
|
Q=0, Q'=1 |
B |
|
Q=1, Q'=0 |
C |
|
Q=1, Q'=1 |
D |
|
indeterminate state |
|
Que. 9 |
In 2's complement addition overflow |
A |
|
is flagged whenever there is carry from sign bit addition |
B |
|
cannot occur when positive values added to the negative value |
C |
|
is flagged whenever there is carry from sign bit solution |
D |
|
none of the above |
|
Que. 10 |
the minimum number of NAND gates required to implement the boolean function
A+AB+ABC= |
A |
|
0 |
B |
|
1 |
C |
|
4 |
D |
|
7 |