NOUN E-Exam: CIT211 - Introduction to Operating Systems, Past Questions

Use Past Questions to see how examiner asked questions in the past
Adele
Posts: 522
Joined: Mon Nov 06, 2017 3:24 pm
Contact:

NOUN E-Exam: CIT211 - Introduction to Operating Systems, Past Questions

Postby Adele » Sat Jul 21, 2018 3:28 pm

NOUN E-Exam: CIT211 - Introduction to Operating Systems, Past Questions



DISCLAIMER: THIS PACKAGE IS PREPARED FOR EXAM REVISION AND PREPARATIONS ONLY, NOT TO BE TAKEN INTO THE EXAM HALL FOR MALPRACTICES

Stay informed when you download our app
https://play.google.com/store/apps/deta ... m.nounites



Under dynamic
, all processes that use a
language library execute
only one copy of the
library code
linking eExam
FBQ
In a system that selects
victims for rollback
primarily on the basis of
cost factors,
may occur
starvation eExam
FBQ
For the Banker's algorithm
to work, it needs to know
things
three 3 eExam
FBQ
The task of terminating a
thread before it has
completed is called thread cancellation eExam
FBQ
signals are delivered to the
same process that
performed the operation
causing the signal
Synchronous eExam
FBQ
In
capacity buffer, the sender
must block until the
recipient receives the
message
Zero eExam
FBQ
An I/O-bound program
would typically have
many very short
bursts
CPU
central
processing
unit
eExam

FBQ
The
is the module that gives
control of the CPU to the
process selected by the
short-term scheduler
dispatcher eExam
FBQ
Time is the interval from
the time of submission of
a process to the time of
completion
Turnaround eExam
FBQ
A solution to indefinite
blocking of low-priority
processes is aging eExam
FBQ
The first problem in
selecting a scheduling
algorithm is defining the
to be used
criteria eExam
FBQ
Analytical methods of
CPU scheduling algorithm
evaluation use
analysis to determine the
performance of an
algorithm
mathematical eExam
FBQ
is a technique of gradually
increasing the priority of
processes that wait in the
system for a long time
Aging eExam
FBQ
synchronization refers to
the idea of keeping
multiple copies of a
dataset in coherence with
one another.
Data eExam
FBQ
The concept of logicaladdress
space that is
bound to a separate
physical-address space is
to proper memory
management
central eExam
FBQ
Deadlock
requires that the operating
system be given in
advance additional
information concerning
which resources a process
will request and use
during its lifetime
avoidance eExam

FBQ
The behaviour of the
processes
unsafe states
controls eExam
FBQ
deadlocks are deadlocks
that are detected in a
distributed system but
don't actually exist .
Phantom eExam
FBQ
deadlocks can occur in
distributed systems when
distributed transactions or
concurrency control is
being used
Distributed eExam
FBQ
The goal of
is to shuffle the memory
contents to place all free
memory together in one
large block
compaction eExam
FBQ
The selection of the firstfit
versus best-fit strategies
can affect the amount of fragmentation eExam
FBQ
The decision to place the
operating system in either
low memory or high
memory is affected by the
location of the
vector
interrupt eExam
FBQ
With dynamic linking, a
is included in the image
for each library-routine
reference
stub eExam
FBQ
In Unbounded capacity
buffer, the sender never blocks eExam
FBQ
Blocking message passing
is known as synchronous eExam
FBQ
The advantage of dynamic
loading is that an
routine is never loaded
unused eExam
FBQ
Paging is a form of
relocation
dynamic eExam

FBQ
Every logical address is
bounded by the paging
hardware to some
address
physical eExam
FBQ
A nanokernel is a very
operating system kernel
minimalist eExam
FBQ
With dynamic loading, a
routine is not loaded until
it is called eExam
FBQ
As processes enter the
system, they are put into
an
queue
input eExam
FBQ
In the
-time address-binding
scheme, the logical- and
physical-address spaces
differ
execution eExam
FBQ
An address generated by
the CPU is commonly
referred to as
address
logical eExam
FBQ
Communication between
processes takes place by
to send and receive
primitives
calls eExam
FBQ
Thread management in
many-to-one model is
done in
space
user eExam
FBQ
With dynamic loading, all
routines are kept on disk
in a
format
relocatable eExam
FBQ
A thread that is to be
cancelled is often referred
as the
thread.
target eExam
FBQ
The advantage of
loading is that an unused
routine is never loaded
dynamic eExam

FBQ
In deadlock avoidance
algorithms, the system
only grants request that
will lead to
states
safe eExam
FBQ
In message passing, the
bounded and unbounded
capacity buffer is referred
to as
buffering
automatic eExam
FBQ
Addresses in the source
program are generally symbolic eExam
FBQ
All wait-free algorithms
are
-free
lock eExam
FBQ
In a real system, CPU
utilization should range
from
percent to 90 percent
40 eExam
FBQ is the number of processes
completed per time unit
throughput eExam
FBQ
deadlocks are deadlocks
that are detected in a
distributed system but
don't actually exist
Phantom eExam
FBQ
addressing allows the
kernel to make a given
physical address appear to
be another address
Virtual eExam
FBQ
Dynamic
does not require special
support from the operating
system
loading eExam
FBQ
The problem with
semaphores is that they
are too
level in nature
low eExam
FBQ scheduling is simple and
easy to implement, and
starvation-free
Round-robin RR eExam

FBQ
The
code is sometimes called
text section.
program eExam
FBQ
A
queue consists of all
processes in the system.
job eExam
FBQ
When both the send and
receive primitives of a
communication are
blocking, we have a
between the sender and
the receiver.
rendezvous eExam
FBQ
The act of switching the
CPU to another process
requires saving the state of
the old process and
loading the saved state for
the new process. This task
is known as
Context
switching
eExam
FBQ
Fibers are supported
the kernel
above eExam
FBQ
Deterministic modelling is
a type of
evaluation
analytical eExam
FBQ
In
capacity buffer, the sender
can continue the execution
without waiting
Bounded eExam
FBQ
Aging is a technique to
prevent starvation eExam
FBQ
When a context switch
occurs, the
saves the context of the
old process in its PCB and
loads the saved context of
the new process scheduled
to run
kernel eExam
FBQ
requires a backing store
swapping eExam
FBQ
can be used to enable a
process to be larger than
the amount of memory
allocated to it






DISCLAIMER: THIS PACKAGE IS PREPARED FOR EXAM REVISION AND PREPARATIONS ONLY, NOT TO BE TAKEN INTO THE EXAM HALL FOR MALPRACTICES

Stay informed when you download our app
https://play.google.com/store/apps/deta ... m.nounites



Adele
Posts: 522
Joined: Mon Nov 06, 2017 3:24 pm
Contact:

Re: NOUN E-Exam: CIT211 - Introduction to Operating Systems, Past Questions

Postby Adele » Sat Jul 21, 2018 3:36 pm

DISCLAIMER: THIS PACKAGE IS PREPARED FOR EXAM REVISION AND PREPARATIONS ONLY, NOT TO BE TAKEN INTO THE EXAM HALL FOR MALPRACTICES

Stay informed when you download our app
https://play.google.com/store/apps/deta ... m.nounites


Q61 The ________ mapping from virtual to physical addresses is done by the memory-management unit

Run-time

Q62 Under ________, all processes that use a language library execute only one copy of the library code

dynamic linking

Q63 Which of the following schemes requires help from the operating system?

dynamic linking

Q64 Which of the following does the Banker's algorithm nedd to know to work?

How much of each resource each process could possibly request
How much of each resource each process is currently holding
How much of each resource the system has available
***all of the above

Q65 A process goes from the ‘Ready’ state to ________ state

running

Q66 When a process creates a new process, _____ possibilities exist in terms of execution

two

Q67 In which of the following address-binding scheme is the logical- and physical-address spaces differ

Execution time

Q68 Which of the following scheduling algorithms is a type of priority scheduling algorithm?

Shortest-job-first

Q69 The class of OS that has very little user-interface capability, and no end-user utilities is __________ OS

real-time

Q70 _______ is the most general scheduling scheme, and also the most complex

Multilevel feedback q ueue

Q71 Which of the following does the Banker's algorithm nedd to know to work?

How much of each resource each process could possibly request
How much of each resource each process is currently holding
How much of each resource the system has available
***all of the above

Q72 In which of the following ways can a signal be delivered?

Deliver the signal to every thread in the process
Deliver the signal to the thread to which the sign al applies
Deliver the signal to certain threads in the process
***Any of the above

Q73 Cancellation of a target thread may occur in ______ different scenarios

two

Q74 Canceling a thread _________ may not free a necessary system-wide resource.

asynchronously

Q75 The benefits of multithreading include the following except:

increased responsiveness to the user
resource sharing within the process
economy
***none of th e above

Q76 ______ different types of implementation models relate fibers and kernel-level threads

Thre e

Q77 Under which of the following circumstances can CPU scheduling decisions take place?

When a process switches from the running state to the waiting state
When a process switches from the running state to the ready state
When a process switches from the waiting state to the ready state
***all of the above

Q78 Which of the following is affected by CPU scheduling algorithm?

the amount of time a process spends waiting in the ready queue

Q79 Turnaround Time does not include which of the following?

the sum of the periods spent waiting to get into memory
time waiting in the ready queue
time executing on the CPU and doing I/O
***none of the above

Q80 The criteria for comparing CPU-scheduling algorithms include the following except:

CPU Utilization
Throughput
Turnaround Time
***None of the above

Q81 Which of the following memory management algorithm suffers from external fragmentation?

worst fit
best-fit
first-fit
***all of th e above

Q82 The number of processes a system may run simultaneously is _______ the number of CPUs installed

equal to

Q83 Given the memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in that order), if firstfit, best-fit, and worst-fit algorithms were to be used to place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in that order), which algorithm makes the most efficient use of memory?

first

Q84 Which of the following scheduling algorithms can degenerate into an FCFS?

Round-r obin

Q85 The function of a message system is to allow processes to communicate with one another without the need to resort to __________ data

shared

Q86 In _________ operating system the computer’s response time is the turnaround time

batch-processing

Q87 In which of the following algorithms is this statement true: "A process that uses too much CPU time is degraded to a lower-priority queue, a process that waits too long is upgraded to a higher-priority queue"

Multilevel feedback q ueue

Q88 Which of the following scheduling algorithms can be applied to data packet scheduling?

Round-Robin

Q89 _________-fit is generally the fastest memory allocation algorithm

first

Q90 _______-fit algorithm strategy produces the largest leftover hole

worst
best
first
***none of the above

Q91 In which of the following memory allocation algorithm must the entire list of available memory be searched?

best-fit
worst-f it
all of the above
***none of the abo ve

Q92 Which of the following thread implementation model allows for greater concurrency?

one-to-one

Q93 Which of the following is a solution to external fragmentation?

compaction
non-contigu ous logical address space
***all of the above
none of the abo ve

Q94 Which of the following is an advantage of segmentation?

Operating system may allow segments to grow and shrunk dy namically with unchanging addressing
Sharing on segment level is easy
Protection on segment level of re lated data
***All of the above

Q95 The banker’s algorithm is a type of _______ algorithm

deadlock-avoidance

Q96 there are _______ methods for dealing with deadlocks

three

Q97 In comparing different memory-management strategies, which of the following considerations should be used?

Swap ping
Sharing
Protecti on
***All of the a bove

Q98 The collection of processes on the disk that is waiting to be brought into memory for execution forms the _______ queue

Input

Q99 ________ scheduling algorithm may lead to convoy effect

FCFS

Q100 Which of the following scheduling algorithms produces the shortest waitng time?

SJF

Q101 Which of the following scheduling algorithms can cause short processes to wait for long?

FCFS

Q102 Which of the following is not a disadvantage of deterministic modelling method of scheduling algorithm evaluation?

It requires too m uch knowledge

Q103 _______ method is the only completely accurate way to evaluate a scheduling algorithm

implementation

Q104 In which of the following situations can race condition occur?

File system
Networking
Life-critical system
***all of the above

Q105 Mutual exclusion has ______ levels of concurrency

two

Q106 A solution to the critical section problem must satisfy which of the following requirements?

mutual exclusion
Progress
Bounded Waiting
***all of the above

Q107 The circular-wait condition for deadlock implies the _______ condition

hold-and-wait

Q108 Deadlock prevention algorithms that avoid ________ are called non-blocking synchronization algorithms

mutual e xclusion

Q109 To ______ deadlocks, we ensure that at least one of the necessary conditions never holds

prevent

Q110 To eliminate deadlocks by aborting process, we use one of __ methods

two

Q111 ________ is a very light-weight microkernel

L4

Q112 The _________kernel represents the closest hardware abstraction layer of the operating system by interfacing the CPU, managing interrupts and interacting with the MMU

nano

Q113 The main disadvantages of _________ kernels are the dependencies between system components

monol ithic

Q114 The binding of instructions and data to memory addresses is done at which of the following steps?

Compile time
Load time
Execution time
***Any of the opti ons

Q115 A real-world example of _________ occurs when two people meet in a narrow corridor, and each tries to be polite by moving aside to let the other pass, but they end up swaying from side to side without making any progress because they always both move the same way at the same time

livelock

Q116 Which of the following is not a disadvantage of deterministic modelling?

It requires exact numbers for input and its answers apply to only those cases
It is too specific
It requires too m uch knowledge to be useful
none of the above

Q117 Which of the following is a limit of Queueing model?

The accuracy of the computed results may be questionable
The classes of algorithms and distribution that can be hand led is presently limited
It is hard to express a system of complex algorithms and distributions
***All of the above

Q118 Which of the following requires special operating system support?

dynamic linking

Q119 Which of the following is an advantage of segmentation?

Sharing on segment level is easy
Operating system may allow segm ents to grow and shrunk dynamically with unchanging addressing
Protection on segment level of related data
***All of the above

Q120 The states of the processes involved in the __________ constantly change with regard to one another

livelock





DISCLAIMER: THIS PACKAGE IS PREPARED FOR EXAM REVISION AND PREPARATIONS ONLY, NOT TO BE TAKEN INTO THE EXAM HALL FOR MALPRACTICES

Stay informed when you download our app
https://play.google.com/store/apps/deta ... m.nounites

Who is online

Users browsing this forum: No registered users and 2 guests