Which of the following disk scheduling strategies is likely to give the best throughput?

Given the programming constructs:

(i) assignment
(ii) for loops where the loop parameter cannot be changed within the loop
(iii) if-then-else
(iv) forward go to
(v) arbitrary go to
(vi) non-recursive procedure call
(vii) recursive procedure/function call
(viii) repeat loop,

which constructs will you not include in a programming language such that it should be possible to program the terminates (i.e., halting) function in the same programming language.

Consider the following program in a language that has dynamic scooping:

var x: real;
procedure show;
         begin print(x); end;
procedure small;
         var x: real;
             begin x: = 0.125; show; end;
begin x:=0.25;
         show; small
         end;

Then the output of the program is:

A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor?