The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
70 views
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.
in Digital Logic by Boss (10.3k points) | 70 views

1 Answer

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

by (55 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,896 questions
55,153 answers
190,576 comments
85,317 users