Planning to take coaching on Unacademy
http://bit.ly/gate_unacademy
or
https://unacademy.com/
here is a code for 10% off PLUS1BPK1
Telegram Notification Group link:-
https://t.me/joinchat/X5egW_cvdt9kMGY1
Telegram discussion Group link:-
https://t.me/joinchat/VCyGUmVq8RNkMzhl
Downloads resources from here
https://education4fun.com/gate-cse/
MCQ (Single Correct Answer)
GATE CSE 2004
L1 is a recursively enumerable language over Σ. An algorithm A effectively enumerates its words as w1, w2, w3, … Define another language L2 over Σ Union {#} as {wi # wj : wi, wj ∈ L1, i LESS THAN j}. Here # is a new symbol. Consider the following assertions.
S1 : L1 is recursive implies L2 is recursive S2 : L2 is recursive implies L1 is recursive
Which of the following statements is true ?(A) Both S1 and S2 are true(B) S1 is true but S2 is not necessarily true(C) S2 is true but S1 is not necessarily true(D) Neither is necessarily true
