Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
In K-map, you might find some cells filled with the letter d (or X). This d is called "Don't care". There may arise a case when for a given combination of input, we may not have a specified output, or the input combination may be invalid. The combinations for which we don't have any output expression specified are called don't care combination. When forming groups of cells, don't care conditions (d) are considered as 1, if it helps

In K-map, you might find some cells filled with the letter d (or X). This d is called "Don't care". There may arise a case when for a given combination of input, we may not have a specified output, or the input combination may be invalid. The combinations for which we don't have any output expression specified are called don't care combination. When forming groups of cells, don't care conditions (d) are considered as 1, if it helps

Systems Architecture
Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter7: Input/output Technology
Section: Chapter Questions
Problem 28VE
See similar textbooks
icon
Related questions
Question

help

In K-map, you might find some cells filled with the letter d (or X). This d is called "Don't care". There may arise a case when for a given combination of input, we may not have a specified output, or the input combination may be invalid. The combinations for which we don't have any output expression specified are called don't care combination. When forming groups of cells, don't care conditions (d) are considered as 1, if it helps form the largest group, otherwise it is considered as 0 and are left during grouping. This is helpful if it allows us to form a larger group than would otherwise be possible without the don't cares. There is no requirement to group all or any of the don't cares. Rule: Only use the Don't cares in a group if this simplifies the logic. Based on the above note, and applying the same K-Map rules, you are asked to answer the below questions for the below 4-variable K-Map: a- Show the groups that should be considered, replacing the d's where necessary to obtain the optimal solution. (You should replace only the needed d with 1 in your solution and 0 otherwise). b- Write the simplified equation of the function F. c- Find the complement (F') of the simplified F. Apply De Morgan's law and show the steps. You can keep it in the product of sum form.
Transcribed Image Text:In K-map, you might find some cells filled with the letter d (or X). This d is called "Don't care". There may arise a case when for a given combination of input, we may not have a specified output, or the input combination may be invalid. The combinations for which we don't have any output expression specified are called don't care combination. When forming groups of cells, don't care conditions (d) are considered as 1, if it helps form the largest group, otherwise it is considered as 0 and are left during grouping. This is helpful if it allows us to form a larger group than would otherwise be possible without the don't cares. There is no requirement to group all or any of the don't cares. Rule: Only use the Don't cares in a group if this simplifies the logic. Based on the above note, and applying the same K-Map rules, you are asked to answer the below questions for the below 4-variable K-Map: a- Show the groups that should be considered, replacing the d's where necessary to obtain the optimal solution. (You should replace only the needed d with 1 in your solution and 0 otherwise). b- Write the simplified equation of the function F. c- Find the complement (F') of the simplified F. Apply De Morgan's law and show the steps. You can keep it in the product of sum form.
F A'B' A'B AB AB' C'D' 1 0 d d C'D 0 d 1 1 CD d 1 d 0 CD' 0 d 0 d
Transcribed Image Text:F A'B' A'B AB AB' C'D' 1 0 d d C'D 0 d 1 1 CD d 1 d 0 CD' 0 d 0 d
Expert Solution
steps

Step by step

Solved in 2 steps with 5 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Closest pair algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS