The head of a moving head disk with $$100$$ tracks numbered $$0$$ to $$99$$ is currently serving a request at tract $$55.$$ If the queue of requests kept in $$FIFO$$ order is $$10, 70, 75, 23, 65$$ Which of the two disk scheduling algorithms $$FCFS$$ (First Come First Served) and $$SSTF$$ (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.

What are x and y in the following macro definition?

macro Add x,y
Load y
Mul x
Store y
end macro

What is the value of X printed by the following program?

program COMPUTE (input, output);
var
    X:integer;
procedure FIND (X:real);
    begin
    X:=sqrt(X);
    end;
begin
   X:=2
   Find(X)
   Writeln(X)
end

A finite state machine with the following state table has a single input $$X$$ and a single out $$Z$$.

If the initial state is unknown, then the shortest input sequence to reach the final state $$C$$ is here, since initial make unknown $$m$$ $$10$$ input we can each final state $$C$$ with shortest path.