CYSE 211 Midterm Practice Exam Study Guide
2. ____ scheduling is approximated by predicting the next CPU burst with an
exponential average of the measured lengths of previous CPU bursts.
Multilevel queue
RR
FCFS
SJF - ANSWER SJF
3. The UNIX __________ command is used to list the contents of a directory.
a. ls
b. cat
c. cp
d. vi - ANSWER ls
4. Which of the following scheduling algorithms could result in starvation?
a. First-come, first-served
b. Shortest job first
c. Priority
d. b and c - ANSWER b. Shortest job first
c. Priority
5. What is a long-term scheduler ?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these - ANSWER a) It selects which process has to be brought into
the ready queue
6. The interval from the time of submission of a process to the time of completion
is termed as
a) waiting time
b) turnaround time
c) response time
d) throughput - ANSWER b) turnaround time
7. Response time is :
a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is
produced
c) the total time taken from submission time till the response is output
d) None of these - ANSWER b) the total time taken from the submission time till
the first response is produced
, 8. Memory management technique in which system stores and retrieves data
from secondary storage for use in main memory is called
a) fragmentation
b) paging
c) mapping
d) none of the mentioned - ANSWER b) paging
9. The aim of creating page replacement algorithms is to :
a) replace pages faster
b) increase the page fault rate
c) decrease the page fault rate
d) to allocate multiple pages to processes - ANSWER c) decrease the page fault
rate
10. Because of virtual memory, the memory can be shared among
a) processes
b) threads
c) instructions
d) none of the mentioned - ANSWER a) processes
11. Swap space exists in
a) primary memory
b) secondary memory
c) CPU
d) none of the mentioned - ANSWER b) secondary memory
12. Virtual memory allows :
a) execution of a process that may not be completely in memory
b) a program to be larger than the physical memory
c) a program to be larger than the secondary storage
d) execution of a process without being in physical memory - ANSWER a)
execution of a process that may not be completely in memory
b) a program to be larger than the physical memory
13. A page fault occurs when :
a) a page gives inconsistent data
b) a page cannot be accesses due to its absence from memory
c) a page is invisible
d) All of these - ANSWER b) a page cannot be accesses due to its absence from
memory
14. What is compaction?
a) a technique for overcoming internal fragmentation
b) a paging technique
c) a technique for overcoming external fragmentation
2. ____ scheduling is approximated by predicting the next CPU burst with an
exponential average of the measured lengths of previous CPU bursts.
Multilevel queue
RR
FCFS
SJF - ANSWER SJF
3. The UNIX __________ command is used to list the contents of a directory.
a. ls
b. cat
c. cp
d. vi - ANSWER ls
4. Which of the following scheduling algorithms could result in starvation?
a. First-come, first-served
b. Shortest job first
c. Priority
d. b and c - ANSWER b. Shortest job first
c. Priority
5. What is a long-term scheduler ?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of these - ANSWER a) It selects which process has to be brought into
the ready queue
6. The interval from the time of submission of a process to the time of completion
is termed as
a) waiting time
b) turnaround time
c) response time
d) throughput - ANSWER b) turnaround time
7. Response time is :
a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is
produced
c) the total time taken from submission time till the response is output
d) None of these - ANSWER b) the total time taken from the submission time till
the first response is produced
, 8. Memory management technique in which system stores and retrieves data
from secondary storage for use in main memory is called
a) fragmentation
b) paging
c) mapping
d) none of the mentioned - ANSWER b) paging
9. The aim of creating page replacement algorithms is to :
a) replace pages faster
b) increase the page fault rate
c) decrease the page fault rate
d) to allocate multiple pages to processes - ANSWER c) decrease the page fault
rate
10. Because of virtual memory, the memory can be shared among
a) processes
b) threads
c) instructions
d) none of the mentioned - ANSWER a) processes
11. Swap space exists in
a) primary memory
b) secondary memory
c) CPU
d) none of the mentioned - ANSWER b) secondary memory
12. Virtual memory allows :
a) execution of a process that may not be completely in memory
b) a program to be larger than the physical memory
c) a program to be larger than the secondary storage
d) execution of a process without being in physical memory - ANSWER a)
execution of a process that may not be completely in memory
b) a program to be larger than the physical memory
13. A page fault occurs when :
a) a page gives inconsistent data
b) a page cannot be accesses due to its absence from memory
c) a page is invisible
d) All of these - ANSWER b) a page cannot be accesses due to its absence from
memory
14. What is compaction?
a) a technique for overcoming internal fragmentation
b) a paging technique
c) a technique for overcoming external fragmentation