Using the connection abbreviation, show how a PAL can be programmed to implement the following Boolean equations. D1 = A̅B̅̅C + A̅ C̅ + AB̅ C D2 = AB̅ C + B̅ C̅ D3 = A̅ BC + A̅ B + A̅ BC̅ KINDLY DO A VIDEO ON THIS PLEASE
If it's 3 variables the maximum possible combinations are 8. On representing it in binary the value ranges from 0 to 7(8 values) For two variables the possibilities are 4 combinations I.e.from 0 to 3
7 is the maximum number that we can show in three bits, and if we square it, the number of bits required to represent that number, is the amount of bit that we can represent square of numbers less than 7
