Table of Content

UGC NET Computer Science : June 2012 – Paper 3 (Solved Papers)


Question 1
Given the following statements :
  1. The power of deterministic finite state machine and nondeterministic finite state machine are same.
  2. The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.
Which of the above is the correct statement(s) ?
A
Neither (i) nor (ii)
B
Only (ii)
C
Only (i)
D
Both (i) and (ii)
Question 2
Let Q(x, y) denote “x + y = 0” and let there be two quantifications given as -
(i)  ∃y∀xQ(x,y)
(ii) ∀x∃yQ(x, y)
where x & y are real numbers. Then which of the following is valid ?
A
(i) is true & (ii) is false.
B
(i) is false & (ii) is also false.
C
(i) is false & (ii) is true.
D
both (i) & (ii) are true.
Question 3
Consider a schema R(A, B, C, D) and functional dependencies A→B and C→D. Then the decomposition R1(A, B) and R2(C, D) is
A
Dependency preserving and lossless join
B
Lossless Join
C
Dependency preserving but not lossless join
D
Lossless Join but not dependency preserving
Question 4
The quantiser in an image-compression system is a
A
lossy element which exploits the statistical redundancy
B
lossless element which exploits the statistical redundancy
C
lossy element which exploits the psychovisual redundancy
D
lossless element which exploits the psychovisual redundancy
Question 5
Data Warehouse provides
A
Storage, Functionality Responsiveness to queries
B
None of the above
C
Demand and Supply Responsiveness
D
Transaction Responsiveness