1. Pre-emptive scheduling is the strategy of temporarily suspending a running process

before the CPU time slice expires

to allow starving processes to run

when it requests I/O

none of these

2. In Round Robin CPU scheduling, as the time quantum is increased, the average turn around time

increases

decreases

remains constant

varies irregularly

3. Which of the following refers to the associative memory?

Address of the data is generated by the CPU

Address of the data is supplied by the users.

There is no need for an address ie the data is used as an address

Data are accessed sequentially

4. Consider a logical address space of 8 pages of 1024 words mapped into memory of 32 frames. How many bits are there in the physical address?

9 bits

11 bits

13 bits

15 bits

5. Consider a logical address space of 8 pages of 1024 words mapped into memory of 32 frames. How many bits are there in the logical address?

9 bits

11 bits

13 bits

15 bits

6. Consider a computer with 8 Mbytes of main memory and a 128 K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block ?

2048

256

64

None of these

7. The first-fit, best-fit and the worst-fit algorithm can be used for

contiguous allocation of memory

linked allocation of memory

indexed allocation of memory

all of these

8. If there are 32 segments, each of size 1 K byte, then the logical address should have

13 bits

14 bits

15 bits

16 bit

9. Dirty bit is used to show the

page with corrupted data

the wrong page in the memory

page that is modified after being loaded into cache memory

page that is less frequently accessed

10. In real-time operating systems, which of the following is the most suitable scheduling scheme?

round-robin

first-come-first-served

preemptive

random scheduling