Explain about karnaugh maps, Computer Engineering

Assignment Help:

Q. Explain about Karnaugh Maps?

Karnaugh maps are a suitable way of expressing and simplifying Boolean function of 2 to 6 variables. The stepwise process for Karnaugh map is.

Steps

Create a simple map relying on number of variables in function. Figure (a) below shows map of two, three as well as four variables. A map of 2 variables comprises 4 value position or elements whereas for 3 variables it has 23 = 8 elements. In the same way for 4 variables it's 24 =16 elements and so on. Special care is taken to express variables in map. Value of only one variable changes in two neighbouring columns or rows. The benefit of having change in one variable is that 2 adjacent columns or rows signify a true or complement form of a single variable. 

For illustration in figure (a) below the columns which have positive A are adjacent and so are the columns for A¯. Please note adjacency of corners. Right most columns can be considered to be adjacent to first column because they are different just by one variable and are adjacent. In the same way top most and bottom most rows are adjacent.

1387_Explain about Karnaugh Maps.png

Figure: Maps and their adjacencies

Please note:

1) Decimal equivalents of column are given for help in understanding where position of respective set lies. It isn't value filled in square. A square can comprise one or nothing.  

2) The 00, 01, 11 etc. which are written on top implies value of respective variables. 

3) Wherever value of a variable is 0 it is said to express its compliment form.

4) Value of only one variable changes when we move from one row to next row or one column to next column.


Related Discussions:- Explain about karnaugh maps

What is a multitape tm, What is a multitape TM?  A  multi-tape  Turing ...

What is a multitape TM?  A  multi-tape  Turing  machine  having  of  a  finite  control  with  k-tape  heads  and k-tapes each tape is infinite in both directions. On a one mov

Explain deadlock detection algorithm for single instance, Explain deadlock ...

Explain deadlock detection algorithm for single instance of each resource type. For single instance of each resource type the deadlock detection algorithm: (i) Maintain a wa

Authorization bypass, Authorization Bypass is a frighteningly easy process ...

Authorization Bypass is a frighteningly easy process which can be employed with poorly designed applications or content management frameworks. You know how it is... you run a small

Can link and association applied interchangeably, No, You cannot apply the ...

No, You cannot apply the link and Association interchangeably. Since link is used show the relationship among the two objects. But Association is used signify the relationship

What is the linkage section, The linkage section is part of a known as prog...

The linkage section is part of a known as program that 'links' or maps to data items in the calling program are working storage. It is the part of the called program where these sh

How to build the structure chart, Building the Structure Chart - Proces...

Building the Structure Chart - Processes in the DFD tend to show single module on the structure chart Afferent processes - give inputs to system Central processes -

Search mechanisms in prolog - artificial intelligence, Search mechanisms in...

Search mechanisms in Prolog We can utilize this simple Prolog program to describe how Prolog searches: president(X) :- first_name(X, georgedubya), second_name(X, bush). p

State the term- interviewing, State the term- Interviewing This involv...

State the term- Interviewing This involves a one to one question & answer session between analyst and customer/employee. A good method if analyst wants to probe deeply into on

Illustration of instruction format, Let's provide you a fundamental illustr...

Let's provide you a fundamental illustration by which you may be able to define the concept of instruction format.  Let us consider the instruction format of a MIPS computer. MI

Define the firewall design policy, Define the Firewall Design Policy ...

Define the Firewall Design Policy A lower-level policy that describes how the firewall will handle prevention of access and filtering of services as defined in the above net

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