1.

The request and release of

resources are ___.
a. interrupts 7. The mapping of a logical address to
b. command line statements a physical address is done in
c. system calls hardware by the ____.
d. special programs a. memory-management-unit
b. memory address register
2. The ____ model maps each c. relocation register
user-level thread to one kernel d. dynamic loading register
thread
a. two-level 8. With segmentation, a logical address
b. many-to-many consists of ___.
c. many-to-one a. segment name and offset
d. one-to-one b. segment table and segment
number
3. Hashed page tables are particularly c. segment number and offset
useful for processes with sparse d. segment number and page
address spaces number
a. True
b. False 9. ____ is the dynamic
storage-allocation algorithm which
4. ____ is used for exchanging data results in the smallest leftover hole
between multiple threads in one or in memory.
more processes or programs. a. Worst fit
a. inter-process communication b. Next fit
b. system calls c. Best fit
c. context switching d. First fit
d. message passing 10. A ____ uses an existing thread -
rather than creating a new one - to
5. The ____ binding scheme facilitates complete a task.
swapping. a. thread pool
a. execution time
b. assembly time 11. The compile time associates
c. interrupt time symbolic addresses with virtual
d. load time memory addresses during the
compilation phase of a program
6. Pthreads refers to ___. a. True
a. an implementation for thread b. False
behavior.
b. a specification for thread 12. A system is in a safe state only if
behavior. there exists a ____________
c. the POSIX standard. a. safe allocation
d. an API for process creation b. safe resource
and synchronization. c. safe sequence
 d. all of the mentioned 18. A thread is composed of a thread ID,
13. A problem encountered in program counter, register set, and
multitasking when a process is heap.
perpetually denied necessary a. True
resources is called ___. b. False
a. Deadlock 19. A deadlock is ___.
b. Starvation a. A condition where each
c. Race process is terminated and
d. Inversion started again
14. _______ is based on the use of one b. A condition where each
or both of two basic techniques: process is ready to be
segmentation and paging.
a. memory organization executed one by one
b. virtual memory c. A condition where each
c. real memory process is blocked except
d. memory partitioning the child process.
15. A relocation register is used to check d. A condition where each
for invalid memory addresses process is blocked and
generated by a CPU. waiting for others to release
a. True resources
b. False 20. Which of the following is/are true
16. Which of the following is not true about deadlock recovery?
with respect to deadlock prevention I. Abort all deadlock processes
and deadlock avoidance schemes? Il. Abort one process at a time until
a. In deadlock avoidance, the the deadlock cycle is eliminated
request for resources is Ill. The Banker's algorithm will help
always granted, if the in recovery
resulting state is safe IV. Rollback - return to some safe
b. In deadlock prevention, the state, restart process for that state
request for resources is a. III
always granted if the b. I, II, IV
resulting state is safe. c. I, II, and IV
c. Deadlock prevention is more d. I, II, and III
restrictive than deadlock 21. The most common technique for
avoidance. writing multithreaded Java programs
d. Deadlock avoidance requires is _
knowledge of resource a. extending the Thread class
requirements a priori and overriding the run()
17. Main memory divided into a number method
of static partitions at system b. implementing the Runnable
generation time is ___. interface and defining its run
a. Paging method
b. Dynamic partitioning c. designing your own Thread
c. Fixed partitioning class
d. segmentation
 d. using the Create Thread() 28. For Mutual exclusion to prevail in the
function system ___.
22. It is based on the use of one or both a. the processor must be a
of two basic techniques: uniprocessor rather than a
segmentation and paging. multiprocessor
a. Memory organization b. all of the choices
b. Real memory c. there must be at least one
c. Virtual memory resource in a sharable mode
d. Memory partitioning d. at least one resource must
23. Which of the following is true of be held in a non-sharable
compaction? mode
a. It can be done at assembly,
load, or execution time. 29. The _ model allows a user-level
b. It cannot shuffle memory thread to be bound to one kernel
contents. thread.
c. It is used to solve the a. Two-level
problem of internal b. one to one
fragmentation c. many to one
d. It is possible only if relocation d. many to many
is dynamic and done at 30. If deadlocks occur frequently, the
execution time. detection algorithm must be invoked
frequently
24. Fragmentation does not occur in a
a. True
paging system.
b. False
a. True
31. an aide to determine the deadlock
b. False
occurrence is _____
25. It is responsible for translating these
a. Process allocation graph
symbolic addresses into actual b. Inversion graph
memory addresses that can be c. Resource allocation graph
understood and accessed by the d. Starvation graph
hardware. 32. An address generated by a CPU is
- Address Binding referred to as a ______
26. A provides an API for creating and a. logical address
managing threads. b. Memory-Management UNIT
a. set of system calls (MMU) generated address
b. multithreading model c. physical address
c. thread library d. post relocation register
d. multicore system address
27. is a formula that identifies potential 33. One technique for overcoming
performance gains from adding external fragmentation is _____.
additional computing cores to an a. Partitioning
application that has a parallel and b. Relocation
serial component. c. Loading
a. Amdahl’s Law d. Compaction
34. For non sharable resources like a d. the system can allocate
printer, mutual exclusion _____ resources to each process in
a. Must not exist some order and still avoid a
b. May exist deadlock
c. Must exist
d. None of the choices
35. Each thread has its own register set
and stack
a. True
b. False
36. The exec() system calls create new
process.
a. True
b. False
37. The chunks of a process are known
as
a. Address
b. Segments
c. Pages
d. Frames
38. Hierarchical page tables are
appropriate for 64-bit architectures.
a. T
b. False
39. is the dynamic storage-allocation
algorithm which results in the largest
leftover hole in memory
a. Worst fit
b. Next fit
c. First fit
d. Best fit
40. A thread shares with its peer threads
a few information like code segment,
data segment, and open files. When
one thread alters a code segment
memory item. all other threads are
blocked to see the changes.
a. True
b. False
41. A system is in a safe state if _____
a. None of the choices
b. There exist a safe sequence
c. It uses deadlock
OS 5. Which of the following statements
is correct?
1. ____ is the ability to execute
independent tasks of a program in ● Operating systems must provide
the same instant of time both command line as well as
● parallelism graphical user interface

2. The two separate modes of 6. A process that has terminated, but

operating in a system are whose parent has not yet called wait(), is
known as a _____ process
● User mode and kernel mode
● zombie

3. A process control block

● Includes information on the process 7. The list of processes waiting for a

state particular 1/O device is called a(n)

● device queue

a. Which of the following statements

is true?

● Shared memory is typically faster 8. involves distributing tasks across

than message passing. multiple computing cores.

● task parallelism

4. provide(s) an interface to the

services provided by an operating system.
9. After being allotted the CPU for
● System calls execution, a process passes from the ready
state to the
 ● run state 14. What identifies the Process Control
Block?

● Process identifier

10. The global as well as static

variables are included in this section.

● data 15. A process that allows one process

to use the CPU while the execution of
another process is on hold due to the
unavailability of any resource like I/O etc. is
known as

11. A ___ saves the state of the ● CPU Scheduling

currently running process and restores the
state of the next process to run.

● context switch

16. A process must go through a

minimum of____states to be considered
complete.

● four

12. How many process can run at a

time on a single CPU?

● 1
17. This is the memory that is
dynamically allocated to a process during its
execution.

● Heap
13. If a process with a higher priority
needs to be executed while the main
memory is full, the process goes from the
wait state to the …

● suspend wait state 18. A program can be segregated into

four pieces when put into memory to
become a process: stack, heap, data, and
text
 ● True

23. The most common secondary

storage device is

● magnetic disk
19. A system call is triggered by
hardware.

● False

24. This comprises the contents

present in the processor's registers and the
20. Task parallelism distributes threads current activity reflected by the value of the
and data across multiple computing cores program counter.

● False ● text

21. For a single-processor system,

there will never be more than one process 25. It is a toolkit for creating efficient
in the Running state. kernel tracing and manipulation programs,
and includes several useful tools and
● True examples.

● BFP Compiler Collection

22. When multiple resources are

allocated to different processes in
multiprogramming, the OS keeps track of 26. It is a temporary storage location
which user or process has how many that is used to hold data that is being
resources and of which kind. tranferred between two devices or between
two processes
● True
 ● Buffer

27. are used by many modern

operating systems to divide a
monolithic-style kernel into more
manageable components.

● modules

28. This memory is dynamically

allocated to a process during its execution.

● heap

29. are addresses that inform the

interrupt handler as to where to find the ISR
that manage multiple interrupts in
microprocessors.

● interrupt vectors