edited by
8,206 views
11 11 votes

The boolean expression $\text{AB + A}\text{B}'+\text{A}'\text{C + AC}$ is independent of the boolean variable

  1. $\text{A}$
  2. $\text{B}$
  3. $\text{C}$
  4. None of these

5 Answers

3 3 votes

We have AB+AB'+A'C+AC

We can rewrite above equation as

AB(C+C')+AB'(C+C')+A'(B+B')C+A(B+B')C ....(As (C+C')=0, (B+B')=0)

We get

ABC+ABC'+AB'C+AB'C'+A'BC+A'B'C+ABC+AB'C

Eliminating Common Terms and rewrite equation as.

ABC+ABC'+AB'C+AB'C'+A'BC+A'B'C

expression in terms of minterms is

m7+m6+m5+m4+m3+m1

K-Map will be

    C'B' C'B CB CB'
    00 01 11 10
A' 0 0 1 1 0
A 1
1
1
1
1

Thus we can write Reduced equation as

A+C

2 2 votes
F =  AB + AB′ + A′C + AC

F = A(B + B') + C(A' + A)

F = A.1 + C.1             ( A + A' = 1 )

F = A + C

Here not present B variable

So Option (B) is correct answer
1 1 vote
AB + AB' + A'C + AC
= A(B + B') + C(A + A')
= A + C(/pre)
As the expression is independent of 'B', option (B) is correct.
Answer:
Position:
Show:

Related questions

11 11 votes
4 answers 4 answers
5.5k
5.5k views
go_editor asked Jun 16, 2016
5,540 views
The complement of the Boolean expression $\text{AB}(\overline{\text{B}}\text{C + AC})$ is$(\overline{\text{A}} + \overline{\text{B}})+(\text{B} + \overline{\text{C}}). (\...
10 10 votes
6 answers 6 answers
15.4k
15.4k views
go_editor asked Jun 16, 2016
15,410 views
Minimum number of $2 \times 1$ multiplexers required to realize the following function, $f = \overline{A} \;\overline{B} C + \overline{A}\; \overline{B} \;\overline{C}$As...
14 14 votes
2 answers 2 answers
6.0k
6.0k views
go_editor asked Jun 15, 2016
5,988 views
Which of the given number has its $\text{IEEE - 754}$ $32$-bit floating point representation as $\text{(0 10000000 110 0000 0000 0000 0000 0000)}$$2.5$$3.0$$3.5$$4.5$
14 14 votes
4 answers 4 answers
15.4k
15.4k views
anand007 asked Jun 14, 2016
15,412 views
The decimal number has $64$ digits. The number of bits needed for its equivalent binary representation is?$200$$213$$246$$277$