Gate CS-2019 Question Paper With Solutions

Q. 43 Consider the following sets:

  • S1: Set of all recursively enumerable languages over the alphabet {0, 1}.
  • S2: Set of all syntactically valid C programs.
  • S3: Set of all languages over the alphabet {0, 1}.
  • S4: Set of all non-regular languages over the alphabet {0, 1}.

Which of the above sets are uncountable?

(A) S1 and S2

(B) S3 and S4

(C) S1 and S4

(D) S2 and S3

Answer: (B)

Explanation:

Learn More:   Gate EC-2006 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here