Learn with Anil · TGPSC HMWSSB Manager (Engineering) PYQsPractise online →Subscribe ₹149

TGPSC HMWSSB Manager 2015 Paper 2 CSE · Question 69

Question 69 of the TSPSC Manager (Engineering), HMWSSB, 2015: Paper 2 (Computer Science & Information Technology) (1 November 2015). Try it first, then open the answer. The explanation is in the practice app with the All-in-One Pass.

  1. Manager 2015 Paper 2 (CS & IT) · Q69 · Theory of Computation & Compilers · Context-Free Languages & Turing Machines

    Which of the following statements is incorrect?

    1. Every recursively enumerable language is recursive
    2. The union of two recursively enumerable languages is recursively enumerable
    3. The union of two recursive languages is recursive enumerable language
    4. If the language L and it's complement L' are recursively enumerable then L is recursive
    Show answer

    Answer: (1) Every recursively enumerable language is recursive

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

Answer it in the practice appMake a topic-wise quiz