Karnaugh Map (K- map) /rules/2 variable K map problems with solution
Karnaugh map is a method used for reducing the boolean expression.
K map is a graphical method used to obtain the simplified expression.
The size of K-map depends on the number of variables used.
Depending upon the number of input variables, it can have 4 cells, 8 cells, 16 cells or 32 cells.
Normally K-map is preferred for less than 5 variables.
Min terms refers to the product of the input variables.
Max term refers to the sum of input variables
CH6:logic gates
• Logic gates-AND/OR/NOT/ universal gat...
Ch7:Boolean algebra
• Boolean algebra/Boolean laws/De Morga...
Ch 8:Realization of gates using NAND and NOR logic
• Realization of gates using universal ...
Ch 9: Complement of a Boolean expression
• How to find the complement of a boole...
Ch 10: Min term and Max term : Sum of min terms and Product of Max terms
• How to find the complement of a boole...
Ch1: Introduction to number system
• Number system in digital electronics-...
Ch2: Decimal to binary conversion
• Decimal to binary number conversion. ...
Ch3: Decimal to Octal conversion
• Decimal to octal number conversion. H...
Ch4: Decimal to Hexa decimal conversion
• Decimal to hexa decimal number conver...
Ch5: Binary to any conversion system
• Binary to decimal/Octal/Hexadecimal c...
...................................................................................................................................................
SUBSCRIBE
/ @readelectricvehicle6078 sub_confirmation=1
CONTACT US
In case of any query, please do
email : [email protected].
Blog: https://readelectricvehicle.wordpress...
TWITTER : / readevehicle
----------------------------------------------------------------------------------------------------------------
#minterm , #digitalelectronics, #booleanexpression , #readelectricvehicle