| 1 |
The circuit that is used for parallel to serial conversion is |
decoder
encoder
multiplexer
demultiplexer
|
| 2 |
The 'Boolean Algebra' is based on the premise that |
there are two states
differential equations can be solved by analog circuits.
either a statement is true or false
arithmetic operations can be carried out
|
| 3 |
In Boolean algebra A.0 is |
0
1
A+0
A+1
|
| 4 |
In Boolean algebra A.A.A.A.A |
5A
A
A<sup>5</sup>
1
|
| 5 |
According to Boolean algebra A+A+......+A is |
A
n A
0
1
|
| 6 |
According to absorption law x. (x+y) = |
x
y
1+x
1+y
|
| 7 |
According to aborption law x+x.y= |
x
y
1 + x
1 + y
|
| 8 |
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.
|
| 9 |
|
x . y
<u>x + y</u>
<u>x</u> . <u>y</u>
x . y
|
| 10 |
|
x + y
|
| 11 |
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
|
| 12 |
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
|
| 13 |
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
|
| 14 |
|
<u>A + B</u> +<u> C + D</u>
<u>A</u> + <u>B</u> C<u> + D</u>
|
| 15 |
|
<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
|
| 16 |
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
|
| 17 |
Odd parity of a word can be conveniently tested by. |
OR gate
XOR gate
NOR gate
NAND gate
|
| 18 |
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
|
| 19 |
An OR gate has 6 input. The number of input words in its truth table are. |
6
32
64
128
|
| 20 |
Which of the following function is referred as the complementary.? |
OR function
NOT function
NAND function
AND function
|
| 21 |
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
|
| 22 |
The logic device that perform Boolean multiplication is. |
AND gate
OR gate
Inverter
None of these
|
| 23 |
Which of the following gate is two level logic gate. |
OR gate
AND gate
EXCLUSIVE OR gate
NAND gate
|
| 24 |
The output will be one in case any input is one in the case of. |
OR gate
AND gate
NAND gate
NOT gate
|
| 25 |
Logical multiplication refers to operation of. |
OR gate
AND gate
NOT gate
inverter gater
|
| 26 |
Logical addition refers to operation of |
OR gate
AND gate
NOT gate
invertr gate
|
| 27 |
Which of the following operations are used by Boolean algebra.? |
Boolean addition
Boolean multiplication
Boolean complementation
All of the above
|
| 28 |
Boolean algebra use which of the following to represent arithmetic quantities. |
decimal digits
exponents
binary bits
fractions
|
| 29 |
Boolean algebra is also known as. |
logical algebra
control algebra
switching algebra
programming algebra
|
| 30 |
Boolean algebra is. |
used for arithmetical operation is ALU
an aid for binary conversion
useful for error detection and error correction
used to describe the behavior and structure of logic networks and as an aid in the design of logic system
|
.gif)
Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
