CIT211 TMA

Q1 When a process creates a new process, there are __________ possibilities in terms of the address space of the new process
two
three
four
five

Q2 ______ scheduler is another name for CPU scheduler
Short-term
long-term
medium-term
instant

Q3 A ready queue is generally stored as a ________
b-tree
graph
stack
linked list

Q4 A ______ queue consists of all processes in the system
ready
system
job
process

Q5 A ________ is just a passive collection of instructions
process
task
program
job

Q6 The objective of _________ is to maximize CPU utilization
multiprogramming
multiprocessing
distributed
multitasking

Q7 A _________ system is a computer hardware configuration that includes more than one independent processing unit
multiprogramming
multiprocessing
distributed
multitasking

Q8 Typically, a task has _____ states
two
three
four
six

Q9 The user of an Operating system is a(n) ________
person
expert
application
supervisor

Q10 The function of a message system is to allow processes to communicate with one another without the need to resort to __________ data
same
separate
shared
conflicting

Q11 The objective of _____ is to switch the CPU among processes so frequently that users can interact with each program while it is running
real-time
time-sharing
network
batch-processing

Q12 The ‘closed-shop’ mode of operation was used during the _______ generation of the Operating System
second
first
fourth
third

Q13 The services provided by the Operating System can be categorised into __________
two
three
four
six

Q14 A process goes from the ‘Ready’ state to ________ state
waiting
running
finished
ready

Q15 In the _________ approach, the kernel itself only provides basic functionality that allows the execution of servers, separate programs that assume former kernel functions, such as device drivers, GUI servers, etc.
picokernel
nanokernel
microkernel
exokernel

Q16 The processes that are residing in main memory and are ready and waiting to execute are kept on a list called the _____ queue
ready
system
job
process

Q17 ______ section contains global variables
code
storage
data
memory

Q18 A _________ operating system is one that appears to its users as a traditional uniprocessor system, even though it is actually composed of multiple processors
network
time-sharing
distributed
real-time

Q19 In _________ operating system the computer’s response time is the turnaround time
real-time
time-sharing
online
batch-processing

Q20 When a process creates a new process, _____ possibilities exist in terms of execution
two
three
four
five

 

Q1 How many common types of multithreading implementation are there?
two
three
four
six

Q2 Which of the following is not a disadvantage of Deterministic Modelling
It is hard to express a system of complex algorithms and distributions,
It requires too much knowledge to be useful
It requires exact numbers for input and its answers apply to only those cases
It is too specific

Q3 Which of the following scheduling algorithms is a type of priority scheduling algorithm?
shortest-job-first
first-come-first-served
round-robin
none of the above

Q4 Threads can be classified into ________ different types
two
three
four
six

Q5 Blocking message passing is known as _______
asynchronous
isochronous
synchronous
none of the above

Q6 Which of the following properties is possessed by a communication link in direct communication scheme?
a link is established automatically between every pair of processes that want to communicate
a link is associated with exactly two processes
exactly one link exists between each pair of processes
all of the above

Q7 The class of OS that has very little user-interface capability, and no end-user utilities is __________ OS
real-time
time-sharing
network
batch-processing

Q8 _________ is a very light-weight microkernel
L3
L4
L6
L7

Q9 The _________kernel represents the closest hardware abstraction layer of the operating system by interfacing the CPU, managing interrupts and interacting with the MMU
exo
monolithic
micro
nano

Q10 The main disadvantages of _________ kernels are the dependencies between system components
exo
monolithic
micro
nano

Q11 The number of processes a system may run simultaneously is _______ to the number of CPUs installed
less than
greater than
equal
inversely proportional

Q12 _________ kernels are able to give the user the illusion that the number of processes being run simultaneously on the computer is higher than the maximum number of processes the computer is physically able to run simultaneously
multi-programming
multi-processing
multi-tasking
all of the above

Q13 The loop that the kernel provides for execution whenever no processes are available to run is called the ______ process
passive
active
dormant
idle

Q14 In the ‘_________’ mode of operation, the individual user (programmer) was responsible for all machine set up and operation, and subsequent clean-up and preparation for the next user
open-shop
closed-shop
all of the above
none of the above

Q15 In the area of system efficiency, which of the following services is offered by the OS?
Accounting
Ease of Evolution of OS
New Services
All of the above

Q16 _______ and debuggers are accessed through the OS to assist programmers in creating programs
creators
launchers
editors
compilers

Q17 The kernel contains the ________ frequently used functions in the OS
most
least
seldom
all of the above

Q18 All of these are resources managed by the operating system except _________.
CPU time
file storage space
data
printing paper

Q19 A set of programs called the _________ is provided to assist the programmer in program creation and file management
system software
operating system
housekeeper
utilities

Q20 The user of an Operating system is a(n) ________
person
application
supervisor
expert

 

Q1 A thread comprises of the following except:
thread ID
program counter
register set
none of the above

Q2 Fibers are supported ______ the kernel
below
above
beside
any of the above

Q3 ________ are supported directly by the operating system
fibers
user threads
kernel threads
all of the above

Q4 Threads can be classified into ________ different types
two
three
four
six

Q5 Blocking message passing is known as ________
asynchronous
isochronous
synchronous
none of the above

Q6 Which of the following properties is possessed by a communication link in direct communication scheme?
a link is established automatically between every pair of processes that want to communicate
a link is associated with exactly two processes
Exactly one link exists between each pair of processes
all of the above

Q7 The class of OS that has very little user-interface capability, and no end-user utilities is __________ OS
real-time
time-sharing
network
batch-processing

Q8 _________ is a very light-weight microkernel
L3
L4
L6
L8

Q9 The _________kernel represents the closest hardware abstraction layer of the operating system by interfacing the CPU, managing interrupts and interacting with the MMU
exo
monolithic
micro
nano

Q10 The main disadvantages of _________ kernels are the dependencies between system components
exo
monolithic
micro
nano

Q11 The loop that the kernel provides for execution whenever no processes are available to run is called the ______ process
passive
active
dormant
idle

Q12 In the ‘_________’ mode of operation, the individual user (programmer) was responsible for all machine set up and operation, and subsequent clean-up and preparation for the next user
open-shop
closed-shop
all of the above
none of the above

Q13 In the area of system efficiency, which of the following services is offered by the OS?
Accounting
Ease of Evolution of OS
New Services
All of the above

Q14 A ready queue may be implemented as the following except:
FIFO queue
priority queue
a tree
none of the above

Q15 Process execution begins with ______ burst
I/O
CPU
Wait
all of the above

Q16 The number of threads in the pool can be set heuristically based upon the following factors except:
the expected number of concurrent client requests
the number of CPUs in the system
the amount of physical memory
none of the above

Q17 Which of the following operating systems does not support kernel threads?
Windows NT
Solaris 2
BeOS
none of the above

Q18 The user of an Operating system is a(n) _________
person
expert
supervisor
application

Q19 In ______ capacity buffer, the sender must block until the recipient receives the message
Bounded
Unbounded
Zero
All of the above

Q20 OS can be defined by the following except:
functions
goals
objectives
none of the above

 

Q1 __________ is the strongest non-blocking guarantee of progress data
Lock-freedom
Wait-freedom
Run-freedom
Obstruction-freedom

Q2 In general, a lock-free algorithm can run in _______ phases
two
three
four
five

Q3 Correct concurrent assistance is typically the most complex part of a ________ algorithm
Lock-free
Wait-free
Run-free
obstruction-free

Q4 The services provided by the Operating System can be categorised into __________
two
three
five
six

Q5 The ‘closed-shop’ mode of operation was used during the _______ generation of the Operating System
first
second
third
fourth

Q6 In the _________ approach, the kernel itself only provides basic functionality that allows the execution of servers, separate programs that assume former kernel functions, such as device drivers, GUI servers, etc.
picokernel
microkernel
nanokernel
exokernel

Q7 The processes that are residing in main memory and are ready and waiting to execute are kept on a list called the _____ queue
ready
system
job
process

Q8 A process goes from the ‘Ready’ state to ________ state
waiting
running
finished
ready

Q9 _______ section contains global variables
data
storage
code
memory

Q10 A _________ operating system is one that appears to its users as a traditional uniprocessor system, even though it is actually composed of multiple processors
network
time-sharing
distributed
real-time

Q11 In _________ operating system the computer’s response time is the turnaround time
real-time
time-sharing
online
batch-processing

Q12 ________ is about the weakest natural non-blocking progress guarantee
Lock-freedom
Wait-freedom
Run-freedom
Obstruction-freedom

Q13 When a process creates a new process, _____ possibilities exist in terms of execution
two
three
four
six

Q14 ______ scheduler is another name for CPU scheduler
short-term
long-term
medium-term
instant

Q15 Preventing the system from continually live-locking is the task of a _______
context switcher
contention manager
scheduler
context manager

Q16 A ______ queue consists of all processes in the system
ready
system
job
process

Q17 Which of the following is a type of synchronization?
barrier
lock
thread join
all of the above

Q18 > In which of the following situations can race condition occur?
File system
Networking
Life-critical system
All of the above

Q19 ______ scheduling produces the shortest waiting time
RR
FCFS
SJF
Priority

Q20 _________ scheduling is the simplest scheduling algorithm
RR
FCFS
SJF
Priority

 

Whatsapp 08039407882

Leave a Reply

Your email address will not be published. Required fields are marked *