M

Mr. Dubey • 52.38K Points
Coach 

Q. Any Language generated by an unrestricted grammar is:

(A) Recursive
(B) Recursively Enumerable
(C) Not Recursive
(D) None of the above

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Consider the code below, class class1{ public: void func1(); }; class class2 : protected class1 { }; Function func1 of class1 is ______ in class2

Q. Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion?

Q. Slow frequency hopping is

Q. Which of the following is a weak relationship between two objects?

Q. If the number of cycles spent busy – waiting is not excessive, then

Q. DVD technology uses an optical media to store the digital data. DVD is an acronym for

Q. Which of the following is true about averaging ensemble?

Q. The full adder adds the Kth bits of two numbers to the

Q. D-Alembert’s principle is used for which of the following?

Q. is a modular and cloud based platform.

Question analytics