Computer Science and Applications December-2005

Computer Science and Applications December-2005

PAPER-II

1.   T is a graph with n vertices. T is connected and has exactly n-1 edges, then :

     (A)    T is a tree

     (B)    T contains no cycles

     (C)    Every pairs of vertices in T is connected by exactly one path

     (D)    All of these

UGC NET DEC 2004 PAPER 2 SOLUTION

UGC NET DEC 2004 PAPER 2 SOLUTION:-

1. AVA = A is called:
(A) Identity law                      (B) De Morgan’s law
(C) Idempotant law       (D) Complement law