Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) A PC not connected to a network is equivalent to

(A) A Deterministic Finite-State Automaton,
(B) A Turing Machine,
(C) A Push-Down Automaton,
(D) None of the above.
Correct answer : Option (A) - A Deterministic Finite-State Automaton,

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. What is a Software?

Q. Consider a machine that costs $20,000 and has a five-year useful life.At the end of the five years, it can be sold for $4,000 after all tax adjustments have been factored in. If the firm could earn an after-tax revenue of $4,400 per year with this machine, should it be purchased at an interest rate of 10%? (All benefits and costs associated with the machine are accounted for in these figures.)

Q. It is a function of management which refers to the process of integrating the activities of different units of organization to achieve the organization goals. This is called

Q. If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

Q. ISO published the standard in __________

Q. The virtual memory bridges the size and speed gap between and

Q. SSTF algorithm, like SJF of some requests.

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

Q. Most of the digital computers do not have floating point hardware because

Q. To represent hierarchical relationship between elements, Which data structure is suitable?