M

Mr. Dubey • 52.30K Points
Coach 

Q. The set which is not countable if we have ∑ = {a, b}, is

(A) Set of all languages over ∑ accepted by turing machine
(B) Set of all regular languages over ∑
(C) Set of all strings over ∑
(D) Set of all languages over ∑
Correct : Option (D)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. --------------indicates the exact manner in which the integrated serious of activities will

Q. The number of symbols necessary to simulate a Turing machine with m symbols and n states

Q. The task environment of organizations consists of constituencies that have a direct impact on managers’ decisions and actions The main constitue

Q. If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order b

Q. In Membership function graph x-axis represent?

Q. EPROM uses an array of

Q. What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?

Q. How many types of the data type are there in the ring counter?

Q. How many lines are there in an NTSC signal?

Q. At what organisational level is it necessary to balance strategic actions with environmental and resource conditions?