initial lectures are as boring as other of nptel but later on he got energy and more intersting as he talks informly every nptel teacher should learn from hiim
@@afeezlawal5167 For n variables there is a truth table of 2^n rows and the output can be filled with either 0 or 1 so that leaves you to fill 2 ^ (2^n) Here n was 2 so it is 2 ^ 2 ^2 ==> 2 ^4 ==> 16
initial lectures are as boring as other of nptel but later on he got energy and more intersting as he talks informly every nptel teacher should learn from hiim
Thank you for this video it was very helpful!!
Please check at (1:20)last input Should be w0 + w1.1 + w2.1 < 0 instead of >=0, am I right?
Yeah, just a typo.
No it's not a typo because it's a XOR function and here 1 , 1 = 0 and 0 stands for -ve point so that's why it's < 0
at 1:17 secs , There is no such contradictions bcause -2w0 < w1+w2 < -w0 is correct
The inequality holds only if w0 > 0. But in (1) we have w0 < 0. Hence the contradiction.
@@aniketmohanty9501 sorry, can I get the explanation to "how many boolean function can you design from 2input" how is it 16? Thanks
@@afeezlawal5167 For n variables there is a truth table of 2^n rows and the output can be filled with either 0 or 1 so that leaves you to fill 2 ^ (2^n)
Here n was 2 so it is 2 ^ 2 ^2 ==> 2 ^4 ==> 16
@@aniketmohanty9501 can you please explain in detail..