Steps uesd in quine mckluskey method, Computer Engineering

Assignment Help:

Q. Steps uesd in quine mckluskey method?

Step I:

Build a table in that every term of expression is represented in row (Expression must be in SOP form). Terms can be expressed in 0 (Complemented) or 1 (normal) form.

Step II:

Check all terms which differ in just one variable and then combine pairs by removing variable which differs in those terms. So a new table is formed. This process is repeated if necessary in new table also till all uncommon terms are left it implies that no matches left in table.

Step III:

a) Ultimately a two dimensional table is formed all terms that aren't removed in table form rows and all original terms form the column.

b) At every intersection of row and column where row term is subset of column term a 'X' is placed.

Step IV:

a) Put a square around every 'X' that is alone in column

b) Put a circle around every 'X' in any row that comprises a squared  'X'

c) If each column has a squared or circled 'X' then process is finished and respective minimal expression is formed by all row terms that have marked Xs.


Related Discussions:- Steps uesd in quine mckluskey method

What is indexed addressing, What is Indexed addressing The location of ...

What is Indexed addressing The location of data is calculated as sum of an address specified by one of previous methods, and value of an index register. This allows an array of

Legacy systems and current infrastructure, Legacy systems and current infra...

Legacy systems and current infrastructure - Information System This problem is most easily understood using the everyday example of the rail ways where the rail network infras

Which one memory requires refreshing, Which of following requires refreshin...

Which of following requires refreshing SRAM., DRAM., ROM. or EPROM. ? Ans. DRAM. requires refreshing.

The six various application of stack, The six several application of stack ...

The six several application of stack in computer application is: 1.  Conversion of infix to postfix notation and vice versa. 2.  Evaluation of arithmetic expression. 3.

What is exact and approximation algorithm, What is Exact and Approximation ...

What is Exact and Approximation algorithm? The principal decision to choose solving the problem exactly is called exact algorithm. The   principal decision to choose solving th

Handlers classification, Handler's Classification In 1977, Wolfgang Han...

Handler's Classification In 1977, Wolfgang Handler proposed an detailed notation for expressing the parallelism and pipelining of computers. Handler's classification addresses

Explain operation of time multiplexed space switching, With a neat diagram ...

With a neat diagram explain operation of time multiplexed space switching. Time division switches, an inlet or an outlet corresponded to a particular subscriber line with one s

What are the types of convergences, What are the types of convergences? ...

What are the types of convergences? Three different types of convergences are: a. The convergence of wireless and e-commerce technology b. The Convergence of E-Commerce a

Cascade delete options, Create a relationship among Employee and Sales tabl...

Create a relationship among Employee and Sales tables using Emp No. Enforce referential integrity and select both cascade update and cascade delete options. Save the relationship.

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