| 1 |
According to aborption law x+x.y= |
x
y
1 + x
1 + y
|
| 2 |
The commutative law in Boolean Algebra, where a, b and c are binary number is. |
a+0=a
a+1=1
a+b=b+a
a. (b+c) = a.b +a.c.
|
| 3 |
|
x . y
<u>x + y</u>
<u>x</u> . <u>y</u>
x . y
|
| 4 |
|
x + y
|
| 5 |
If A and B are two 1-bit numbers, what logic gates will be required to test for A=B? |
NOR gate
EXCLUSIVE OR gate
EXCLUSIVE NOT gate
OR gate
|
| 6 |
Boolean expression for NOR gate with two inputs x and y can be written as. |
<u>x</u> + y__
x. y
<u>x + </u>y
|
| 7 |
Boolean description for the exclusive OR gate for two inputs x and y can be written as. |
x<u> +</u> y __
_x _y
x.<u> y </u>+<u> x</u>. y
x . y + x .y
|
| 8 |
|
<u>A + B</u> +<u> C + D</u>
<u>A</u> + <u>B</u> C<u> + D</u>
|
| 9 |
|
<u>A</u> +<u> B</u> +<u> C</u> + D
<u>A</u> <u>B</u><u>C</u> <u>D</u>
A + B + C + D
|
| 10 |
NAND gates are preferred over others because these. |
have lower fabrication area
can be used to make any gate
consume least elctronic power
provide maximum density in a chip
|
| 11 |
Odd parity of a word can be conveniently tested by. |
OR gate
XOR gate
NOR gate
NAND gate
|
| 12 |
An AND gate will function as OR if. |
all the inputs to the gates are "I"
all the inputs are "O"
a Not gate is added to it
all the inputs and outputs are complemented
|
| 13 |
An OR gate has 6 input. The number of input words in its truth table are. |
6
32
64
128
|
| 14 |
Which of the following function is referred as the complementary.? |
OR function
NOT function
NAND function
AND function
|
| 15 |
Which of the following statement is true in the case of AND gate with input A and B. |
If A and B are applied, there will not be any output
If neither input is applied, there will be an output
If one input is applied there will not be any output
If one input is applied there will be an output
|
.gif)
Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
