Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Define Minterm and the Maxterm - Canonical Form?
Any Boolean expression perhaps expressed in terms of either minterms or maxterms. The literal is a single variable within a term which may or may not be complemented. For an expression with the N variables, minterms and maxterms are defined as follows:
A minterm is the product of the N distinct literals where each literal occurs exactly once.
A maxterm is the sum of the N distinct literals where each literal occurs exactly once.
For the two-variable expression, the maxterms and minterms are as follows
X
Y
Minterm
Maxterm
0
X'.Y'
X+Y
1
X'.Y
X+Y'
X.Y'
X'+Y
X.Y
X'+Y'
For a three-variable expression, the maxterms and minterms are as follows
Z
Designation
Designtion
X'.Y'.Z'
m0
X+Y+Z
M0
X'.Y'.Z
m1
X+Y+Z'
M1
X'.Y.Z'
m2
X+Y'+Z
M2
X'.Y.Z
m3
X+Y'+Z'
M3
X.Y'.Z'
m4
X'+Y+Z
M4
X.Y'.Z
m5
X'+Y+Z'
M5
X.Y.Z'
m6
X'+Y'+Z
M6
X.Y.Z
m7
X'+Y'+Z'
M7
Consider a function F= x'y'z+xy'z'+xyz=m1+m4+m7
If we take the complement of F then F'= (x+y+z')(x'+y+z)(x'+y'+z')=M1.M4.M7
Any Boolean function can be expressed as a product of Maxterms and Sum of Minterms.
difference between lexical & semantic expansion
Let us review the operation of the stack within the 68HC11, the stack is a defined area of RAM which is last in first out register (LIFO) . Access to the stack is made via a stack
#what is the history of computer science
To calculate speed up performance various laws have been developed. These laws are discussed here. Amdahl's Law Remember, the speed up factor helps us in knowing the relat
Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level
The first digit of a decimal constant must be Decimal constants having of a set of digit, 0 to 9, preceded by an optional - or + sign.
Give a suitable algorithm of non-repudiation in designing e-cash based system. The algorithm of non-repudiation in designing e-cash based system is as illustrated below: Ke
Explain about the organisations use in EDI. Organisations, which are use Electronic Data Interchange. Extensive users of Electronic Data Interchange (EDI) include: BHS:
Error-correcting code memory (ECC memory) is a type of computer data storage that can notice and correct the more general kinds of internal data corruption. ECC memory is used in m
Q. Environment of the Packet Flow? Protocol stack used on Internet is referred to as TCP/IP protocol stack. If we were to follow the path that message "Hello computer 5.6.7.8!"
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd