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
Explain the TEST instruction TEST instruction performs the AND operation. The difference is that AND instruction changes the destination operand whereas TEST instruction doesn

What is the difference between Commit-work and Rollback-Work tasks? Commit-Work statement "performs" many functions relevant to synchronized execution of tasks.  Rollback-work

Explain briefly Loop-invariant code motion of the commonly used code optimization techniques. Loop-invariant code motion If a quantity is calculated inside a loop duri


What is partition? Partitions divide a system into several independent or weakly coupled subsystems, each giving one kind of service. Partitions use peer-peer subsystems.

Q. Illustration to demonstrate design of sequential circuits? Let us take an illustration to demonstrate above process. Suppose we want to design 2-bit binary counter employing

Can we define our own Match Code ID's for SAP Matchcodes? Yes, the number 0 to 9 are reserved for us to make our own Match Code Ids for a SAP described Matchcode object.

Create a class called  performance that records the information of a performance. The class should include at least five data items:  id,  title,  basePrice, startDate, endDate. Yo

Q. Define COM Programs? A COM (Command) program is binary image of a machine language program. It is loaded in memory at the lowest available segment address. Program code star