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

21. Given the following Pascal-like program segment
Procedure A,
x, y : integer ;
Procedure B;
 x, z : real ;
 S1
end B;
Procedure C;
 i : integer ;
 S2
end C
end A;
The variables accessible in S1 and S2 are

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 *


22. An intermediate code form is

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 *


23. Three address code involves

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 *


24. The best way to compare the different implementations of symbol table is to compare the time required to

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 *


25. Advantage of panic mode of error recovery is that

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