# UGC NET Computer Science Previous Questions June 2013 Paper 2 - Part 1

1.       COCOMO stands for
(A) COmposite COst MOdel
(B) COnstructive COst MOdel
(C) COnstructive COmposite MOdel
(D) COmprehensive COnstruction MOdel
Explanation:
The Constructive Cost Model (COCOMO) is an algorithmic software cost estimation model.
2.       Match the following:
a. Good quality     i. Program does not fail for a specified time in a given environment
b. Correctness     ii. Meets the functional requirements
c. Predictable      iii. Meets both functional and non-functional requirements
d. Reliable          iv. Process is under statistical control
Codes:
a   b  c  d
(A) iii  ii   iv  i
(B) ii   iii  iv  i
(C) i    ii  iv  iii
(D) i    ii  iii  iv
3.       While estimating the cost of software, Lines of Code (LOC) and Function Points (FP) are used to measure which one of the following?
(A) Length of code                  (B) Size of software
(C) Functionality of software (D) None of the above
4.       A good software design must have
(A) High module coupling, High module cohesion
(B) High module coupling, Low module cohesion
(C) Low module coupling, High module cohesion
(D) Low module coupling, Low module cohesion
5.       Cyclometric complexity of a flow graph G with n vertices and e edges is
(A) V(G) = e+n-2
(B) V(G) = e-n+2
(C) V(G) = e+n+2
(D) V(G) = e-n-2

6.       When the following code is executed what will be the value of x and y?
int x = 1, y=0;
y = x++;
(A) 2, 1               (B) 2, 2
(C) 1, 1               (D) 1, 2
7.       How many values can be held by an array A(-1,m;1 ,m) ?
(A) m                  (B) m2
(C) m(m+l)         (D) m(m+2)
Explanation:
Total number of values =m(m+2). Because -1 to m, m+2 values and 1 to m, m values
8.       What is the result of the expression
(1&2)+(3/4) ?
(A) 1       (B) 2
(C) 3       (D) 0
9.       How many times the word 'print' shall be printed by the following program segment?
for(i=1, i≤2, i++)
for(j=1, j≤2, j++)
for(k=1, k≤2, k++)
printf("print/n")
(A) 1       (B) 3
(C) 6       (D) 8
1. 