Home
Previous | Next

Pre-Test
1) What is the Process Input Queue?
a) A collection of processes.
b) A collection of processes on the disk that are waiting to be brought into memory for execution.
c) A collection of processes on the disk that have already executed.

2) What is Swapping?
a) The process of moving a process within memory to and from the backing store.
b) The process of moving a process within memory to backing store.
c) The process of moving a process to memory.

3) What does Contiguous Memory Allocation suffer from?
a) The Bird Flu.
b) External and/or Internal memory fragmentation.
c) Only External or Internal memory fragmentation.

4) What is one of the advantages of Paging?
a) Paper cuts.
b) It does not suffer from internal fragmentation.
c) It does not suffer from external fragmentation.

5) In what order is information processed in with Sequential Access?
a) Any order.
b) Sequential order.
c) Non-sequential order.

6) In what order is information processed in with Direct Access?
a) Any order.
b) Sequential order.
c) Non-sequential order.

7) Which one is not one of the Scheduling algorithms mentioned earlier.
a) First-Come First-Serve
b) Round Bear
c) Shortest Job First

8) Using the FCFS algorithm, which process is allocated the CPU first?
a) The process that requests the CPU first.
b) The process that requests the CPU last.
c) Processes are allocated the CPU randomly.

9) Using the SJF algorithm, which process is allocated the CPU first?
a) The process that requests the CPU first.
b) The process that requests the CPU last.
c) The process with the smallest CPU execution time.

10) The SJF algorithm is not fair for which type of job?
a) Small jobs.
b) Any size job.
c) Large jobs.
 
W3C Validation | XHTML | CSS