Minimis logic function using K-map, Computer Engineering

Assignment Help:

Minimise the logic function F (A, B, C, D) = Π M (1, 2, 3, 8, 9, 10, 11,14) ⋅ d (7, 15)
Use Karnaugh map.

Ans. Given function F=∏M(1,2,3,8,9,10,11,14).d(7, 15)
F'=B'D+B'C+AC+AB' By Complementing F
F=(B'D+B'C+AC+AB')'
= [(B'D)'(B'C)'(AC)'(AB')']'
= (B+D')(B+C')(A'+C')(A'+B)
Taking here complement twice but also without opening the bracket
F=[(B+D')+(B+C')'('A'+C')+(A'+B)]'

322_Minimis logic function using K-map.png

Related Discussions:- Minimis logic function using K-map

Define flowchart, Define Flowchart. A process of expressing an alg...

Define Flowchart. A process of expressing an algorithm by a collection of linked geometric shapes containing explanations of the algorithm's steps.

Show the layout of dvorak-dealey keyboard, Q. Show the layout of Dvorak-Dea...

Q. Show the layout of Dvorak-Dealey keyboard? This was one keyboard layout designed to be a challenger to QWERTY layout. This was designed by August Dvorak and William Dealey a

Explain about algebraic simplification, Q. Explain about Algebraic Simplifi...

Q. Explain about Algebraic Simplification? We have already determined algebraic simplification of logic circuit. An algebraic expression can exist in SOP or POS forms. Let's i

How can we create an outline around text, Place some text wherever. Then cl...

Place some text wherever. Then click "Create path from text" in the "Text tool option" window. Then use "Edit" -> "Stroke path" and choose the appropriate options in the following

Drawbacks, drawbacks of shadow paging

drawbacks of shadow paging

Explain transport layer of osi model, Explain Transport Layer of OSI Mode...

Explain Transport Layer of OSI Model. The transport layer utilizes the services provided through the network layer, as best path selection and logical addressing, to give end

Concept of data paralellism, need tutorial on data paralellism.

need tutorial on data paralellism.

What is a diagonalization language ld, What is a Diagonalization language L...

What is a Diagonalization language LD? The diagonalization language having of all strings w such that the TM whose code is w does not accept when w is given as in

Explain the process of skolemization., Problem 1. Explain briefly the p...

Problem 1. Explain briefly the process of matching production rules against working memory 2. What are the different kinds of knowledge that need to be represented in AI? Ex

Evaluate fixed execution time, The statement of Gustafson's law can be desc...

The statement of Gustafson's law can be described with the help of an illustration. Let us take a problem, say P, which has to be solved using a parallel computer. Let Ts be the ti

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages