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.

Wednesday, 9 May 2018

UGC NET Computer Science Paper III Re-test September 2013 - Part 3

21.       Assume statements S1 and S2 defined as :
S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively.
S2 : The set of all Turing machines is countable.
Which of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is correct.
Answer: B
22.       Non-deterministic pushdown automaton that accepts the language generated by the grammar: S→aSS | ab is
(A) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}
(B) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}
(C) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, S)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
(D) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}
Answer: B
23.       Match the following :
(a) Dangling pointer    (i) Buffer replacement policy
(b) Page fault               (ii) Variable-length records
(c) List representation (iii) Object identifier
(d) Toss-immediate      (iv) Pointer-swizzling
Codes :
      (a)   (b)  (c)  (d)
(A) (iii)  (iv)  (ii)   (i)
(B) (iv)  (iii)  (ii)   (i)
(C) (iv)  (iii)  (i)   (ii)
(D) (iii)  (iv)  (i)   (ii)
Answer: A
24.       .................. constraints ensure that a value that appears in one relation for a given set of attributes also appears for a certain set of attributes in another relation.
(A) Logical Integrity
(B) Referential Integrity
(C) Domain Integrity
(D) Data Integrity
Answer: B
25.       The SQL expression
Select distinct T, branch_name from branch T, branch S where T.assets>S.assets and S.branch_city=”Mumbai” finds the names of
(A) All branches that have greater assets than some branch located in Mumbai.
(B) All branches that have greater assets than all branches in Mumbai.
(C) The branch that has greatest asset in Mumbai.
(D) Any branch that has greater assets than any branch in Mumbai.
Answer: A

26.       Let A be the set of comfortable houses given as
Then the set of comfortable and affordable houses is
Answer: A
27.       Support of a fuzzy set
within a universal set X is given as
Answer: D
28.       In a single perceptron, the updation rule of weight vector is given by
(A) w(n + 1)=w(n)+η[d(n)-y(n)]
(B) w(n + 1)=w(n)–η[d(n)-y(n)]
(C) w(n + 1)=w(n)+η[d(n)-y(n)]* x (n)
(D) w(n + 1)=w(n)–η[d(n)-y(n)]* x (n)
Answer: C
29.       ................ refers to the discrepancy among a computed, observed or measured value and the true specified or theoretically correct values.
(A) Fault
(B) Failure
(C) Defect
(D) Error
Answer: D
30.    Which logic family dissipates the minimum power?
(A) DTL
(B) TTL
(C) ECL
(D) CMOS
Answer: D


No comments:

Post a Comment