## Wednesday, December 11, 2013

### UGC NET Computer Science Solved Paper III June 2013 (Re-test 8th Sept. 2013) - Part 8

@ Home > UGC NET Computer Science Solved Papers > Solved Paper III June 2013 Re-test

71.       Consider a main memory with 3 page frames for the following page reference string :
5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4
Assuming that the execution of process is initiated after loading page 5 in memory, the number of page faults in FIFO and second chance replacement respectively are
(A) 8 and 9        (B) 10 and 11
(C) 7 and 9        (D) 9 and 8

72.       Which of the following shell scripts will produce the output “my first script” ?
(A) for i in my first script { echo –i \$i}
(B) for my first script; do echo –n; done
(C) for i in my first script; do echo –i \$i; done
(D) for n in my first script; do echo –i \$i; done

### UGC NET Computer Science Solved Paper III June 2013 (Re-test 8th Sept. 2013) - Part 7

@ Home > UGC NET Computer Science Solved Papers > Solved Paper III June 2013 Re-test

61.       Which of the following is/are fundamental method(s) of antialiasing ?
(i) Increase of sample rate.
(ii) Treating a pixel as a finite area rather than as a point.
(iii) Decrease of sample rate.
(A) (i) and (ii)    (B) (ii) and (iii)
(C) (i) only         (D) (ii) only

62.       The two color systems – the HSV and HLS are
(A) Hue, Saturation, Value and Hue, Lightness, Saturation.
(B) High, Standard, Value and High, Lightness, Saturation.
(C) Highly, Saturated, Value and Highly, Lightened, Saturation.
(D) Highly, Standard, Value and Hue, Lightness, Saturation.

63.       The parametric representation of the line segment between the position vectors P1(2, 3) and P2(5, 4) is given as
(A) x(t)= 2+7t, y(t) = 3+7t         0 ≤ t ≤
(B) x(t)=2+10t, y(t) = 3+12t      0 ≤ t ≤ 1
(C) x(t)= 2+3t, y(t)=3+t             0 ≤ t ≤ 1
(D) t(x, y) = 14t              0 ≤ t ≤ 1

64.       Consider the following transformation matrix for rotation(clockwise) :
This matrix rotates an object by an angle θ about :
(A) X-axis          (B) Y-axis
(C) Z-axis          (D) All of the above

65.       Consider the following sequence of operations :
(i) Pointer p1 is set to point at a new heap-dynamic variable.
(ii) Pointer p2 is assigned p1’s value.
(iii) The heap dynamic variable pointed to by p1 is explicitly de-allocated, but p2 is not changed by the operation.
This situation leads to which of the following :
(A) p1 becomes a dangling pointer
(B) p2 becomes a dangling pointer
(C) Both p1 and p2 are now dangling pointers
(D) Neither p1 nor p2 is now a dangling pointer

### UGC NET Computer Science Solved Paper III June 2013 (Re-test 8th Sept. 2013) - Part 6

@ Home > UGC NET Computer Science Solved Papers > Solved Paper III June 2013 Re-test

51.       Consider the following two function declarations :
(i) int *f( ) (ii) int (*f)( )
Which of the following is true ?
(A) Both are identical.
(B) The first is a correct declaration and the second is wrong.
(C) Both are different ways of declaring pointer to a function.
(D) The first declaration is a function returning a pointer to an integer and the second is a pointer to function returning integer.

52.       Assume that we have constructor function for both Base and Derived classes. Now consider the declaration :
main ( )
Base *p = new Derived;
In what sequence, the constructor will be executed ?
(A) Derived class constructor is followed by Base class constructor.
(B) Base class constructor is followed by Derived class constructor.
(C) Base class constructor is never called.
(D) Derived class constructor is never called.

53.       What is the output of the following program ?
#include<stdio.h>
main( )
{
int a, b = 0;
static int c[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};
for (a=0; a<10;++a);
if ((c[a]%2)= =0) b+=c[a];
printf(“%d”,b);
}
(A) 15     (B) 25
(C) 45     (D) 20

54.       A Program contains the following declarations and initial assignments
int i = 8, j = 5;
double x = 0.005, y = –0.01;
char c=’c’, d=’d’;
Determine the value of the following expressions which involve the use of library functions:
abs(i-2*j) ; log(exp(x)) ; toupper(d)
(A) 2; 0.005; D (B) 1; 0.005; D
(C) 2; 0.005; E (D) 1; 0.005; e

55.       MPEG involves both spatial compression and temporal compression. The spatial compression is similar to JPEG and temporal compression removes .............. frames.
(A) Temporal     (B) Voice
(C) Spatial         (D) Redundant

### UGC NET Computer Science Solved Paper III June 2013 (Re-test 8th Sept. 2013) - Part 5

@ Home > UGC NET Computer Science Solved Papers > Solved Paper III June 2013 Re-test

41.       Given a binary search trees for a set of n=5 keys with the following probabilities :
The expected optimal cost of the search is
(A) 2.65 (B) 2.70
(C) 2.75             (D) 2.80

42.       Given 0-1 knapsack problem and fractional knapsack problem and the following statements :
S1 : 0-1 knapsack is efficiently solved using Greedy algorithm.
S2 : Fractional knapsack is efficiently solved using Dynamic programming.
Which of the following is true ?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is correct.

43.       Equivalence class partitioning approach is used to divide the input domain into a set of equivalence classes, so that if a program works correctly for a value, then it will work correctly for all the other values in that class. This is used .................
(A) to partition the program in the form of classes.
(B) to reduce the number of test cases required.
(C) for designing test cases in white box testing.
(D) all of the above.

44.       The failure intensity for a basic model as a function of failures experienced is given as λ(μ)-λ0[1 – (μ)/(V0)] where λ0 is the initial failure intensity at the start of the execution, μ is the average or expected number of failures at a given point in time, the quantity V0 is the total number of failures that would occur in infinite time.
Assume that a program will experience 100 failures in infinite time, the initial failure intensity was 10 failures/CPU hr. Then the decrement of failures intensity per failure will be
(A) 10 per CPU hr.
(B) 0.1 per CPU hr.
(C) –0.1 per CPU hr.
(D) 90 per CPU hr.