UGC Net Computer Science December-12 Page 5 Solved

UGC Net Computer Science December-12  Page 5 Solved

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

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

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 ?

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

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*

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

47. The minimum number of states of the non-deterministic finite automation which accepts the language

{a b a bn|n ⥸ 0} ⥸ {a b an|n ⥸ 0} is

(A) 3

 (B) 4

(C) 5

 (D) 6

48. Functions defined with class name are called as

(A) Inline function

(B) Friend function

(C) Constructor

(D) Static function

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 :

50. Which of the following definitions generates the same Language as L,where L = {WWR | W  {a, b}*}

Next Page