Table of Content

UGC NET Computer Science : June 2012 – Paper 3 (Solved Papers)


Question 1
The feasible region represented by the constraints 
x1–x2<=1, x1+x2>=3, x1>=0, x2>=0
of the objective function 
Max Z=3x1+2x2
is
A
Unbounded feasible region
B
A point
C
A polygon
D
None of these
Question 2
The color of an object is largely determined by its diffuse reflection coefficient. If Kd = (0.8, 0.4, 0), then what shall be the colour of the object, if the light used is blue and magenta ?
A
Black and Red
B
Black and White
C
Red and Blue
D
White and Red
Question 3
If an instruction takes ‘i’ microseconds and a page fault takes an additional ‘j’ microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is
A
i + j * k
B
(i + j ) / k
C
i + j / k
D
(i + j) * k
Question 4
In any simplex table, if corresponding to any negative Dj, all elements of the column are negative or zero, the solution under the test is
A
unbounded solution
B
alternative solution
C
non-existing solution
D
degenerate solution
Question 5
How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric ?
A
2n(n+1)/2 and 2n(n–1)/2
B
2n(n+1)/2 and 2n.3n(n–1)/2
C
2n(n+1)/2 and 3n(n–1)/2
D
3n(n–1)/2 and 2n(n–1)

Pages: Page 1, Page 2, Page 3, Page 4, Page 5, Page 6, Page 7, Page 8, Page 9, Page 10, Page 11, Page 12, Page 13, Page 14, Page 15