Suppose we have a simple computer with control unit holding a PC with – McqOptions

MCQOPTIONS

1.	Suppose we have a simple computer with control unit holding a PC with a 32 bit address + Arithmetic unit holding one double length 64 bit Arithmetic Register. The number of states the finite machine will hold:
A.	2<sup>(32*64)</sup>
B.	2<sup>96</sup>
C.	96
D.	32
Answer» C. 96

Discussion

No Comment Found

Related MCQs

According to Chomsky hierarchy, which of the following is adopted by Recursively Ennumerable language?
Which of the following is/are not true for recursively ennumerable language?
State true or false:Statement: Two track turing machine is equivalent to a standard turing machine.
Statement 1: Multitrack Turing machine.Statement 2: Gamma is Cartesian product of a finite number of finite sets.Which among the following is the correct option?
State true or false:Statement: We can use the finite control of turing machine to hold a finite amount of data.
In one move a turing machine will:
WHICH_OF_THE_FOLLOWING_IS/ARE_NOT_TRUE_FOR_RECURSIVELY_ENNUMERABLE_LANGUAGE??$
According_to_Chomsky_hierarchy,_which_of_the_following_is_adopted_by_Recursively_Ennumerable_language?$
A multi track turing machine can described as a 6-tuple (Q, X, S, d, q0, F) where X represents:
Statement 1: Multitrack Turing machine.