ISRO Scientist or Engineer Computer Science 2007

Consider a set of n tasks with known runtimes $$r_{1} r_{2}....... r_{n}$$, to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?

Consider a job scheduling problem with four jobs $$J_{1}, J_{2} J_{3}$$ and $$J_{4}$$, with corresponding deadlines : $$(d1_{1}, d_{2}, d_{3}, d_{4}) = (4, 2, 4, 2)$$

Which of the following is not a feasible schedule without violating any job deadline?

By using an eight bit optical encoder the degree of resolution that can be obtainedis (approximately)

The principal of locality of referencejustifies the use of

Consider the following psuedocode
x := 1;
i := 1;
while (x $$\leq$$ 1000)
begin
x := $$2^{x}$$;
i := i + 1;
end;
What is the value of i at the end of the pseudocode?

The five items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

Round Robin scheduling is essentially the pre-emptive version of

The number of digit 1 present in the binary representation of
$$3 \times 512 + 7 \times 64 + 5 \times 8 + 3$$ is

Assumethat each character code consists of 8 bits. The number of characters that can be transmitted per second through an synchronous Serial line at 2400 baud rate, and with two stop bits is

If the bandwidth of a signal is 5 kHz and the lowest frequencyis 52 kHz, what is the highest frequency