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

Pages: Page 1, Page 2, Page 3, Page 4, Page 5, Page 6, Page 7, Page 8, Page 9, Page 10, Page 11, Page 12, Page 13, Page 14, Page 15