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
