The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

A logic circuit implements the following Boolean function:

F = A’C + AC’D’

it is found that the circuit input combination A=C=1 can never occur. Find a simpler expression for F using the proper don't-care conditions.

F = A’C + AC’D’

it is found that the circuit input combination A=C=1 can never occur. Find a simpler expression for F using the proper don't-care conditions.

0 votes

Given function = A'C + AC'D'

for the given function min terms are: 𝝨m (2,3,6,7,8,12)

given A = C = 1 will never occur. use dont cares in these combinations.

A |
B | C |
D | F |

0 | 0 | 0 | 0 | 0 |

0 | 0 | 0 | 1 | 0 |

0 | 0 | 1 | 0 | 1 |

0 | 0 | 1 | 1 | 1 |

0 | 1 | 0 | 0 | 0 |

0 | 1 | 0 | 1 | 0 |

0 | 1 | 1 | 0 | 1 |

0 | 1 | 1 | 1 | 1 |

1 | 0 | 0 | 0 | 1 |

1 | 0 | 0 | 1 | 1 |

1 | 0 | 1 | 0 | X |

1 | 0 | 1 | 1 | X |

1 | 1 | 0 | 0 | 1 |

1 | 1 | 0 | 1 | 0 |

1 | 1 | 1 | 0 | X |

1 | 1 | 1 | 1 | X |

by forming k map and simplifying the boolean expression

simplified expression will be **AD' + C**

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.3k
- Digital Logic 2.9k
- Programming & DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6k
- Compiler Design 2k
- Databases 4.1k
- CO & Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.4k
- Admissions 596
- Exam Queries 577
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

49,532 questions

54,126 answers

187,326 comments

71,046 users