Scribd
Upload
24 views

Assignment Computer

Uploaded by

Ch Ashan Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views

Assignment Computer

Uploaded by

Ch Ashan Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 292

Assignment

On

BOOLEAN ALGEBRA AND LOGIC CIRCUITS

Course Title [ introduction to computer]

Submitted To:

Prof: [ was]

Submitted By:

[MUHUMMAD JUNAID AHMED]

BSCS Semester: 1

BEST COLLEGE KHARIAN

Boolean algebra:
1
An algebra that deals with binary number system .George Boole (1815-1864) an English
mathematician developed it for:

 Simplify representation
 Manipulation of propositional logic

In 1938 Claude E. Shannon proposed using Boolean algebra in design of relay switching
circuits

 Provides economical and straightforward approach


 Used extensively in designing electronic circuits used in computer

Fundamental concepts of Boolean algebra

 Use of binary Digit


 Logical Addition
 Logical Multiplication
 Complementation

Use of Binary Digit:


Boolean equations can have either of two possible values 0 and 1

Logical Addition:
Symbol ‘+’, also known as ‘OR’ operator used for logical addition

Logical multiplication:
Symbol ‘.’, also known as ‘AND’ operator, used for logical multiplication

Complementation:
Symbol ‘-’ also known as ‘NOT’ operator used for complementation

Operator Precedence

 Each operator has a precedence level


 Higher the operator’s precedence level, earlier it is evaluated
 Expression is scanned from left to right
 First, expressions enclosed with in parentheses are evaluated
 Then, all complement (Not) operation are performed
 Then, all ‘.’ (AND) operations are performed
 Finally, all ‘+’(OR) operation are performed

2
Boolean algebra laws:

 Commutative law
 Associative Law
 Distributive law
 Annulment Law
 Identity Law
 Idempotent Law
 Complement law

 Commutative Law:
It states that the interchanging of the order of operands in a Boolean equation does not
change result

FOR EXAMPLE:
OR operator A+B= B+A

AND operator A*B=B*A

 Associative Law:
It states that the AND operation are done on two or more than two variables

FOR EXAMPLE:
A*(B*C) = (A*B)*C

 Distributive law:
It states that the multiplication of two variables and adding result with a variable will
result in the same values as multiplication of addition of the variables

FOR EXAMPLE:

A+BC= (A+B) (A+C)

 Annulment law:
A.0=0

A+1=1

 Identity Law:

3
A.1=A

A+0=A

 Idempotent law:
A+A=A

A.A=A

 Boolean Function:
A Boolean function is an expression formed with:

Binary variables

Operators (OR, AND, and Not)

Parentheses and equal sign

The value of a Boolean function can be either 0 or 1

A Boolean function may be represented as:

An algebraic expression, or

A truth table

X Y Z W

0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

 The number of rows in the table is equal to 2n where n is the number of literals
in the function
 The combination of 0s and 1s for rows of this tables are obtained from the
binary

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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292

You might also like