UGC NET Computer Science : June 2012 - Paper 3 (Solved Papers)
Question 1 |
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.
Both (i) and (ii) | |
Only (i) | |
Neither (i) nor (ii) | |
Only (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 ?
(i) is false & (ii) is also false. | |
both (i) & (ii) are true. | |
(i) is false & (ii) is true. | |
(i) is true & (ii) is false. |
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
Lossless Join but not dependency preserving | |
Dependency preserving and lossless join | |
Lossless Join | |
Dependency preserving but not lossless join |
Question 4 |
The quantiser in an image-compression system is a
lossless element which exploits the statistical redundancy | |
lossless element which exploits the psychovisual redundancy | |
lossy element which exploits the statistical redundancy | |
lossy element which exploits the psychovisual redundancy |
Question 5 |
Data Warehouse provides
Transaction Responsiveness | |
None of the above | |
Storage, Functionality Responsiveness to queries | |
Demand and Supply Responsiveness |