- Tutorials
- Courses
- Tracks
ISRO CS 2007
Question 1
A task in a blocked state
is executable
is running
must still be placed in the run queues
is waiting for some temporarily unavailable resources
Question 2
Round Robin schedule is essentially the pre-emptive version of
FIFO
Shortest job first
Shortest remaining time
Longest remaining time
Question 3
What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them?
Partitioning
Multi-tasking
Windowing
Paging
Question 4
Consider a set of n tasks with known runtimes r1, r2....rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?
Round Robin
Shortest job first
Highest response ratio next
first come first served
Question 5
Feedback queues
are very simple to implement
dispatch tasks according to execution characteristics
are used to favour real time tasks
require manual intervention to implement properly
Question 6
On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wait time?
5, 12, 9, 18
5, 9, 12, 18
12, 18, 9, 5
9, 12, 18, 5
Question 7
Bit stuffing refers to
inserting a 0 in user stream to differentiate it with a flag
inserting a 0 in flag stream to avoid ambiguity
appending a nipple to the flag sequence
appending a nipple to the use data stream
Question 8
Assume that 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
109
216
300
219
Question 10
An Ethernet hub
functions as a repeater
connects to a digital PBX
connects to a token-ring network
functions as a gateway
There are 80 questions to complete.