Follow Us :

Theory of Computation and Compilers - Run Time Analysis

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Theory of Computation and Compilers > > Run Time Analysis

26. To recover from an error, the operator precedence parser may

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


27. Reduction in strength means

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


28. Running time of a program depends on

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


29. If control signals {a,b,c,d,e,f,g} for some micro instructions and their corresponding MCCS (Maximum Compatibility Classes) are
[ad f* g, abd, beg, b deg}
then to determine minimal MCC cover, we need to remove

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


30. Assume that X and Y are non zero positive integers. What does the following Pascal program segment do?
while X Y do
if X > Y then
X : = X - Y
else
Y : = Y - X ;
write (X);

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
Run Time Analysis