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 programming paradigm, a. Explain the Programming Paradigm? Discuss ...

a. Explain the Programming Paradigm? Discuss four major programming paradigms. b. State the three basic logic operators available in C++? Write a small program in C++ that uses

Define the method of implementation, Define the method of Implementation ...

Define the method of Implementation Once "final" system has been designed it is then essential to put together the software and hardware and introduce the new system. There ar

Performance and issues in pipelining-throughput, Performance and Issues in ...

Performance and Issues in Pipelining Throughput:  Throughput of a pipeline can be defined as the number of results that have been getting per unit time. It can be denoted as:

What is byte addressable memory, What is byte addressable memory? The a...

What is byte addressable memory? The assignment of successive addresses to successive byte locations in the memory is known as byte addressable memory.

Conversion of decimal number 25.5 into binary number, Conversion of decimal...

Conversion of decimal number 25.5 into binary number Ans. There is integer part is 25 and fractional part is 0.5.  Firstly convert the integer part 25 in its equal to binary numb

Describe miscellaneous and privileged instructions, Q. Describe Miscellaneo...

Q. Describe Miscellaneous and Privileged Instructions? These instructions don't fit in any of above categories. I/O instructions: start I/O, stop I/O, and test I/O. Characteris

Functions in first-order logic sentences, Functions in first-order logic se...

Functions in first-order logic sentences - artificial intelligence: Functions may be thought of as special predicates, where we think of all but 1 of the arguments as input and

Differences between inter statement and intra statement, Differences betwee...

Differences between inter statement and intra statement delay? //define register variables reg a, b, c; //intra assignment delays initial begin a = 0; c = 0;

Disadvantages of address translation, Disadvantages of Address translation:...

Disadvantages of Address translation: Disadvantages are following: A program that is too large to be held in a part needs some special design, that called overlay

Explain the architectural framework for electronic commerce, Explain the Ar...

Explain the Architectural framework for electronic commerce. An application independent framework to categorize service interaction relies on four basic dimensions   1.  Ser

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