Define minterm and the maxterm - canonical form, Computer Engineering

Assignment Help:

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

0

X'.Y'

X+Y

0

1

X'.Y

X+Y'

1

0

X.Y'

X'+Y

1

1

X.Y

X'+Y'

For a three-variable expression, the maxterms and minterms are as follows

X

Y

Z

Minterm

Designation

Maxterm

Designtion

0

0

0

X'.Y'.Z'

m0

X+Y+Z

M0

0

0

1

X'.Y'.Z

m1

X+Y+Z'

M1

0

1

0

X'.Y.Z'

m2

X+Y'+Z

M2

0

1

1

X'.Y.Z

m3

X+Y'+Z'

M3

1

0

0

X.Y'.Z'

m4

X'+Y+Z

M4

1

0

1

X.Y'.Z

m5

X'+Y+Z'

M5

1

1

0

X.Y.Z'

m6

X'+Y'+Z

M6

1

1

1

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.


Related Discussions:- Define minterm and the maxterm - canonical form

Explain SR latch using nor gates, Q. Explain SR Latch using NOR gates? ...

Q. Explain SR Latch using NOR gates? Let's inspect the latch more closely.   i. Suppose initially 1 is applied to S leaving R to 0 at this instance. The instant S=1 output o

Explain about behavioral notations, Explain about Behavioral Notations ...

Explain about Behavioral Notations These notations contain dynamic elements of the model.  Their elements comprise interaction and the state machine. It also comprise classe

Determine by which final selector is connected, The final selector is conne...

The final selector is connected to the (A) calling subscriber.                     (B) switching network. (C) called subscriber.                      (D) li

Write an algorithm to outline the macro-expansion, Write an algorithm to ou...

Write an algorithm to outline the macro-expansion using macro-expansion counter. The flow of control throughout macro expansion can be implemented by using a MEC that is macro-

Distinguish between e-mode and depletion mode mosfet, Distinguish between e...

Distinguish between enhancement mode and depletion mode metal oxide semiconductor field effect transistors giving their characteristics. Ans. Enhancement mode and depleti

Define program counter, Define Program Counter(PC) The Program Counter ...

Define Program Counter(PC) The Program Counter holds the address of the next instruction to be read from memory after the current instruction is implemented.

How many address bits are needed to show a 32 K memory, How many address bi...

How many address bits are required to represent a 32 K memory ? Ans. 32K = 25 x 210 = 215, Hence 15 address bits are needed; Only 16 bits can address this.

Explain the acceptance and request determination, Explain the Acceptance an...

Explain the Acceptance and Request Determination As we have learned, much of the overhead in client-server interaction occurs in the CSInteface, either client or server. It is

Give the example of first come first served scheduling, Consider  the  foll...

Consider  the  following set of jobs with  their  arrival  times,  execution  time  (in minutes), and deadlines. Job Ids Ar r ival Time E

Explain about parity bit, Q. Explain about Parity bit? Parity bit is an...

Q. Explain about Parity bit? Parity bit is an error detection bit added to binary data such that it creates total number of 1's in the data either odd or even. For illustration

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd