Polytechnic University of the Philippines

COLLEGE OF COMPUTER AND INFORMATION SCIENCES

Sta. Mesa, Manila

COMP 20103 - OPERATING SYSTEMS

Quiz

Multiple Choice. Choose the best answer and write the corresponding letter of your
choice on the Answer Sheet / Test Booklet provided.

For items 1-8, analyze the statements given and choose which of the choices below best
Item number

fit the given statements:

Answer

A. 1st and 2nd statements are true.

B. 1st and 2nd statements are false.
C. 1st statement is true and the 2nd statement is false.
D. 1st statement is false and the 2nd statement is true.

_C_ 1. An operating system is a program that manages the computer hardware. It acts as an
intermediary between the computer user and the hardware.

_D_ 2. Some operating systems are designed for convenience, others to be efficient. But
definitely, it is either for convenience, efficiency or both.

_A_ 3. The computer when booted loads the bootstrap program. The bootstrap program is
typically stored in the ROM.

_C_ 4. The register and the primary memory, along with the cache memory, are the only storage
devices which the processor can directly access. The register is found in the main
memory while the cache is between the CPU and main memory.

_B_ 5. Time sharing is a logical extension of multiprogramming. It requires direct

communication between the user and the system.

_A_ 6. Users interface with the operating system using command line interface and GUI.
Command line interface uses mouse-based window-and-menu system as interface.

_A_ 7. In multitasking environment, the operating system coordinates access to shared

resources by many processes while ensuring that each process receives the resources it
needs. The resource allocation function requires extensive recordkeeping and complex
procedures to make allocation decisions.

_C_ 8. The software maybe categorized as either application software or systems software. The
former are programs or instructions developed to handle the performance and control of
the hardware while the latter are programs written to facilitate the work of the user.

_D_ 9. The mechanism that ensures that a process can execute only within its own address
space.
A. Dual mode of operation C. Privileged instructions E. None of these
B. Timer D. Base and Limit Register

_B_ 10. The protection mechanism used to ensure that operating system maintains control over
the CPU.
A. Dual mode of operation C. Privileged instructions E. None of these
B. Timer D. Base and Limit Register

_A_ 11. What is the instruction used to move data from main memory to CPU register?
A. Load C. Run E. Execute
B. Store D. Accept

_B_ 12. The command instruction to transfer from the CPU register to the main memory.
A. Load C. Run E. Execute
B. Store D. Accept

1
_B_ 13. The user’s interface to the operating system is sometimes called:
A. Kernel C. Service Layer E. JCL
B. Shell D. Interrupt

_C_ 14. The type of scheduler used to determine which ready process will be assigned the CPU
when it next becomes available.
A. Long term scheduler C. Dispatcher E. None of these
B. Short term scheduler D. Medium term scheduler

_D_ 15. The scheduler that swaps out processes out of and back into the primary memory.
A. Long term scheduler C. Dispatcher E. None of these
B. Short term scheduler D. Medium term scheduler

_A_ 16. The scheduler that controls the degree of multiprogramming is:
A. Long term scheduler C. Dispatcher E. None of these
B. Short term scheduler D. Medium term scheduler

_C_ 17. Criteria used in determining the best CPU Scheduling Algorithm.
A. ↑ CPU Utilization, ↑ throughput, ↑ turn-around time, ↑ waiting time
B. ↓CPU Utilization, ↓ throughput, ↓ turn-around time, ↓ waiting time
C. ↑ CPU Utilization, ↑ throughput, ↓ turn-around time, ↓ waiting time
D. ↑ CPU Utilization, ↓ throughput, ↑ turn-around time, ↓ waiting time
E. ↑ CPU Utilization, ↓ throughput, ↓ turn-around time, ↑ waiting time

_A_ 18. The number of processes completed per time unit is called:
A. Throughput C. Waiting time E. Response time
B. Turn-around time D. CPU Utilization

_B_ 19. Each process may be in one of the following states:

A. New, ready, active, halted, or waiting D. A and C are correct
B. New, ready, running, waiting or halted E. B and C are correct
C. New, active, waiting or halted

_A_ 20. A term which refers to a subset of a process which can be executed independently of the
other parts of the process.
A. Thread C. Mini process E. None of these
B. Lightweight process D. A, B, or C

21. – 31. CPU Scheduling

Process Arrival Time Burst Time Priority (1- Highest)
J1 0 5 4
J2 7 10 2
J3 23 6 3
J4 2 11 5
J5 14 7 1
Time slice = 3 ms

_B_ 21. The CPU processing sequence for FCFS scheduling algorithm is:
A. J1, J4, J5, J2, J3 C. J1, J4, J5, J3, J2 E. None of these
B. J1, J4, J2, J5, J3 D. J1, J4, J2, J5, J2, J3, J4

_C_ 22. The CPU processing sequence for SJF scheduling algorithm is:
A. J1, J4, J5, J2, J3 C. J1, J4, J5, J3, J2 E. None of these
B. J1, J4, J2, J5, J3 D. J1, J4, J2, J5, J2, J3, J4

_C_ 23. The CPU processing sequence for SRTF scheduling algorithm is:
A. J1, J4, J5, J2, J3 C. J1, J4, J5, J3, J2 E. None of these
B. J1, J4, J2, J5, J3 D. J1, J4, J2, J5, J2, J3, J4

_E_ 24. The CPU processing sequence for NON PREEMPTIVE PRIORITY algorithm is:
A. J1, J4, J5, J2, J3 C. J1, J4, J5, J3, J2 E. None of these
B. J1, J4, J2, J5, J3 D. J1, J4, J2, J5, J2, J3, J4

2
_D_ 25. The CPU processing sequence for PREEMPTIVE PRIORITY scheduling algorithm is:
A. J1, J4, J5, J2, J3 C. J1, J4, J5, J3, J2 E. None of these
B. J1, J4, J2, J5, J3 D. J1, J4, J2, J5, J2, J3, J4

_E_ 26. The CPU processing sequence for Round Robin with q = 3 ms is:
A. J1, J4, J5, J2, J3 C. J1, J4, J5, J3, J2 E. None of these
B. J1, J4, J2, J5, J3 D. J1, J4, J2, J5, J2, J3, J4

_B_ 27. The average turn-around time using Preemptive priority is:
A. 19.8 C. 14 E. None of these
B. 14.6 D. 13.2

_B_ 28. The average waiting time using Preemptive priority is:
A. 12 C. 6.2 E. None of these
B. 6.8 D. 5.4

_A_ 29. What is the turn-around time of J2 using SRTF?

A. 32 C. 19 E. None of these
B. 26 D. 17

_D_ 30. What is the waiting time of J2 using SRTF?

A. 7 C. 16 E. None of these
B. 9 D. 22

_A_ 31. What is the end time using Round Robin with Overhead if q = 3 and O=1?
A. 39 C. 53 E. None of these
B. 52 D. 54

32. – 34. Multi-Level Queues.

Job AT BT Priority Level Level Priority Algo
A 0 5 5 L1 L0 High SJF
B 3 10 2 L0 L1 Low NPP
C 10 6 3 L1
D 2 11 2 L0
E 14 7 1 L1

_B_ 32. What job will process first?

A. A C. C E. E
B. B D. D

_A_ 33. What job will be the last to process?

A. A C. C E. E
B. B D. D

_E_ 34. What will be the Gantt Chart?

A. ADBCE C. ABCDE E. None of these
B. ABDEC D. DBACE

35. – 37. Multi-Level Feedback Queues

Job AT BT Priority Levels Level Algo
A 0 5 5 L0 First RR q=2
B 3 10 2 L1 Second RR q=3
C 10 6 3 L2 Third NPP
D 2 11 2
E 14 7 1

_C_ 35. What job will be the last to finish?

A. A C. C E. E
B. B D. D

3
_A_ 36. What job will get out at the second level?
A. A C. C E. E
B. B D. D

_D_ 37. At what time will the job referred to in #36 get out of the CPU ?
A. 5 C. 10 E. None of these
B. 9 D. 13

_A_ 38. What is the % CPU Utilization of the above problem?

A. 100 % C. 82 % E. None of these
B. 85 % D. 70 %

_B_ 39. SJF is a special case of:

A. FCFS C. Round Robin E. None of these
B. Priority D. SRTF

_B_ 40. A phenomenon in priority algorithm which prohibits a low priority job from execution as a
result of a steady stream of higher priority jobs is known as:
A. Aging C. Deadlock E. Graceful Degradation
B. Starvation D. Convoy Effect

_D_ 41. A CPU scheduling scheme wherein a job can only leave the processor after its entire
burst has been totally consumed and is ready to be terminated.
A. Cooperating C. Ready E. None of these
B. Preemptive D. Non Preemptive

_C_ 42. The concept of having four processors fused into one computer chip is called:
A. Core-Duo C. Quad-core E. Hexa-core
B. Dual Core D. Multiprocessor

_E_ 43. A type of operating systems where jobs are processed serially without user interaction
and used job control cards.
A. Parallel OS C. Network OS E. Batch OS
B. Embedded OS D. Single User OS

_A_ 44. An OS which manages systems containing hundreds or even thousands of processors.
A. Parallel OS C. Network OS E. Batch OS
B. Embedded OS D. Single User OS

_D_ 45. Component of OS responsible for backup and recovery of files.

A. Shell C. Process Manager E. Security Manager
B. Memory Manager D. File Manager

_C_ 46. Type of storage technology where data are stored by using lands and pits.
A. Magnetic Storage C. Optical Storage E. Mass Storage
B. Paper Storage D. Solid State Storage

_A_ 47. Time it takes to move the read/write head to the target track.
A. Seek Time C. Transfer Time E. Search Time
B. Latency Time D. Access Time

_E_ 48. Storage technology which is ideal for storing data on mobile devices and transporting
data from one device to another.
A. Magnetic Storage C. Optical Storage E. Mass Storage
B. Paper Storage D. Solid State Storage

_A_ 49. Which is not an example of an inboard memory?

A. Electronic Disk C. Cache E. Main Memory
B. RAM D. Register

_A_ 50. Which is not a volatile storage?

A. Electronic Disk C. Cache E. Main Memory
B. RAM D. Register

4
 51. - 60. Disk Scheduling
A 50 track disk has the following pending requests:
16 23 38 5 40 19
The read/write head is currently positioned at track 18, previous position was at track 10.

_I_ 51. What is the total distance that the disk arm moves to satisfy all the pending requests
using First Come First Serve (FCFS):
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

_G_ 52. What is the total distance that the disk arm moves to satisfy all the pending requests
using Shortest Seek Time First (SSTF):
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

_J_ 53. What is the total distance that the disk arm moves to satisfy all the pending requests
using SCAN:
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

_E_ 54. What is the total distance that the disk arm moves to satisfy all the pending requests
using LOOK:
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

_D_ 55. What is the total distance that the disk arm moves to satisfy all the pending requests
using C-Scan assuming that α = 0:
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

_A_ 56. What is the total distance that the disk arm moves to satisfy all the pending requests
using C-Look assuming that α = 0:
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

_E_ 57. What is the best algorithm to use based on the problem?
A. FCFS B. SSTF C. SCAN D. LOOK
E. C-LOOK F. C-SCAN

_J_ 58. Assuming that the movement of the read/write head is contrary to the given direction,
what is the total distance travelled to satisfy all the pending requests using Scan?
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

_D_ 59. Assuming that the movement of the read/write head is contrary to the given direction,
what is the total distance travelled to satisfy all the pending requests using C-Scan?
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

_A_ 60. Assuming that the movement of the read/write head is contrary to the given direction,
what is the total distance travelled to satisfy all the pending requests using C-Look?
A. 33 B. 34 C. 47 D. 48 E. 57
F. 58 G. 63 H. 75 I. 113 J. None of these

GOOD LUCK!