UGC NET Computer Science : June 2012 – Paper 3 (Solved Papers)admin
Given the following statements :
- The power of deterministic finite state machine and nondeterministic finite state machine are same.
- The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.
Neither (i) nor (ii)
Both (i) and (ii)
Let Q(x, y) denote “x + y = 0” and let there be two quantifications given as -
(ii) ∀x∃yQ(x, y)where x & y are real numbers. Then which of the following is valid ?
(i) is false & (ii) is true.
(i) is true & (ii) is false.
(i) is false & (ii) is also false.
both (i) & (ii) are true.
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
Lossless Join but not dependency preserving
Dependency preserving and lossless join
Dependency preserving but not lossless join
The quantiser in an image-compression system is a
lossless element which exploits the psychovisual redundancy
lossy element which exploits the psychovisual redundancy
lossless element which exploits the statistical redundancy
lossy element which exploits the statistical redundancy
Data Warehouse provides
None of the above
Demand and Supply Responsiveness
Storage, Functionality Responsiveness to queries