Operating Systems (COME3104)
Computer Engineering - COM
Semester: First Semester
Level: 300
Year: 2019
School: NAHPI Department: Computer Science
Course title: Operating Systems Code: COME3104
Semester: 1 Credit value: 3
Academic Year: 2018/2019
Time allowed: 1H3Omins
First Semester Exams
Instructions: Choose the letter corresponding to the best answer. Answer
ALL questions
I. What is an operating system?
a) collection of programs that manages hardware resources
b) system service provider to the application programs
c) link to interface the hardware and application programs
d) all of the mentioned
2. To access the services of operating system, the interface is provided by the:
a) System calls b) API c) Libraryd) Assembly instructions
3. Which one of the following is not true?
a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
c) kernel is made of various modules which cannot be loaded in running operating
system
d) kernel remains in the memory during the entire computer session
4. Which one of the following error will be handled by the operating system?
a) power failure
b) lack of paper in printer
c) connection failure in the network
d) all of the mentioned
5. The main function of the command interpreter is:
a) to get and execute the next user-specified command
b) to provide the interface between the API and application program
c) to handle the files in the operating system
d) none of the mentioned
6. What is the ready state of a process?
a) when a process is scheduled to run after some execution
b) when a process is unable to run until some task has been completed
c) when a process is using the CPU
d) none of the mentioned
7. A set of processes is in a deadlock if:
a) each process is blocked and will remain so forever
b) each process is terminated
www.schoolfaqs.net
c) all processes are trying to kill each other
d) none of the mentioned
8. Which of the following is not a valid deadlock prevention scheme?
a) Release all resources before requesting a new resource
b) Number the resources uniquely and never request a lower numbered resource
than the last one requested
c) Never request a resource after releasing any resource
d) Request and all required resources be allocated before execution.
9. Logical extension of multiprogramming operating system is:
a) Time Sharing b) multitasking c) single programming
d) both a and b
10. Example of open source operating, system is:
a) UNIX b) Linux c) Windows d) both a and b
11. Multiprogramming of a computer system increases:
a) memory b) storage c) CPU utilization d) cost of computation
12. An operating, system that manages a collection of independent computers such
that users are unaware of the multiplicity of machines:
a) Network operating system b) Distributed systemc) Multitasking system
d) None
13. While CPU is executing a program, an interrupt exists then it
a) follows the next instruction in the program
b) jumps to instruction in other registers
c) breaks the normal sequence of execution of instructions
d) stops executing the program
14. An interrupt breaks the execution of instructions and diverts its execution to
a) Interrupt Service Routine b) Counter word register c) Execution unit d)
Control unit
15. While executing the main program, if tea or more interrupts occur, then the
sequence of appearance of interrupts is called:
a) multi-interrupt b) nested interruptc) interrupt within interrupt d) none
16. The interrupt-request line is a part of the
a) Data line b) Control line c) Address line d) None of the mentioned
Consider the following diagram that shows the different process states. Use the
diagram to answer questions 17 to 20.
www.schoolfaqs.net
17.
A process in state (i) is in :
a) running state b) waiting state c) ready state d) new
state
18.
What event can move a process from state (iii) to state (ii)?
a) an interrupt has occurred b) the process has finished its time slicec) the process
has completed executiond) an input/output event has occurred
19.
What can cause a process to move from (iv) to (i)?
a) the occurrence of an I/O eventb) process has acquired its process control block
(PCB) c) an interrupt has occurred d) none
20.
A process initially at the waiting state and has performed an I, 0 operation
will move to state:
a) (i) b) (ii) c) (iii) d) (v)
21.
The change of state of a process from one form to another is known as:
a) context switching b) process scheduling c) context changed) interrupt handling
22.
Which module gives control of the CPU to the process selected by the
short-term scheduler?
a) dispatcher b) interruptc) scheduler d) none of the mentioned
23.
The processes that are residing in main memory and are ready and waiting to
execute are kept on a list called:
a) job queue b) ready queuec) execution queue d) process queue
24.
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
25.
Which scheduling algorithm allocates the CPU first to the process that
requests the CPU first?
a) first-come, first-served b) shortest job firstc) priority scheduling d)none
26.
In priority scheduling algorithm
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
www.schoolfaqs.net
d) 6 KB block then 14
d) 6 KB block then 14
c)
Equal priority processes cannot be scheduled
d)
None of the mentioned
27.
Time quantum is defined in:
a) shortest job firstb) round robin c) priority scheduling d) multilevel queue
scheduling
28.
Scheduling that takes place only when a running process terminates or blocks is
known as: a) round robin b) pre-emptive schedulingc) cooperative scheduling d)
none
29.
The amount of time a process can use the CPU in a single time is
known as: a) burst time b) waiting time c) turnaround time d)
none
30.
The part of a program where shared memory is accessed is known as :
a) mutual exclusion b) mutex c) critical section d) critical part
Consider the following table:
Process
Arrival Burst time
PO
0
15
P1
1
13
P2
2
P3
3
31.
The average waiting time if the processes were to be scheduled using first-come,
first-served algorithm is:
a) 10 b) 23 c) 5.5 d) 5.75
32.
The average waiting time if the processes were to be scheduled using round
robin algorithm, with a quantum of 3, is:
a) 34 b) 8.5 c)8 d)9.3
33.
The average waiting time if the processes were to be scheduled using shortest-job
first algorithm is:
a) 5.25 b) 21 c) 8.5 d)5.5
34.
The average waiting time if the processes were to be scheduled using shortest-
remaining time algorithm is:
a) 5.5 b)4 c)8.25 d)20
A process requests 12 KB of memory and the memory manager currently has a list of
unallocated blocks of 6 KB, 14 KB, 19 KB, 11 KB and 13 KB blocks (in that order). Use
this to answer questions 35 to 37.
35.
The best fit strategy will allocate this process in the:
a) 14 KB block b) 19 KB block c) 13 KB block
KB block
36.
The first fit strategy will allocate this
process in the: a) 14 KB block b) 19 KB block c) 13
KB block
KB block
www.schoolfaqs.net
37.
The worst fit strategy will allocate this process in the:
a) 14 KB block b) 19 KB block c) 13 KB block d) 6 KB block then 14
KB block
38.
Memory management technique in which main memory is divided into fixed size
chunks is called:
a) segmentation b)fragmentation c) mapping d)paging
39.
The portion-of secondary storage that is used by the operating system as a
logical extension of the main memory is known as:
a) physical memory b) virtual memory c) logical memory d) ROM
40.
Storing jobs in a buffer such that the CPU can be efficiently utilized is
called: a) spoolingb) buffering c) thrashing d) virtualising
www.schoolfaqs.net
www.schoolfaqs.net
