  # ISRO Scientist or Engineer Computer Science 2007

Instructions

For the following questions answer them individually

Question 11

# 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? Question 12

# 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? Question 13

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

# The principal of locality of referencejustifies the use of Question 15

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

# 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 Question 17

# Round Robin scheduling is essentially the pre-emptive version of Question 18

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

# 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 Question 20

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