A PC not connected to a network is equivalent to

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.32K 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

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. MBO offers the basis for assessing the -----------------

Q. Models help us to________ a system as it is or the way it is wanteD.

Q. Which function is used to read all the characters?

Q. 2 REQUIREMENT ENGINEERING PROCESS: FEASIBILITY STUDIES,

Q. Which of the following statements are TRUE? (1) The problem of determining whether there exists a cycle in an undirected graph is in P. (2) The problem of determining whether there exists a cycle in an undirected graph is in NP. (3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

Q. ……………….. are assumptions about future.

Q. To improve the performance of a business process, which of the following is most relevant?

Q. Programmers make mistakes during coding. These mistakes are known as

Q. The system acctcom accounting program