Short Answer TypeVerify the following using Boolean Laws.
A’+ B’.C = A’.B’.C’+ A’.B.C’+ A’.B.C + A’.B’.C+ A.B’.C
LHS
A’ + B’.C
= A’.(B + B’).(C + C’) + (A + A’).B’.C
= A’.B.C + A’.B.C’ + A’.B’.C + A’.B’.C’ + A.B’.C + A’.B’.C
= A’.B.C + A’.B.C’ + A’.B’.C + A’.B’.C’ + A.B’.C
= A’.B’.C’ + A’.B.C’ + A’.B.C + A’.B’.C + A.B’.C
= RHS
Derive a Canonical POS expression for a Boolean function F, represented by the following truth table:
| P | Q | R | F(P, Q, R) |
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 |
Reduce the following Boolean Expression to its simplest form using K-Map:
F(X,Y,Z,W)= (2,6,7,8,9,10,11,13,14,15)
Which protocol helps us to browse through web pages using internet browsers?
Name any one internet browser.
Write two advantages of 4G over 3G Mobile Telecommunication Technologies in terms of speed and services?
Categories the following under Client side and Server Side script category?
Switch
