UGC NET Previous Year Papers
COMPUTER SCIENCE AND APPLICATIONS
Paper II – December 2015
1. How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women?
(1) 75240
(2) 52492
(3) 41800
(4) 9900
Ans: (2)
2. Which of the following statement(s) is/are false?
(a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.
(b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree.
(c) A complete graph (K_{n}) has a Hamilton Circuit whenever n≥3
(d) A cycle over six vertices (C_{6}) is not a bipartite graph but a complete graph over 3 vertices is bipartite.
Codes:
(1) (a) only
(2) (b) and (c)
(3) (c) only
(4) (d) only
Ans: (4)
3. Which of the following is/are not true?
(a) The set of negative integers is countable.
(b) The set of integers that are multiples of 7 is countable.
(c) The set of even integers is countable.
(d) The set of real numbers between 0 and ^{1}/_{2} is countable.
(1) (a) and (c)
(2) (b) and (d)
(3) (b) only
(4) (d) only
Ans: (4)
4. Consider the graph given below:
The two distinct sets of vertices, which make the graph bipartite are:
(1) (ν_{1}, v_{4}, v_{6}); (v_{2}, v_{3}, v_{5}, v_{7}, v_{8})
(2) (v_{1}, v_{7}, v_{8}); (v_{2}, v_{3}, v_{5}, v_{6})
(3) (v_{1}, v_{4}, v_{6}, v_{7}); (v_{2}, v_{3}, v_{5}, v_{8})
(4) (v_{1}, v_{4}, v_{6}, v_{7}, v_{8}); (v_{2}, v_{3}, v_{5})
Ans: (3)
5. A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, …,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?
Codes:
(1) (a) and (b)
(2) (b) and (c)
(3) (a) and (c)
(4) (a), (b) and (c)
Ans: (4)
6. Which of the following arguments are not valid?
(a) “If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”.
(b) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”.
(c) If n is a real number such that n>1, then n^{2}>1. Suppose that n^{2}>1, then n>1.
Codes:
(1) (a) and (c)
(2) (b) and (c)
(3) (a), (b) and (c)
(4) (a) and (b)
Ans: (1)
7. Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions.
(a) ∃m ∀n P(m,n)
(b) ∀n P(1,n)
(c) ∀m ∀n P(m,n)
(1) (a)True; (b)True; (c)False
(2) (a)True; (b)False; (c)False
(3) (a)False; (b)False; (c)False
(4) (a)True; (b)True; (c)True
Ans: (1)
8. Match the following terms:
List – I 
List – II 
(a) Vacuous proof (b) Trivial proof (c) Direct proof (d) Indirect proof

(i) A proof that the implication p→q is true based on the fact that p is false (ii) A proof that the implication p→q is true based on the fact that q is true (iii) A proof that the implication p→q is true that proceeds by showing that q must be true when p is true. (iv) A proof that the implication p→q is true that proceeds by showing that p must be false when q is false. 
Codes:
(a) (b) (c) (d)
(1) (i) (ii) (iii) (iv)
(2) (ii) (iii) (i) (iv)
(3) (iii) (ii) (iv) (i)
(4) (iv) (iii) (ii) (i)
Ans: (1)
9. Consider the compound propositions given below as:
(a) p˅~(p˄q)
(b) (p˄~q)˅~(p˄q)
(c) p˄(q˅r)
Which of the above propositions are tautologies?
(1) (a) and (c)
(2) (b) and (c)
(3) (a) and (b)
(4) (a), (b) and (c)
Ans: (Marks to all)
Only (1)
10. Which of the following property/ies a Group G must hold, in order to be an Abelian group?
(a) The distributive property
(b) The commutative property
(c) The symmetric property
Codes:
(1) (a) and (b)
(2) (b) and (c)
(3) (a) only
(4) (b) only
Ans: (4)