ISI CSB 2017

Question

Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit.

$\text{Determine the number of input combinations for which the output function F realised by }$

$\text{ the circuit becomes true (logic 1)}$

I'm getting $940$ Input combinations

Comments

I m getting 943..could u please tell me, what is the given answer..

---

@Shivani, my approach is we can have a total of $2^{10}=1024$ input combinations. From them, if we deduct the combinations which give 0, then that would be our answer. For first gate, x1 and x2  can be only 1 and 1 , so 1 combination for x1 and x2, similarly there are $1*3*3*3*3=81$ combinations which give 0.

So total would be=$1024-81=943$

---

ya even i did in same way but at last 1024-84 (mistakenly taken 84 instead of 81) so got 940

Thank You

---

There are no solution keys to ISI questions, ryt?