# UGC NET Computer Science Solved Paper -II Dec2015

## UGC NET Computer Science Solved Paper -II Dec2015

1. How many committees of five people can be chosen from 20 men and 12 women such that each committee contains atleast three women ?
(1)     75240    (2)     52492    (3)     41800    (4)     9900

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 (Kn) has a Hamilton Circuit whenever n ≥ 3.
(d)    A cycle over six vertices (C6) 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

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.
Codes :
(1)  (a)and(c)    (2)  (b) and (d)      (3)  (b) only         (4)   (d) only

The two distinct sets of vertices, which make the graph bipartite are :
(1)     (V1, V2,V6); (V2, V3, V5, V7, V8)          (2)     (V1, V7, V8); (V2, V3, V5, V6)
(3)     (V1, V4, V6, V7); (V2, V3, V5, V8)         (4)     (V1 ,V4, V6, V7, V8); (V2, V3, V5)

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)

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 N2>1.  Suppose that N2>1, then n>l.
Codes :
(1)     (a)and(c)    (2)     (b) and (c)    (3)     (a), (b) and (c)     (4)     (a) and (b)

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∀nP(m,n)    (b)     ∀n P(1, n)    (c)     ∀m ∀n P(m, n)
Codes :
(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

8. Match the following terms:
List-I                  List-II
(a)    Vacuous proof     (i)  A proof that the implication p → q is true based on the fact that p is false.
(b)    Trivial proof       (ii)  A proof that the implication p → q is true based on the fact that q is true.
(c)    Direct proof     (iii) A proof that the implication p → q is true that proceeds by showing  that q must be true when p is true.
(d)    Indirect proof    (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)

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)

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

11.    Consider the following program :
#include<stdio.h>
main( )
{
int i, inp;
float x, term=1, sum=0;
scanf(“%d %f “, & inp, &x);
for(i=1; i<=inp; i++)
{
term = term * x/i;
sum = sum + term;
}
printf(“Result = %f\n”, sum);
}
The program computes the sum of which of the following series ?
(1)     x +  x2/2  +  x2/3 + x2/4 +…    (2)   x +  x2/2!  +  x2/3! + x2/4! +…
(3)     1 +  x2/2  +  x2/3 + x2/4 +…    (4)  1 +  x2/2  +  x2/3 + x2/4 +…

12.    Consider the following two statements :
(a)    A publicly derived class is a subtype of its base class.
(b)    Inheritance provides for code reuse.
Which one of the following statements is correct ?
(1)    Both the statements (a) and (b) are correct.
(2)    Neither of the statements (a) and (b) are correct.
(3)    Statement (a) is correct and (b) is incorrect.
(4)    Statement (a) is incorrect and (b) is correct.

13.    Consider a “CUSTOMERS” database table having a column “CITY” filled with all the names of Indian cities (in capital letters). The SQL statement that finds all cities that have “GAR” somewhere in its name, is:
(1)    Select* from customers where city = ‘%GAR%’;
(2)    Select* from customers where city = ‘\$GAR\$’;
(3)    Select* from customers where city like’%GAR%’;
(4)    Select* from customers where city as ToGAR’;

14.    Match the following database terms to their functions :
List-I                                               List-II
(a)    Normalization               (i) Enforces match of primary key to foreign key
(b)    Data Dictionary            (ii) Reduces data redundancy in a database
(c)    Referential Integrity  (iii) Defines view(s) of the database for particular user(s)
(d)    External Schema        (iv) Contains metadata describing database structure Codes :
(a)     (b)     (c)     (d)
(1)    (iv)    (iii)    (i)      (ii)
(2)    (ii)     (iv)    (i)      (iii)
(3)    (ii)     (iv)    (iii)    (i)
(4)    (iv)    (iii)    (ii)     (i)

15.    In general, in a recursive and non-recursive implementation of a problem (program) :
(1)    Both time and space complexities are better in recursive than in non-recursive program.
(2)    Both time and space complexities are better in non-recursive than in recursive program.
(3)   Time complexity is better in recursive version but space complexity is better in non-recursive version of the program.
(4)   Space complexity is better in recursive version but time complexity is better in non-recursive version of the program.

16.    A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer) :
(1)    &A[o][o][o]Iw(y*z*q + z*p + r)
(2)    &A[o][o][o]Iw(y*z*p + z*q + r)
(3)    &A[o][o][o]Iw(x*y*p + z*q + r)
(4)    &A[o][o][o]Iw(x*y*q + z*p + r)

17.    In C++, which system – provided function is called when no handler is provided to deal with an exception ?
(1)     terminate ()        (2)     unexpected ()     (3)     abort ()    (4)     kill ()

18.    Which of the following provides the best description of an entity type ?
(1)    A specific concrete object with a defined set of processes (e.g. Jatin with diabetes)
(2)    A value given to a particular attribute (e.g. height – 230 cm)
(3)    A thing that we wish to collect data about zero or more, possibly real world examples of it may exist
(4)    A template for a group of things with the same set of characteristics that may exist in the real world

19.    Data which improves the performance and accessibility of the database are called :
(1)     Indexes                            (2)     User Data
(3)     Application Metadata    (4)     Data Dictionary

20.    A relation R = {A, B, C, D, E, F,G} is given with following set of functional dependencies :
Which of the following is a candidate key ?
(1)     A    (2)     AB    (3)     ABC    (4)     ABD

21.    Which of the following services is not provided by wireless access point in 802.11 WLAN ?
(1)     Association    (2)     Disassociation     (3)   Error correction    (4)     Integration

22.    Which of the following fields in IPv 4 datagram is not related to fragmentation ?
(1)     Type of service    (2)     Fragment offset  (3)     Flags    (4)     Identification

23.    Four channels are multiplexed using TDM. If each channel sends 100 bytes/second and we multiplex 1 byte per channel, then the bit rate for the link is_______.
(1)     400 bps    (2)     800 bps    (3)     1600 bps    (4)     3200 bps

24.    In a typical mobile phone system with hexagonal cells, it is forbidden to reuse a frequency band in adjacent cells. If 840 frequencies are available, how many can be used in a given cell?
(1)     280    (2)     210    (3)     140    (4)     120

25. Using p = 3, q = 13, d = 7 and e = 3 in the RSA algorithm, what is the value of ciphertext for a plaintexts?
(1)     13   (2)     21     (3)     26     (4)     33