## Exam-GK-MCQ-Questions.Com

Home - Ugc Net Computer Science - Previous Year Solved Papers - UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 2 December 2015

# UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 2 December 2015 Online Exam Quiz

Important questions about UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 2 December 2015. UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 2 December 2015 MCQ questions with answers. UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 2 December 2015 exam questions and answers for students and interviews.

Options

A : (a) only

B : (b) and (c)

C : (c) only

D : (d) only

Options

A : (a) and (c)

B : (b) and (d)

C : (b) only

D : (d) only

### 4. Consider the graph given below: The two distinct sets of vertices, which make the graph bipartite are:

Options

A : (v 1 , v 4 , v 6 ); (v 2 , v 3 , v 5 , v 7 , v 8 )

B : (v 1 , v 7 , v 8 ); (v 2 , v 3 , v 5 , v 6 )

C : (v 1 , v 4 , v 6 , v 7 ); (v 2 , v 3 , v 5 , v 8 )

D : (v 1 , v 4 , v 6 , v 7 , v 8 ); (v 2 , v 3 , v 5 )

### 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?

Options

A : (a) and (b)

B : (b) and (c)

C : (a) and (c)

D : (a), (b) and (c)

Options

A : Prototyping

B : Iterative

C : Time-boxing

D : Glass-boxing

Options

A : 4960

B : 2600

C : 23751

D : 8855

Options

A : 32 GB

B : 64 GB

C : 16 GB

D : 1 GB

Options

A : M-Banking

B : E-Banking

C : O-Banking

D : C-Banking

### 50. The inorder traversal of the following tree is:

Options

A : 2 3 4 6 7 13 15 17 18 18 20

B : 20 18 18 17 15 13 7 6 4 3 2

C : 15 13 20 4 7 17 18 2 3 6 18

D : 2 4 3 13 7 6 15 17 20 18 18

### 6. Which of the following arguments are not valid?

Options

A : (a) and (c)

B : (b) and (c)

C : (a), (b) and (c)

D : (a) and (b)

### 7. Let P(m, n) be the statement "m divides n” where the Universe of discourse for both the variable 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)

Options

A : (a)-True; (b)-True; (c)-False

B : (a)-True; (b)-False; (c)-False

C : (a)-False; (b)-False; (c)-False

D : (a)-True; (b)-True; (c)-True

Options

A : (a) and (c)

B : (b) and (c)

C : (a) and (b)

D : only (a)

Options

A : (a) and (b)

B : (b) and (c)

C : (a) only

D : (b) only

### 11. Consider the following program: #include 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?

Options

A : x+x 2 /2+x 3 /3+x 4 /4+...

B : x+x 2 /2!+x 3 /3!+x 4 /4!+...

C : 1+x 2 /2+x 3 /3+x 4 /4+...

D : 1+x 2 /2!+x 3 /3!+x 4 /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 of the following statements is correct?

Options

A : Both the statements (a) and (b) are correct

B : Neither of the statements (a) and (b) are correct

C : Statement (a) is correct and (b) is incorrect

D : 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:

Options

A : Select *from customers where city='%GAR%’;

B : Select *from customers where city='\$GAR\$’;

C : Select *from customers where city like ‘%GAR%’;

D : Select *from customers where city as '%GAR’;

### 15. In general, in a recursive and non-recursive implementation of a problem (program) :

Options

A : Both time and space complexities are better in recursive than in non-recursive program.

B : Both time and space complexities are better in non-recursive than in recursive program

C : Time complexity is better in recursive version but space complexity is better in non-recursive version of the program.

D : 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]. Consider that array elements are stored in row major order and indexing begins from 0. 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):

Options

A : &A[0][0][0] + w(y * z * q + z * p + r)

B : &A[0][0][0] + w(y * z * p + z*q + r)

C : &A[0][0][0] + w(x * y * p + z * q+ r)

D : &A[0][0][0] + w(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?

Options

A : terminate ( )

B : unexpected ( )

C : abort ( )

D : kill ( )

### 18. Which of the following provides the best description of an entity type?

Options

A : A specific concrete object with a defined set of processes (e.g. Jatin with diabetes)

B : A value given to a particular attribute (e.g. height - 230 cm)

C : A thing that we wish to collect data about zero or more, possibly real world examples of it may exist

D : A template for a group of things with the same set of characteristics that may exist in the real world