UGC NET JUNE 2013 SYLLABUS, MODEL PAPER/ PREVIOUS YEARS SOLVED QUESTION PAPERS.
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
38. Which is not the correct statement ?
(A) The class of regular sets is closed under homomorphisms.
(B) The class of regular sets is not closed under inverse homomorphisms.
(C) The class of regular sets is closed under quotient.
(D) The class of regular sets is closed under substitution.
39. When a programming Language has the capacity to produce new data type, it is called as,
(A) Overloaded Language
(B) Extensible Language
(C) Encapsulated Language
(D) Abstraction Language
40. Which of the following operating system is better for implementing client-server network ?
(A) Windows 95
(B) Windows 98
(C) Windows 2000
(D) All of these
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'
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 ?
(A) q ≤ t - ns / n - 1
(B) q ≥ t - ns / n - 1
(C) q ≤ t - ns / n + 1
(D) q ≥ t - ns / n + 1
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 :
(A) 1 / 1 - f - f/P
(B) P / P - f(P+1)
(C) 1 / 1 - f + f/P
(D) P / P + f(P-1)
50. Which of the following definitions generates the same Language as L,
where
51. Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure)
(A) O(n log logn)
(B) θ(n logn)
(C) Ω(n logn)
(D) Ω(n3/2)
52. Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping
int i;
program Main( )
{
i = 10;
call f ();
}
procedure f( )
{
int i = 20;
call g ( );
}
procedure g( )
{
print i;
}
Let x be the value printed under static scoping and y be the value printed under dynamic scoping. Then x and y are
(A) x = 10, y = 20
(B) x = 20, y = 10
(C) x = 20, y = 20
(D) x = 10, y = 10
53. If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater than i, then the word w is of length
(A) no greater than 2i+1
(B) no greater than 2i
(C) no greater than 2i-1
(D) no greater than i
54. The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system
(A) Class Model, Object Model and Analysis Model.
(B) Object Model, Dynamic Model, and Functional Model.
(C) Class Model, Dynamic Model and Functional Model.
(D) Object Model, Analysis Model and Dynamic Model.
55. The factors that determine the quality of a software system are
(A) correctness, reliability
(B) efficiency, usability, maintain-ability
(C) testability, portability, accuracy, error tolerances, expandability, access control, audit.
(D) All of the above
56. If a relation with a Schema R is decomposed into two relations R1 and R2 such that (R1∪R2) = R1 then which one of the following is to be satisfied for a lossless joint decomposition (—> indicates functional dependency)
(A) (R1 ∩ R2) —> R1 or R1∩ R2 —> R2
(B) R1∩ R2 —> R1
(C) R1∩ R2 —> R2
(D) R1 ∩ R2 —> R1 and R1∩ R2 —> R2
57. Given the following statements :
(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complementation.
Which is/are the correct statements ?
(A) only(i)
(B) only(ii)
(C) both (i) and (ii)
(D) neither (i) nor (ii)
58. Skolemization is the process of
(A) bringing all the quantifiers in the beginning of a formula in FDL.
(B) removing all the universal quantifiers.
(C) removing all the existential quantifiers.
(D) all of the above.
59. Which level of Abstraction describes how data are stored in the data base ?
(A) Physical level
(B) View level
(C) Abstraction level
(D) Logical level
60. The transform which possesses the "multi-resolution" property is
(A) Fourier transform
(B) Short-time-Fourier transform
(C) Wavelet transform
(D) Karhunen-Loere transform
61. Which one is a collection of templates and rules ?
(A) XML
(B) CSS
(C) DHTML
(D) XSL
62. A program P calls two subprograms P1 and P2. P1 can fail 50% times and P2 40% times. Then P can fail
(A) 50%
(B) 60%
(C) 10%
(D) 70%
63. Third normal form is based on the concept of _____.
(A) Closure Dependency
(B) Transitive Dependency
(C) Normal Dependency
(D) Functional Dependency
64. If the Fourier transform of the function f(x, y) is F(m, n), then the Fourier transform of the function f(2x, 2y) is :
(A) 1/4 F(m/2 ,n/2)
(B) 1/4 F(2m ,2n)
(C) 1/4 F(m,n)
(D) 1/4 F(m/4 ,n/4)
65. ______ establishes information about when, why and by whom changes are made in a software.
(A) Software Configuration Management.
(B) Change Control.
(C) Version Control.
(D) An Audit Trail
66. Match the following with respect to HTML tags and usage.
a. CITE 1. Italic representation
b. EM 2. Represents output from programmes
c. VAR 3. Represents to other source
d. SAMP 4. Argument to a programme
Codes :
a b c d
(A) 3 1 4 2
(B) 2 3 1 4
(C) 4 2 3 1
(D) 1 3 4 1
67. An expert System shell is an expert system without
(A) domain knowledge
(B) explanation facility
(C) reasoning with knowledge
(D) all of the above
68. An example of a dictionary-based coding technique is
(A) Run-length coding
(B) Huffman coding
(C) Predictive coding
(D) LZW coding
69. Which is the method used to retrieve the current state of a check box ?
(A) get State ( )
(B) put State ( )
(C) retrieve State ( )
(D) write State ( )
70. Referential integrity is directly related to
(A) Relation key
(B) Foreign key
(C) Primary key
(D) Candidate key
71. You are given four images represented as
The value of entropy is maximum for image
(A) I1
(B) I2
(C) I3
(D) I4
72. A cryptarithmetic problem of the type
SEND
+ MORE
MONEY
Can be solved efficiently using
(A) depth first technique
(B) breadth first technique
(C) constraint satisfaction technique
(D) bidirectional technique
73. Match the following
a. Supervised learning 1. The decision system receives rewards for its action at the end of a
sequence of steps.
b. Unsupervised learning 2. Manual labels of inputs are not used.
c. Re-reinforcement learning 3. Manual labels of inputs are used.
d. Inductive learning 4. System learns by example
Codes :
a b c d
(A) 1 2 3 4
(B) 2 3 1 4
(C) 3 2 4 1
(D) 3 2 1 4
74. A* algorithm is guaranteed to find an optimal solution if
(A) h' is always 0.
(B) g is always 1.
(C) h' never overestimates h.
(D) h' never underestimates h.
75. Let θ(x, y, z) be the statement "x + y = z" and let there be two quantifications given as
Where x, y, z are real numbers, Then which one of the following is correct ?
(A) (i) is true and (ii) is true.
(B) (i) is true and (ii) is false.
(C) (i) is false and (ii) is true.
(D) (i) is false and (ii) is false.
IF YOU FIND ANY ANSWER WRONG, COMMENT ME, SO THAT I RIGHT THAT ANSWER.
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
38. Which is not the correct statement ?
(A) The class of regular sets is closed under homomorphisms.
(B) The class of regular sets is not closed under inverse homomorphisms.
(C) The class of regular sets is closed under quotient.
(D) The class of regular sets is closed under substitution.
39. When a programming Language has the capacity to produce new data type, it is called as,
(A) Overloaded Language
(B) Extensible Language
(C) Encapsulated Language
(D) Abstraction Language
40. Which of the following operating system is better for implementing client-server network ?
(A) Windows 95
(B) Windows 98
(C) Windows 2000
(D) All of these
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'
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 ?
(A) q ≤ t - ns / n - 1
(B) q ≥ t - ns / n - 1
(C) q ≤ t - ns / n + 1
(D) q ≥ t - ns / n + 1
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 :
(A) 1 / 1 - f - f/P
(B) P / P - f(P+1)
(C) 1 / 1 - f + f/P
(D) P / P + f(P-1)
50. Which of the following definitions generates the same Language as L,
where
51. Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure)
(A) O(n log logn)
(B) θ(n logn)
(C) Ω(n logn)
(D) Ω(n3/2)
52. Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping
int i;
program Main( )
{
i = 10;
call f ();
}
procedure f( )
{
int i = 20;
call g ( );
}
procedure g( )
{
print i;
}
Let x be the value printed under static scoping and y be the value printed under dynamic scoping. Then x and y are
(A) x = 10, y = 20
(B) x = 20, y = 10
(C) x = 20, y = 20
(D) x = 10, y = 10
53. If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater than i, then the word w is of length
(A) no greater than 2i+1
(B) no greater than 2i
(C) no greater than 2i-1
(D) no greater than i
54. The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system
(A) Class Model, Object Model and Analysis Model.
(B) Object Model, Dynamic Model, and Functional Model.
(C) Class Model, Dynamic Model and Functional Model.
(D) Object Model, Analysis Model and Dynamic Model.
55. The factors that determine the quality of a software system are
(A) correctness, reliability
(B) efficiency, usability, maintain-ability
(C) testability, portability, accuracy, error tolerances, expandability, access control, audit.
(D) All of the above
56. If a relation with a Schema R is decomposed into two relations R1 and R2 such that (R1∪R2) = R1 then which one of the following is to be satisfied for a lossless joint decomposition (—> indicates functional dependency)
(A) (R1 ∩ R2) —> R1 or R1∩ R2 —> R2
(B) R1∩ R2 —> R1
(C) R1∩ R2 —> R2
(D) R1 ∩ R2 —> R1 and R1∩ R2 —> R2
57. Given the following statements :
(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complementation.
Which is/are the correct statements ?
(A) only(i)
(B) only(ii)
(C) both (i) and (ii)
(D) neither (i) nor (ii)
58. Skolemization is the process of
(A) bringing all the quantifiers in the beginning of a formula in FDL.
(B) removing all the universal quantifiers.
(C) removing all the existential quantifiers.
(D) all of the above.
59. Which level of Abstraction describes how data are stored in the data base ?
(A) Physical level
(B) View level
(C) Abstraction level
(D) Logical level
60. The transform which possesses the "multi-resolution" property is
(A) Fourier transform
(B) Short-time-Fourier transform
(C) Wavelet transform
(D) Karhunen-Loere transform
61. Which one is a collection of templates and rules ?
(A) XML
(B) CSS
(C) DHTML
(D) XSL
62. A program P calls two subprograms P1 and P2. P1 can fail 50% times and P2 40% times. Then P can fail
(A) 50%
(B) 60%
(C) 10%
(D) 70%
63. Third normal form is based on the concept of _____.
(A) Closure Dependency
(B) Transitive Dependency
(C) Normal Dependency
(D) Functional Dependency
64. If the Fourier transform of the function f(x, y) is F(m, n), then the Fourier transform of the function f(2x, 2y) is :
(A) 1/4 F(m/2 ,n/2)
(B) 1/4 F(2m ,2n)
(C) 1/4 F(m,n)
(D) 1/4 F(m/4 ,n/4)
65. ______ establishes information about when, why and by whom changes are made in a software.
(A) Software Configuration Management.
(B) Change Control.
(C) Version Control.
(D) An Audit Trail
66. Match the following with respect to HTML tags and usage.
a. CITE 1. Italic representation
b. EM 2. Represents output from programmes
c. VAR 3. Represents to other source
d. SAMP 4. Argument to a programme
Codes :
a b c d
(A) 3 1 4 2
(B) 2 3 1 4
(C) 4 2 3 1
(D) 1 3 4 1
67. An expert System shell is an expert system without
(A) domain knowledge
(B) explanation facility
(C) reasoning with knowledge
(D) all of the above
68. An example of a dictionary-based coding technique is
(A) Run-length coding
(B) Huffman coding
(C) Predictive coding
(D) LZW coding
69. Which is the method used to retrieve the current state of a check box ?
(A) get State ( )
(B) put State ( )
(C) retrieve State ( )
(D) write State ( )
70. Referential integrity is directly related to
(A) Relation key
(B) Foreign key
(C) Primary key
(D) Candidate key
71. You are given four images represented as
The value of entropy is maximum for image
(A) I1
(B) I2
(C) I3
(D) I4
72. A cryptarithmetic problem of the type
SEND
+ MORE
MONEY
Can be solved efficiently using
(A) depth first technique
(B) breadth first technique
(C) constraint satisfaction technique
(D) bidirectional technique
73. Match the following
a. Supervised learning 1. The decision system receives rewards for its action at the end of a
sequence of steps.
b. Unsupervised learning 2. Manual labels of inputs are not used.
c. Re-reinforcement learning 3. Manual labels of inputs are used.
d. Inductive learning 4. System learns by example
Codes :
a b c d
(A) 1 2 3 4
(B) 2 3 1 4
(C) 3 2 4 1
(D) 3 2 1 4
74. A* algorithm is guaranteed to find an optimal solution if
(A) h' is always 0.
(B) g is always 1.
(C) h' never overestimates h.
(D) h' never underestimates h.
75. Let θ(x, y, z) be the statement "x + y = z" and let there be two quantifications given as
Where x, y, z are real numbers, Then which one of the following is correct ?
(A) (i) is true and (ii) is true.
(B) (i) is true and (ii) is false.
(C) (i) is false and (ii) is true.
(D) (i) is false and (ii) is false.
IF YOU FIND ANY ANSWER WRONG, COMMENT ME, SO THAT I RIGHT THAT ANSWER.
0 comments:
Post a Comment