UGC NET Computer Science Paper III June 2012 - Part 5

41.       Which layer of OSI reference model uses the ICMP (Internet Control Message Protocol)?
(A) Transport layer
(B) Data link layer
(C) Network layer
(D) Application layer
Answer: C
42.       Which one of the following binary search tree is optimal, if probabilities of successful search and unsuccessful search are same?

Answer: D
43.       The regular expression for the following DFA
(A) ab*(b + aa*b)*
(B) a*b(b + aa*b)*
(C) a*b(b* + aa*b)
(D) a*b(b * + aa*b)*
Answer: D
44.       Which diagram provides a formal graphic notation for modelling objects, classes and their relationships to one another?
(A) Object diagram
(B) Class diagram
(C) Instance diagram
(D) Analysis diagram
Answer: A
45.       A computer system supports 32 bit virtual address as well as 32 bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the following is true?
(A) Efficient implementation of multiuser support is no longer possible.
(B) The processor cache can be made more efficient.
(C) Hardware support for memory management is not needed.
(D) CPU scheduling can be made more efficient.
Answer: C
46.       The feasible region represented by the constraints x1x2<=1, x1+x2>=3, x1>=0, x2>=0 of the objective function Max Z=3x1+2x2 is
(A) A polygon
(B) Unbounded feasible region
(C) A point
(D) None of these
Answer: B
47.       The colour 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) White and Red
(B) Red and Blue
(C) Black and White
(D) Black and Red
Answer: D
48.       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
Answer: A
49.       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) degenerate solution
(B) unbounded solution
(C) alternative solution
(D) non-existing solution
Answer: B
50.    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.3n(n–1)/2
(B) 3n(n–1)/2 and 2n(n–1)
(C) 2n(n+1)/2 and 3n(n–1)/2
(D) 2n(n+1)/2 and 2n(n–1)/2
Answer: D

Post a Comment