Rules for minimisation using k maps, Computer Engineering

1) All squares containing a 1 must be grouped.

2) The largest possible groups must be formed.

3) Groups can overlap if this allows larger groups to be formed.

4) Groups must be square or rectangular and contain 2n squares.

5) The smallest number of groups must be formed. 

Posted Date: 8/27/2012 2:36:01 AM | Location : United States

Related Discussions:- Rules for minimisation using k maps, Assignment Help, Ask Question on Rules for minimisation using k maps, Get Answer, Expert's Help, Rules for minimisation using k maps Discussions

Write discussion on Rules for minimisation using k maps
Your posts are moderated
Related Questions
Flynn's Classification Flynn's classification is based on multiplicity of data streams and instruction streams observed by the CPU during program execution. Let Ds and Is  are

At the bottom of the toolbar there is a box with two lesser boxes and an arrow. The uppermost box displays the present foreground color; the lowermost box shows the present backgro

Why a linked list is called a dynamic data structure? What are the advantages of using linked list over arrays?    A linked list is known as a dynamic data structure because it

Continuous or Discrete - artificial intelligence: The behaviour of the coming data in from the environment will change how the agent should be programming. In particular, the

Q. Convention used to represent micro-operations? The convention used to represent micro-operations is: 1.  Computer register names are designated by capital letters (someti

What are the disadvantages of a Smart Card? Disadvantages of Smart Cards are as follows: a. The value of money can be depleted and recharged. b. Customers should keep

With relevant logic diagram and truth table explain the working of a two input EX-OR gate. Ans. 2-Input EX-OR Gate: An EX-OR or Exclusive gate recognizes words that have an od

What is the state of the register in Figure  after every clock pulse if it begins in the 101001111000 state?

What is the means of communications between R/3 and external applications? The means of communication among R/2,R/3 and external applications is by the CPI-C handler or SAP Gat

Q. Drawback of indirect addressing? • Drawback of this scheme is that it needs two memory references to fetch actual operand. First memory reference is to fetch the actual addr