UGC NET Computer Science Solved Paper II December 2007 - Part 5

41.       A major defect in water fall model in software development is that:

(A) the documentation is difficult

(B) a blunder at any stage can be disastrous

(C) a trial version is available only at the end of the project

(D) the maintenance of the software is difficult

Ans: C

---

42.       Function point metric of a software also depends on the:

(A) number of function needed

(B) number of final users of the software

(C) number of external inputs and outputs

(D) time required for one set of output from a set of input data

Ans: C

---

43.       An error message produced by an interactive system should have:

(A) always the error code

(B) the list of mistakes done by the user displayed

(C) a non-judgemental approach

(D) the past records of the occurrence of the same mistake

Ans: B

Read More

UGC NET Computer Science Solved Paper II December 2007 - Part 4

31.       In a two pass compiler, during the first pass:

(A) user defined address symbols are correlated with their binary equivalent

(B) the syntax of the statement is checked and mistakes, if any, are listed

(C) object program is generated

(D) semantic of the source program is elucidated.

Ans: A

---

32.       A single instruction in an assembly language program contains:

(A) one micro operation

(B) one macro operation

(C) one instruction to be completed in a single pulse

(D) one machine code instruction

Ans: B

---

33.       Absolute loader demands that the programmer needs to know the:

(A) start address of the available main memory

(B) total size of the program

(C) actual address of the data location

(D) absolute values of the operands used

Ans: A

Read More

UGC NET Computer Science Solved Paper II December 2007 - Part 3

21.       Consider  a  rooted  tree  in  which  every  node  has  at  least  three  children.  What  is  the minimum number of nodes at level i (i > 0) of the tree?  Assume that the root is at level 0:

(A) 3ⁱ       (B) 3i

(C) 3       (D) 3i + 1

Ans: A

---

22.       Which of the following data structure is used to implement recursion?

(A) Arrays          (B) Stacks

(C) Queues       (D) Linked lists

Ans: B

---

23.       The height of a binary tree with ‘n’ nodes, in the worst case is:

(A) O(log n)       (B) O(n)

(C) Ω(n log n)   (D) Ω(n²)

Ans: B

Read More

UGC NET Computer Science Solved Paper II December 2007 - Part 2

11.       What cannot replace ‘?’ in the following C code to print all odd numbers less than 100?

for(i=1;?;i+2)

printf(“%d\n”,i);

(A) i≤100           (B) i≤101

(C) i<100           (D) i<101

Ans: B

---

12.       Consider the following linked list:

Which of the following piece of code will insert the node pointed to by q at the end of the list ?

(A) for (p=list; p!=NULL; p=p→next);

p=q;

(B) for (p=list; p!=NULL; p=p→next);

p→next=q;

(C) for (p=list; p→next !=NULL; p=p→next);

p=q;

(D) for (p=list; p→next !=NULL; p=p→next);

p→next=q;

Ans: D

---

13.       Which of the following is a valid C code to print character ‘A’ to ‘C’ ?

(A) x=’A’;

switch(x)

{case ‘A’=printf (“%d\n”, x);   

....   

case ‘C’=printf (“%d\n”, x);   

}

(B) x=’A’;

switch(x)

{case ‘A’<=x <=’C’ : printf (“%d\n”, x);}

(C) x=’A’;

switch(x)

{

case ‘A’ : printf (“%d\n”, x);       

break;

case ‘B’ : printf (“%d\n”, x);       

break;

case ‘C’ : printf (“%d\n”, x);       

break;   

}

(D) x=’A’;

switch(x)

{

case ‘A’=printf (“%d\n”, x);

case ‘B’=printf (“%d\n”, x);

case ‘C’=printf (“%d\n”, x);   

}

Ans: correct answer not given

Read More