![Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one. - ppt download Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one. - ppt download](https://images.slideplayer.com/24/7519524/slides/slide_5.jpg)
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one. - ppt download
![X=X1X0 and Y=Y1Y0 are 2 bit binary numbers. The Boolean function S that satisfies the condition, if X > Y then S=1, in its minimized form is X=X1X0 and Y=Y1Y0 are 2 bit binary numbers. The Boolean function S that satisfies the condition, if X > Y then S=1, in its minimized form is](https://df0b18phdhzpx.cloudfront.net/ckeditor_assets/pictures/1242269/original_2.19_s1.png)
X=X1X0 and Y=Y1Y0 are 2 bit binary numbers. The Boolean function S that satisfies the condition, if X > Y then S=1, in its minimized form is
![Bits and Bytes Topics Representing information as bits Bit-level manipulations Boolean algebra Expressing in C. - ppt download Bits and Bytes Topics Representing information as bits Bit-level manipulations Boolean algebra Expressing in C. - ppt download](https://images.slideplayer.com/25/7863806/slides/slide_3.jpg)
Bits and Bytes Topics Representing information as bits Bit-level manipulations Boolean algebra Expressing in C. - ppt download
![The K-map table and corresponding Boolean expression for the output bit... | Download Scientific Diagram The K-map table and corresponding Boolean expression for the output bit... | Download Scientific Diagram](https://www.researchgate.net/profile/Ajay-Kumar-349/publication/269420764/figure/fig3/AS:613907618095121@1523378390398/The-K-map-table-and-corresponding-Boolean-expression-for-the-output-bit-a-g-0-b-g-1-c_Q640.jpg)