cs101 assignment no 2 full solution april 2011

[Vuhelper]

[SIZE="4"][SIZE="4"]full solution in attachment [/SIZE][/SIZE]

Answers

Question No.1 (Marks = 10)
a) How many combinations of bits are exist when we make a truth table of 9 inputs?
2n are the total combinations of bits in Truth table, where n is number of variables, so
29=512
512 bits will there


b) Prepare a truth table for the following I = (w + x)  (y . z) where w, x, y and z are four binary inputs in the truth table.
Note :symbol represent XOR gate)
Solution:
Remember in XOR, output will high only if only all inputs are mismatch to each others.

[sanam]

it will be good please if you provide us a video like you people did in last assignment. it will be great idea.

[DeejayFarhad]

ya .
She is right.
please provide it.

[DeejayFarhad]

She is right.
Please provide it.

[Xpert]

its not so easy to provide video of every assignment. User do not subscribe to our youtube channel. that's the reason.