{"id":197,"date":"2020-04-05T07:08:37","date_gmt":"2020-04-05T07:08:37","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=197"},"modified":"2020-04-05T07:08:37","modified_gmt":"2020-04-05T07:08:37","slug":"computer-orgenization-mcq-11","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=197","title":{"rendered":"Computer orgenization MCQ -11"},"content":{"rendered":"

1) Half adder is an example of ?<\/strong>
a.\u00a0\u00a0\u00a0 Combinational Circuits
b.\u00a0\u00a0\u00a0 Sequential Circuits
c.\u00a0\u00a0\u00a0 Asynchronous Circuits
d.\u00a0\u00a0\u00a0 None of these
\u00a0
Answer = A<\/strong>
Explanation: Combinational circuits are the circuits whose output depends on the inputs of the same instant of time.<\/p>\n

2) In JK flip flop same input, i.e at a particular time or during a clock pulse, the output will oscillate back and forth between 0 and 1. At the end of the clock pulse the value of output Q is uncertain. The situation is referred to as ?<\/strong>
a.\u00a0\u00a0 \u00a0Conversion condition
b.\u00a0\u00a0 \u00a0Race around condition
c.\u00a0\u00a0 \u00a0Lock out state
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = B<\/strong>
Explanation:A race around condition is a flaw in an electronic system or process whereby the output and result of the process is unexpectedly dependent on the sequence or timing of other events.<\/p>\n

3) In a JK flip flop, if j=k, the resulting flip flop is referred to as ?<\/strong>
a.\u00a0\u00a0 \u00a0D flip flop
b.\u00a0\u00a0 \u00a0T flip flop
c.\u00a0\u00a0 \u00a0S-R flip flop
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = C<\/strong>
Explanation: In JK flip flop if both the inputs are same then the flip flop behaves like SR flip flop.<\/p>\n

4) Master slave flip flop is also referred to as ?<\/strong>
a.\u00a0\u00a0 \u00a0Level triggered flip flop
b.\u00a0\u00a0 \u00a0Pulse triggered flip flop
c.\u00a0\u00a0 \u00a0Edge triggered flip flop
d.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = B<\/strong>
Explanation:The term pulse triggered means the data is entered on the rising edge of the clock pulse, but the output does not reflect the change until the falling edge of clock pulse.<\/p>\n

5) Fetch and decode cycle is required in ?<\/strong>
a.\u00a0\u00a0 \u00a0Direct addressing
b.\u00a0\u00a0 \u00a0Immediate addressing
c.\u00a0\u00a0 \u00a0Indirect addressing
d.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = B<\/strong>
Explanation:Fetch and decode cycle is required in Immediate addressing because it stores the operand directly on which the operation is performed.<\/p>\n

6) Valid bit in each cache is associated with ?<\/strong>
a.\u00a0\u00a0 \u00a0Each memory byte in cache
b.\u00a0\u00a0 \u00a0Each memory word in cache
c.\u00a0\u00a0 \u00a0One bit with the all memory words
d.\u00a0\u00a0 \u00a0None of above<\/p>\n

Answer = D<\/strong>
\u00a0
7) In J-K flip flop the function K=J is used to realize ?<\/strong>
a.\u00a0\u00a0 \u00a0D flip flop
b.\u00a0\u00a0 \u00a0S-R flip flop
c.\u00a0\u00a0 \u00a0T flip flop
d.\u00a0\u00a0 \u00a0Master slave flip flop
\u00a0
Answer = D<\/strong>
Explanation: T flip flop allows the same inputs. So if in JK flip flop J = K then it will work as T flip flop.
\u00a0
8) An encoder has 2n input lines and ….. output lines ?<\/strong>
a.\u00a0\u00a0 \u00a02
b.\u00a0\u00a0 \u00a0n
c.\u00a0\u00a0 \u00a02*n
d.\u00a0\u00a0 \u00a0n*n
\u00a0
Answer = B<\/p>\n

9) ASCII code for alphabet character requires ….. bits ?<\/strong>
a.\u00a0\u00a0 \u00a016
b.\u00a0\u00a0 \u00a015
c.\u00a0\u00a0 \u00a08
d.\u00a0\u00a0 \u00a07<\/p>\n

Answer = D<\/strong>
\u00a0
10) The basic limitation of FSM is that ?<\/strong>
a.\u00a0\u00a0 \u00a0An FSM can remember arbitrary large amount of information
b.\u00a0\u00a0 \u00a0An FSM sometimes recognize grammars that are not regular
c.\u00a0\u00a0 \u00a0It sometimes fails to recognize grammar that are regular
d.\u00a0\u00a0 \u00a0All of the above comments are true
\u00a0
Answer = A<\/strong>
Explanation: FSM stands for Finite State Machine.<\/p>\n

11) What is the hexadecimal equivalent of a binary number 10101111 ?<\/strong>
a.\u00a0\u00a0 \u00a0AF
b.\u00a0\u00a0 \u00a09E
c.\u00a0\u00a0 \u00a08C
d.\u00a0\u00a0 \u00a0All of above
e.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = A
\u00a0
12) A NOR gate recognizes only the input word whose bits are ?<\/strong>
a.\u00a0\u00a0 \u00a00’s and 1’s
b.\u00a0\u00a0 \u00a01’s
c.\u00a0\u00a0 \u00a00’s
d.\u00a0\u00a0 \u00a00’s or 1’s
e.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = C
\u00a0 \u00a0
13) The operation which is commutative but not associative is ?<\/strong>
a.\u00a0\u00a0 \u00a0AND
b.\u00a0\u00a0 \u00a0OR
c.\u00a0\u00a0 \u00a0EX-OR
d.\u00a0\u00a0 \u00a0NAND
\u00a0
Answer = D
\u00a0 \u00a0
14) All digital circuits can be realized using only ?<\/strong>
a.\u00a0\u00a0 \u00a0EX-OR gates
b.\u00a0\u00a0 \u00a0Half adders
c.\u00a0\u00a0 \u00a0Multiplexers
d.\u00a0\u00a0 \u00a0OR gates
\u00a0
Answer = B
\u00a0 \u00a0
15) The XOR gates are ideal for testing parity because even parity words produces a …… output and odd parity word produces a ……. output ?<\/strong>
a.\u00a0\u00a0 \u00a0low, high
b.\u00a0\u00a0 \u00a0high, low
c.\u00a0\u00a0 \u00a0odd, even
d.\u00a0\u00a0 \u00a0even, odd
e.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = A<\/p>\n

16) Flip flop output is always\u00a0 ?<\/strong>
a.\u00a0\u00a0 \u00a0Complementary
b.\u00a0\u00a0 \u00a0Independent of each other
c.\u00a0\u00a0 \u00a0the same
d.\u00a0\u00a0 \u00a0same as inputs
e.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = A
\u00a0 \u00a0
17) A half adder adds ….. bits ?<\/strong>
a.\u00a0\u00a0 \u00a016
b.\u00a0\u00a0 \u00a010
c.\u00a0\u00a0 \u00a08
d.\u00a0\u00a0 \u00a02
e.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = D
\u00a0
18) How many flip – flop circuits are needed to divide by 16 ?<\/strong>
a.\u00a0\u00a0 \u00a0Two
b.\u00a0\u00a0 \u00a0Four
c.\u00a0\u00a0 \u00a0Eight
d.\u00a0\u00a0 \u00a0Sixteen
\u00a0
Answer = C
\u00a0 \u00a0
19) A flip flop is a ….. elements that stores a 216 binary digits as a low or high voltage ?<\/strong>
a.\u00a0\u00a0 \u00a0chip
b.\u00a0\u00a0 \u00a0bus
c.\u00a0\u00a0 \u00a0I\/O
d.\u00a0\u00a0 \u00a0memory
e.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = D
\u00a0 \u00a0
20) A positive AND gate is also a negative ?<\/strong>
a.\u00a0\u00a0 \u00a0NAND gate
b.\u00a0\u00a0 \u00a0AND gate
c.\u00a0\u00a0 \u00a0NOR gate
d.\u00a0\u00a0 \u00a0OR gate
e.\u00a0\u00a0 \u00a0None of these
\u00a0
Answer = D
\u00a0 \u00a0
21)\u00a0 Which of the following is a minimum error code ?<\/strong>
a.\u00a0\u00a0 \u00a0Octal code
b.\u00a0\u00a0 \u00a0Binary code
c.\u00a0\u00a0 \u00a0Gray code
d.\u00a0\u00a0 \u00a0Excess-3 code
\u00a0
Answer = C
\u00a0 \u00a0
22) In a positive edge triggered JK flip flop, a low J and low K produces ?<\/strong>
a.\u00a0\u00a0 \u00a0High state
b.\u00a0\u00a0 \u00a0Low state
c.\u00a0\u00a0 \u00a0toggle state
d.\u00a0\u00a0 \u00a0no change
\u00a0
Answer = D<\/strong>
Explanation:\u00a0 In JK Flip Flop if J = K = 0 then it holds its current state. There will be no change.<\/p>\n

23)\u00a0 Negative numbers can’t be represented in ?<\/strong>
a.\u00a0\u00a0 \u00a0signed magnitude form
b.\u00a0\u00a0 \u00a01’s complement form
c.\u00a0\u00a0 \u00a02’s complement form
d.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = D
\u00a0 \u00a0
24) Which of the following architecture is not suitable for realising SIMD ?<\/strong>
a.\u00a0\u00a0 \u00a0Vector processor
b.\u00a0\u00a0 \u00a0Array processor
c.\u00a0\u00a0 \u00a0Von Neumann
d.\u00a0\u00a0 \u00a0All of above
\u00a0
Answer = C
\u00a0 \u00a0
25) The XOR operator + is ?<\/strong>
a.\u00a0\u00a0 \u00a0commutative
b.\u00a0\u00a0 \u00a0associative
c.\u00a0\u00a0 \u00a0distributive over AND operator
d.\u00a0\u00a0 \u00a0A and B
\u00a0
Answer = D<\/strong>
Explanation: As\u00a0 A + B = B + A\u00a0 and\u00a0 A + ( B + C) = (A + B ) + C
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Hence it is commutative and associative.<\/p>\n

26)\u00a0 The binary equivalent of the Gray code 11100 is….. ?<\/strong>
a.\u00a0\u00a0 \u00a010111
b.\u00a0\u00a0 \u00a000111
c.\u00a0\u00a0 \u00a001011
d.\u00a0\u00a0 \u00a010101
\u00a0
Answer = A<\/strong>
Explanation: The rule for changing the Gray code to binary is that first bit remains the same and the next bit is obtained by adding the first LSB of binary to the second LSB of Gray code and so on… So the answer of the question is 10111.<\/p>\n

27) An assembler that runs on one machine but produces machine code for another machine is called ?<\/strong>
a.\u00a0\u00a0 \u00a0simulator
b.\u00a0\u00a0 \u00a0emulator
c.\u00a0\u00a0 \u00a0cross assembler
d.\u00a0\u00a0 \u00a0boot strap loader
\u00a0
Answer = C<\/strong>
Explanation:\u00a0 Cross assembler is an assembler which runs on one type of processor and produces machine code for another.<\/p>\n

28) Which of the following unit can be used to measure the speed of a computer ?<\/strong>
a.\u00a0\u00a0 \u00a0SYPS
b.\u00a0\u00a0 \u00a0MIPS
c.\u00a0\u00a0 \u00a0BAUD
d.\u00a0\u00a0 \u00a0FLOPS
e.\u00a0\u00a0 \u00a0B and D
\u00a0
Answer = E<\/strong>
Explanation:\u00a0 MIPS measures the execution speed of computers CPU but not the whole system. FLOPS is a measure of computer’s performance especially in the field of scientific calculations that makes heavy use of floating point calculations.<\/p>\n

29)\u00a0 Which of the following logic families is well suited for high speed operations?<\/strong>
a.\u00a0\u00a0 \u00a0TTL
b.\u00a0\u00a0 \u00a0ECL
c.\u00a0\u00a0 \u00a0MOS
d.\u00a0\u00a0 \u00a0CMOS
\u00a0
Answer = B<\/strong>
Explanation: ECL is used for high speed applications because of its price and power demands.<\/p>\n

30) Which of the following comments about half adder are true?<\/strong>
a.\u00a0\u00a0 \u00a0It adds 2 bits
b.\u00a0\u00a0 \u00a0It is called so because a full adder involves two half adders
c.\u00a0\u00a0 \u00a0It does half the work of full adder
d.\u00a0\u00a0 \u00a0It needs two inputs and generates two outputs
e.\u00a0\u00a0 \u00a0 A, B and D
\u00a0
Answer = E<\/strong>
Explanation:\u00a0 No Explanation<\/p>\n

31) The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to guarantee that three cards are from some same suit is ?<\/strong>
a.\u00a0\u00a0 \u00a08
b.\u00a0\u00a0 \u00a03
c.\u00a0\u00a0 \u00a09
d.\u00a0\u00a0 \u00a012
\u00a0
Answer = C<\/p>\n

32) Context free languages are closed under ?<\/strong>
a.\u00a0\u00a0 \u00a0union, intersection
b.\u00a0\u00a0 \u00a0Intersection , complement
c.\u00a0\u00a0 \u00a0union , kleene star
d.\u00a0\u00a0 \u00a0Complement , kleene star
\u00a0
Answer = C<\/p>\n

33) Let R be a symmetric and transitive relation on a set A. Then ?<\/strong>
a.\u00a0\u00a0 \u00a0R is reflexive and hence a partial order
b.\u00a0\u00a0 \u00a0R is reflexive and hence an equivalence relation
c.\u00a0\u00a0 \u00a0R is not reflexive and hence not an equivalence relation
d.\u00a0\u00a0 \u00a0None of above
\u00a0
Answer = D<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"

1) Half adder is an example of ? a.\u00a0\u00a0\u00a0 Combinational Circuits b.\u00a0\u00a0\u00a0 Sequential Circuits c.\u00a0\u00a0\u00a0 Asynchronous Circuits d.\u00a0\u00a0\u00a0 None of these \u00a0 Answer = A Explanation: Combinational circuits are the circuits whose output depends on the inputs of the same instant of time. 2) In JK flip flop same input, i.e at a particular time…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[18],"tags":[],"class_list":["post-197","post","type-post","status-publish","format-standard","hentry","category-computer-architecture-and-organization"],"_links":{"self":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/197","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=197"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/197\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=197"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=197"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=197"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}