Computer Science Study Materials for Competitive Exams

Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

Thursday, 15 March 2018

UGC NET Computer Science and Applications Paper III December 2012 - Part 5

41.       Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C which have peak demands of 3, 4 and 6 respectively. For what value of m deadlock will not occur?
(A) 7
(B) 9
(C) 10
(D) 13
Answer: D
42.       The grammar ‘G1’ S→OSO|ISI|0|1|ϵ and the grammar ‘G2’ is
S→aS|aSb|X, X→Xa|a.
Which is the correct statement?
(A) G1 is ambiguous, G2 is unambiguous
(B) G1 is unambiguous, G2 is ambiguous
(C) Both G1 and G2 are ambiguous
(D) Both G1 and G2 are unambiguous
Answer: B
43.       Consider n processes sharing the CPU in round robin fashion. Assuming that each process switch takes s seconds. What must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the CPU at least every t seconds?
Answer: B
44.       The Default Parameter Passing Mechanism is called as
(A) Call by Value
(B) Call by Reference
(C) Call by Address
(D) Call by Name
Answer: A
45.       Which of the following regular expression identities are true?
(A) (r+s)*=r*s*
(B) (r+s)*=r*+s*
(C) (r+s)*=(r*s*)*
(D) r*s*=r*+s*
Answer: C

46.       Two graphs A and B are shown below :
Which one of the following statement is true?
(A) Both A and B are planar.
(B) Neither A nor B is planar.
(C) A is planar and B is not.
(D) B is planar and A is not.
Answer: A
Explanation:
A planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other.
47.       The minimum number of states of the non-deterministic finite automation which accepts the language
{ababn|n≥0}U{aban|n≥0} is
(A) 3
(B) 4
(C) 5
(D) 6
Answer: C
Explanation:
48.       Functions defined with class name are called as
(A) Inline function
(B) Friend function
(C) Constructor
(D) Static function
Answer: C
49.       Let f be the fraction of a computation (in terms of time) that is parallelizable, P the number of processors in the system, and sp the speed up achievable in comparison with sequential execution – then the sp can be calculated using the relation :
Answer: C
50.    Which of the following definitions generates the same Language as L, where L={WWR|Wϵ{a,b}*}
(A) S→asb|bsa|ϵ
(B) S→asa|bsb|ϵ
(C) S→asb|bsa|asa|bsb|ϵ
(D) S→asb|bsa|asa|bsb
Answer: B


No comments:

Post a Comment