+91-9920808017


December 2012


Home >UGC NET Computer Science Solved Papers >

December 2012 >

Paper 3

December 2012

Paper 2


December 2014

December 2015

July 2016

JUNE 2013

June 2015




 

 





51:

Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure)


A.

O (n log logn)  


B.

θ(n logn)


C.

Ω(n logn)


D.

Ω(n3/2)


  Answer Report Discuss

52:
Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping
 
int i;
program Main( )
{
i = 10;
call f ( );
}
procedure f( )
{
int i = 20;
call g ( );
}
procedure g( )
{
print i;
}
Let x be the value printed under static scoping and y be the value printed under dynamic scoping. Then x and y
are
 

A.

x = 10, y = 20


B.

x = 20, y = 10


C.

x = 20, y = 20


D.

x = 10, y = 10


  Answer Report Discuss

53:

If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater than i, then the word w is of length 


A.

no greater than 2i+1 


B.

no greater than 2i


C.

no greater than 2i–1


D.

 no greater than i


  Answer Report Discuss

54:

The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system 


A.
Class Model, Object Model and Analysis Model.
B.
Object Model, Dynamic Model, and Functional Model.
C.
Class Model, Dynamic Model and Functional Model.
D.
Object Model, Analysis Model and Dynamic Model.
  Answer Report Discuss

55:

The factors that determine the quality of a software system are 


A.
correctness, reliability
B.
efficiency, usability, maintainability
C.
testability, portability, accuracy, error tolerances, expandability, access control, audit.
D.
All of the above
  Answer Report Discuss

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15


Computer Science
Engineering Maths
Free Online Test