| Home > Computer Science > Discrete Mathematics > Project
July 2002 |
| |
|
|
| Project
July 2002 |
| |
| Q. 1(a). Show that RÙ(PÚQ) is a valid conclusion from the premises PÚQ, Q ->R, P->M and ØM .
Ans.
Let all he premises be true. If Ø M is true then M is false. As P->M, so P is true. If P is true then PVQ is true, as Q->R, so PVR is true. So when PVQ and PVR is true so RÙ(PÚQ) is true.
Q. 1.(b). Show that R->S can be derived from the premises P->(Q->S), ØRÚP and
Ans.
Let all the premises be true. So Q is true. As Q->S, so S is also true. And hence as Q and S both are true so P is also true. Also we know ØRÚP is true and as P->(Q->S) so ØRÚ(Q->S) is true or ØRÚ(S) Û R->S
Q.2. Using Kruskal's algorithm or Prim's algorithm find a minimum spanning tree for the following weighted graph: |
 |
| |
| Ans. |
 |
Minimum Cost is : 22
Cont... |
|
