Sunday 28 February 2016

UGC NET G.K. AND TEACHING MODEL SOLVED PAPER 1

UGC NET G.K. AND TEACHING MODEL SOLVED PAPER 1

1. Which of the following statement/s is/are correct.
1. The directive principles are meant to establish Political Democracy.
2. The directive principles are meant to establish Social Democracy.
3. The directive principles are meant to establish Economic Democracy.
(a) 1 only. (b) 2 & 3 only. (c) 1 & 3 only. (d) 1, 2 & 3.
Ans.: b

2. Which of the following statement/s is/are correct.
1. Fundamental Rights enjoy legal supremacy over Directive principles.
2. The parliament can amend the Fundamental Rights for implementing the directive principles.
(a) 1 only. (b) 2 only. (c) Both. (d) None
Ans.: c

3. OHP means ______.
(a) On Head Projector
(b) On Hand Projection
(c) Over Head Projector
(d) Over Hand Projection
Ans.:c

Wednesday 17 February 2016

UGC NET COMPUTER SCIENCE SOLVED PAPER SET-2

UGC NET COMPUTER SCIENCE SOLVED PAPER SET-2

21. Find the suitable match for the following:
List – I List – II
A. DDL i. Rename
B. DML ii. Select
C. BASIC Operation iii. Set Difference
D. BINARY Operation iv. Drop
(a) A- ii, B-I, C- iii, D- iv (b) A- I, B- ii, C- iv, D- iii
(c) A-iv, B- ii, C- iii, D- i (d) A- iv, B- ii, C- i, D- iii
Ans.:d

22. Specialization Lattice stands for
(a) An entity type can participate as a subclass in only one specialization.
(b) An entity type can participate as a subclass in more than one specialization.
(c) An entity type that can participate in one specialization.
(d) An entity type that can participate in one generalization.
Ans.:b

23. Overlay is
(a) a part of an operating system
(b) a specific memory location
(c) a single contiguous memory that was used in the olden days for running large programs byswapping.
(d) overloading the system with many user files.
Ans.:c

Sunday 7 February 2016

UGC NET COMPUTER SCIENCE SOLVED MODEL PAPER SET-1

UGC NET COMPUTER SCIENCE SOLVED MODEL PAPER SET -1

1. Which of the following statements is false?
(a) Every NFA can be converted to an equivalent DFA
(b) Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine.
(c) Every regular language is also a context-free language
(d) Every subset of recursively enumerable set is recursive.
Ans.: d

2. Task of the lexical analysis
(a) To parse the source program into the basic elements or tokens of the language
(b) To build a literal table and an identifier table
(c) To build a uniform symbol table
(d) All of these
Ans.:d

3. Which of the following is not correct?
(a) feasible solution of an LPP is independent of the objective function
(b) the feasible region of an LPP must be a convex set
(c) the feasible region for a constraint is restricted if its ‘’ or ‘’ sign is replaced by a ‘=’ sign.
(d) it is not possible to obtain feasible solution of an LPP by graphical method.
Ans.:d