Thursday, 6 October 2016

UGC NET Computer Science Paper II June 2013 (Re-test 8th Sept. 2013) - Part 4

31.       Consider the following characteristics:
(i) Correct and unambiguous
(ii) Complete and consistent
(iii) Ranked for importance and/or stability and verifiable
(iv) Modifiable and Traceable
Which of the following is true for a good SRS?
(A) (i), (ii) and (iii)
(B) (i), (iii) and (iv)
(C) (ii), (iii) and (iv)
(D) (i), (ii), (iii) and (iv)
Answer: D
32.       Linked Lists are not suitable for ...................
(A) Binary Search        (B) Polynomial Manipulation
(C) Insertion                 (D) Radix Sort
Answer: A
33.       What is the size of the following Union ? Assume that the size of int = 2, size of float = 4, size of char = 1
union tag {
int a;
float b;
char c;
};
(A) 2       (B) 4
(C) 1       (D) 7
Answer: B
34.       What is the output of the following program segment?
sum(n)
{
if ( n < 1 ) return n;
else return (n + sum(n–1));
}
main()
{
printf(“%d”, sum(5));
}
(A) 10     (B) 16
(C) 15     (D) 14
Answer: C
35.       Assume that x and y are non-zero positive integers. What does the following program segment perform?
while (x!=0)
{
if (x>y)
x = x-y
else
y=y-x;
printf(“%d”,x);
(A) Computes LCM of two numbers
(B) Computes GCD of two numbers
(C) Divides large number with small number
(D) Subtracts smaller number from large number
Answer: B

36.       Consider the following program segment:
d=0;
for(i=1; i<31, ++i)
for(j=1; j<31, ++j)
for(k=1; k<31, ++k)
if ((i+j+k)%3)= = 0);
d = d + 1;
printf(“%d”, d);
The output will be
(A) 9000            (B) 3000
(C) 90                 (D) 2700
Answer: Marks given to all
37.       Usage of Preemption and Transaction Rollback prevents ..................
(A) Unauthorised usage of data file
(B) Deadlock situation
(C) Data manipulation
(D) File pre-emption
Answer: B
38.       The ............... language was originally designed as the Transformation Language for Style Sheet facility.
(A) XSTL           (B) XML
(C) XQuery       (D) XPath
Answer: A
39.       Views are useful for ................. unwanted information, and for collecting together information from more than one relation into a single view.
(A) Hiding                     (B) Deleting
(C) Highlighting                       (D) All of the above
Answer: A
40.    The decision tree classifier is a widely used technique for ...............
(A) Classification         (B) Association
(C) Partition                  (D) Clustering
Answer: A

Pages   2   3   4   5 

0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App