UGC NET JULY 2018 (Computer Science And Applications Paper-II) (Question 37-40)

UGC NET JULY 2018 (Computer Science And Applications Paper-II) (Question 37-40)

Q 37. Context sensitive language can be recognized by a :

(1) Finite state machine

(2) Deterministic finite automata

(3) Non-deterministic finite automata

(4) Linear bounded automata

Answer:  (4) Linear bounded automata

Q 38. The set A={ 0ⁿ 1ⁿ 2ⁿ | n=1, 2, 3, ……… } is an example of a grammar that is :

(1) Context sensitive

(2) Context free

(3) Regular

(4) None of the above

 

Answer:  (1) Context sensitive

Q 39. A bottom-up parser generates :

(1) Left-most derivation in reverse

(2) Right-most derivation in reverse

(3) Left-most derivation

(4) Right-most derivation

 

Answer:  (2) Right-most derivation in reverse

Q 40. Consider the following statements( ) :

S1 : There exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same language.

S2 : The problem of determining whether a Turing machine halts on any input is undecidable.

Which of the following options is correct ?

(1) Both S1 and S2 are correct

(2) Both S1 and S2 are not correct

(3) Only S1 is correct

(4) Only S2 is correct

 

Answer:  (1) Both S1 and S2 are correct