Question Bank F.y.b.sc. Computer Science Paper-I Ug-Cs 101 - Fundamentals Of Computer & Computer Organization And Architecture Worksheet With Answers - North Maharashtra University Page 22
ADVERTISEMENT
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49211.Define AND Laws of Boolean algebra.
- A.1=A, A.0=0, A.A=A, A+A=0
212.Define Commutative Laws of Boolean algebra.
- A+B=B+A
A.B=B.A
213.Define NOT Laws of Boolean algebra
-
214.
Define Associative Laws of Boolean algebra.
-
A+(B+C)=(A+B)+C
A-(B-C)=(A-B)-C
215.
Define Distributive Laws of Boolean algebra.
-
A+BC=(A+B)(A+C)
A.(B+C)=A.B+A.C
216.
Define Absorption Laws of Boolean algebra.
-
A+AB=A
A(A+B)=A+B
A+AB=A+B
217.
Arithmetic rules for binary Addition
-
0+0=0,
0+1=1,
1+0=1,
1+1=0
218.
Arithmetic rules for binary Subtraction
-
0-0=0,
0-1=1,
1-0=0,
1-1=0
219.
What is 1’s complement?
220.
What is 2’s complement?
221.
Symbol of Half Adder?
222.
Symbol of Full Adder?
223.
……. Is the name of the logic circuit which can add two binary digits.
a. Buffer b.RAM c. Half Adder d. Full Addrer
224.
An AND gate :
a. is used to implement logic addition b. is same as parallel switching ckt.
c.
is same as serial switching ckt.
d. None
ADVERTISEMENT
0 votes
Related Articles
Related forms
Related Categories
Parent category: Education