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

Explain busy hour calling rate in telephone traffic, With reference to tele...

With reference to telephone traffic, explain the terms BHCR. BHCR: Busy hour calling rate is explained as the average number of calls originated through a subscriber througho

Define memory allocation functions, The various memory allocation functions...

The various memory allocation functions are described below: (i) malloc( ) : It is a memory allocation function that assigns requested size of bytes and returns a pointer to t

Sound and complete, Dictator Dim wants to replace counting, in particular, ...

Dictator Dim wants to replace counting, in particular, counting the population of his land. To keep an accurate population count, Dictator Dim has instructed his secretary to add o

Dbms, What are the disadvantages of file processing system?

What are the disadvantages of file processing system?

Develop an object-oriented design, Investigate the MIPS programmers model a...

Investigate the MIPS programmers model and develop an object-oriented design that will reflect aspects of the MIPS architecture. Consider the functional units of the architecture a

Two layer artificial neural networks, Two Layer Artificial Neural Networks:...

Two Layer Artificial Neural Networks: However decision trees are whenever powerful they are as a simple representation scheme. Whereas graphical on the surface that they can b

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Recursive procedures are implemented, Recursive procedures are implemented ...

Recursive procedures are implemented by using Recursive procedures are executed by using stacks due to stacks are LIFO data structure and we require this feature to store retur

What are interacting processes, What are interacting processes? Intera...

What are interacting processes? Interacting processes: The concurrent processes executing into the operating system are cooperating or interacting processes if they can be af

Explian service topologies, Explian Service Topologies Service Topolog...

Explian Service Topologies Service Topologies In a service-based architecture there increase dependencies between services resulting from cooperation

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