1. | The output Y of a 2-bit comparator is logic 1 whenever the 2-bit input A is greater than the 2-bit input B. The number of combinations for which the output is logic 1, is ? | |
2. | A 1-bit full adder takes 20 ns to generate carry-out bit and 40 ns for the sum bit. What is the maximum rate of addition per second when four 1-bit full adders are cascaded ? | |
3. | Which one of the following statements correctly defines the full adder? An adder circuit ? | |
4. | Which one of the following statements is not correct ? | |
5. | For a binary half-subtractor having two inputs A and B, the correct set of logical expressions for the outputs D (= A minus B) and X (= borrow) are ? | |
6. | Which of the following circuits come under the class of sequential logic circuits? 1. Full adder 2. Full subtracter 3. Hall adder 4. J-K flip 5. Counter Select the correct answer from the codes given below: ? | |
7. | Two 2's complement numbers having sign bits 'x' and 'y' are added and the sign bit of the result is 'z'. Which Boolean function indicates the occurrence of the overflow ? | |
8. | The equivalent name for multiplexer is ? | |
9. | A multiplexer is a combinational logic circuit used to perform the operation ? | |
10. | How many input and output required for demultiplexer ? | |