Definition

Karnaugh map (K-map)

Part of the Programming glossary:

A Karnaugh map (K-map) is a pictorial method used to minimize Boolean expressions without having to use Boolean algebra theorems and equation manipulations. A K-map can be thought of as a special version of a truth table .

Using a K-map, expressions with two to four variables are easily minimized. Expressions with five to six variables are more difficult but achievable, and expressions with seven or more variables are extremely difficult (if not impossible) to minimize using a K-map.

This was last updated in March 2011
Posted by: Margaret Rouse

Related Terms

Definitions

  • NetBeans

    - NetBeans is a Java-based integrated development environment (IDE). The term also refers to the IDE’s underlying application platform framework.  (SearchSOA.com)

  • scraper site

    - A scraper site is a website that features content stolen from other sites and presented as original. Scraper sites copy valuable content from legitimate websites and republish it on their own sites. (WhatIs.com)

  • site scraper

    - A site scraper is a type of software used to copy content from a website. Site scrapers work similarly to web crawlers, which essentially perform the same function for the purposes of indexing web... (WhatIs.com)

Glossaries

  • Programming

    - Terms related to software programming, including definitions about programming languages and words and phrases about software design, coding, testing and debugging.

  • Internet applications

    - This WhatIs.com glossary contains terms related to Internet applications, including definitions about Software as a Service (SaaS) delivery models and words and phrases about web sites, e-commerce ...

Ask a Question About Karnaugh map (K-map)Powered by ITKnowledgeExchange.com

Get answers from your peers on your most technical challenges

Tech TalkComment

Share
Comments

    Results

    Contribute to the conversation

    All fields are required. Comments will appear at the bottom of the article.