A
B
C
D
Text Solution
Verified by Experts
The correct Answer is:
|
MOTION-LOGIC GATES-EXERCISE - 1
- Which of the following Boolean expression is not correct :-
07:17
|
- In Boolean algebra, which of the following is not equal to zero :-
01:26
|
- Digital circuit can be made by repetitive use of
02:11
|
- Which of the following relation is valid in Boolean algebra :-
02:13
|
- Which of the following relations is valid for Boolean algebra :-
01:52
|
- What would be the output of the circuit whose Boolean expression Y = A...
01:16
|
- Which of the following relations is valid for Boolean algebra :-
01:52
|
- The output of the given logic gate is 1 when inputs A,B and C are such...
01:26
|
- The truth table given below is for :- {:(A,B,Y),(0,0,1),(0,1,0),(1,0...
01:48
|
- The arrangement shown in figure performs the logic function of a/an….g...
01:30
|
- The output of gate is low when at least one of its input is high. This...
03:04
|
- A two inputed XOR gate produces an output high only when its both inpu...
01:05
|
- You are given two circuits as shown in following figure. The logic ope...
02:36
|
- In Boolean algebra A + B = Y implies that :
01:59
|
- Given below are four logic tage symboles. Those for OR, NOR and NAND a...
01:40
|
- The truth table shown below is for which of the following gates :- {...
02:36
|
- When all the inputs of a NAND gate are connected together, the resulti...
01:27
|
- Which of the following pairs are universal gates
01:15
|
- A NAND gate followed by a NOT gate is :-
01:49
|
- The NOR gate is logically equivalent to an OR gate followed by :-
01:44
|