Page 330 - FUNDAMENTALS OF COMPUTER
P. 330

NPP













                   330                         Fundamentals of Computers                           NPP


                   Q.5. The code in which each successive value changes in single bit only is:
                        H$moS> {Og‘| Ho$db qgJb {~Q> ‘| à˶oH$ g³go{gd H$moS> H$s d¡ë¶y M|O hmoVr h¡
                        (a) ASCII          (b) EBCDIC          (c) Gray Code / J«o H$moS>(d) None / H$moB© Zht
                   Q.6. Multiplication in computer circuits is done by:
                        H$åß¶yQ>a g{H©$Q²>g ‘| ‘ëQ>rpßbHo$eZ {ZåZ Ho$ Ûmam {H$¶m OmVm h¡:
                        (a) successive addition / g³go{gd E{S>eZ  (b) successive subtraction / g³go{gd g~ñQ´>¡³eZ
                        (c) successive division / g³go{gd {S>{dOZ  (d) None of these / BZ‘| go H$moB© Zht
                   Q.7. Division in computer circuits is done by:
                        H$åß¶yQ>a g{H©$Q²>g ‘| {S>{dOZ {ZåZ Ho$ Ûmam {H$¶m OmVm h¡:

                        (a) successive addition / g³go{gd E{S>eZ  (b) successive subtraction / g³go{gd g~ñQ´>¡³eZ
                        (c) successive division / g³go{gd {S>{dOZ  (d) None of these / BZ‘| go H$moB© Zht
                   Q.8. Which of the following method is used for binary subtraction:
                        {ZåZm§{H$V ‘| go H$m¡Z gr àUmbr ~m¶Zar g~ñQ´>¡³eZ hoVw Cn¶moJr h¡:
                        (a) 1's complement / 1's H$m°åßbr‘|Q   (b) 2's complement / 2's H$m°åßbr‘|Q
                        (c) 10's complement / 10's H$m°åßbr‘|Q  (d) None of these / BZ‘| go H$moB© Zht
                   Q.9. Karnaugh map simplification method is based on:

                        Karnaugh ‘¡n {gpåßb{’$Ho$eZ àUmbr {ZåZm§{H$V na AmYm[aV h¡…
                        (a) BCD code / BCD H$moS>              (b) Gray Code / J«o H$moS>
                        (c) ASCII code / ASCII H$moS>          (d) None of these / BZ‘| go H$moB© Zht
                  Q.10. Which of the following is not a Basic Gate:
                        {ZåZm§{H$V ‘| go H$m¡Zgm ~o{gH$ JoQ> Zht h¢:
                        (a) AND            (b) NOT             (c) XOR             (d) OR
                  Q.11. Which of the following is a universal gate:
                        {ZåZm§{H$V ‘| go H$m¡Zgm ¶y{Zdg©b JoQ> h¢:
                        (a) AND            (b) NAND            (c) XOR             (d) OR
                  Q.12. Which of the following is used to add two bits:
                        Xmo {~Q²>g Omo‹S>Zo hoVw {ZåZm§{H$V ‘| go {H$gH$m à¶moJ {H$¶m OmVm h¡…
                        (a) Binary Adder / ~m¶Zar ES>a         (b) Full Adder / ’w$b ES>a
                        (c) Half Adder  / hm’$ ES>a            (d) None of these / BZ‘| go H$moB© Zht
                  Q.13. Which of the following is used to add three bits:
                        VrZ {~Q²>g Omo‹S>Zo hoVw {ZåZm§{H$V ‘| go {H$gH$m à¶moJ {H$¶m OmVm h¡:
                        (a) Binary Adder / ~m¶Zar ES>a         (b) Full Adder / ’w$b ES>a

                        (c) Half Adder  / hm’$ ES>a            (d) None of these / BZ‘| go H$moB© Zht
   325   326   327   328   329   330   331   332   333   334   335