Back to Browse

GATE CSE 1996

136 views
Dec 28, 2021
2:25

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 1996 Which of the following statements is false? A) The halting problem for Turing machine is un-decidable B) Determining whether ambiguity a context free grammar is un-decidable C) Given two arbitrary context free grammars G1 and G2 whether L(G1)=L(G2) D Given two regular grammars G1 and G2, it is un-decidable whether L(G1)=L(G2)

Download

0 formats

No download links available.

GATE CSE 1996 | NatokHD