Multiple Choice Questions On Computer Arithmetic - Set 2

Following are the multiple choice questions on Computer Arithmetic based on the UGC-NET syllabus. Computer Arithmetic multiple choice questions.

1) Half adder is an example of ?

1. Combinational Circuits
2. Sequential Circuits
3. Asynchronous Circuits
4. None of these

Show/Hide Answer

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 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 ?

1. Conversion condition
2. Race around condition
3. Lock out state
4. None of these

Show/Hide Answer

Answer = B 
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. 

3) In a JK flip flop, if j=k, the resulting flip flop is referred to as ?

1. D flip flop
2. T flip flop
3. S-R flip flop
4. None of these

Show/Hide Answer

Answer = C 
Explanation: In JK flip flop if both the inputs are same then the flip flop behaves like SR flip flop.


4) Master slave flip flop is also referred to as ?

1. Level triggered flip flop
2. Pulse triggered flip flop
3. Edge triggered flip flop
4. None of these

Show/Hide Answer

Answer = B 
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.

5) Fetch and decode cycle is required in ?

1. Direct addressing
2. Immediate addressing
3. Indirect addressing
4. None of above

Show/Hide Answer

Answer = B 
Explanation:Fetch and decode cycle is required in Immediate addressing because it stores the operand directly on which the operation is performed.

6) Valid bit in each cache is associated with ?

1. Each memory byte in cache
2. Each memory word in cache
3. One bit with the all memory words
4. None of above

Show/Hide Answer

Answer = A 
Explanation:No explanation

7) In J-K flip flop the function K=J is used to realize ?

1. D flip flop
2. S-R flip flop
3. T flip flop
4. Master slave flip flop

Show/Hide Answer

Answer = D 
Explanation: T flip flop allows the same inputs. So if in JK flip flop J = K then it will work as T flip flop.
 

8) An encoder has 2ⁿ input lines and ..... output lines ?

1. 2
2. n
3. 2*n
4. n*n

Show/Hide Answer

Answer = B 
Explanation:No Explanation.

9) ASCII code for alphabet character requires ..... bits ?

1. 16
2. 15
3. 8
4. 7

Show/Hide Answer

Answer = D 
Explanation:No explanation

10) The basic limitation of FSM is that ?

1. An FSM can remember arbitrary large amount of information
2. An FSM sometimes recognize grammars that are not regular
3. It sometimes fails to recognize grammar that are regular
4. All of the above comments are true

Show/Hide Answer

Answer = A 
Explanation: FSM stands for Finite State Machine.

                                         BACK              NEXT

Tags : Multiple choice questions on Computer Arithmetic with answers and explanation, Multiple choice questions on Computer Arithmetic based on the UGC syllabus with answers, Objective type questions on Computer Arithmetic with answers, MCQ's on Computer Arithmetic, UGC-NET computer science preparation questions with answers, MCQ's for UGC-NET exam

Do You Like This? Please take 5 seconds to share with your firends.