Question Text

The Operating System is defined as

Select the function of Kernel.

In a time-sharing operating system, choose the

In a time-sharing operating system, choose the
allotted time for a process elapses, the process
transitions from the running state to the ________.
Identify correct option.

Determine the application of a scheduling algorithm

that prioritizes allocating the CPU to the process
that makes the initial CPU request

Select the algorithm assessed within a time

quantum
Select the algorithm assessed within a time
quantum

Preemptive Shortest Job First scheduling is

occasionally indicate

Select correct option for: An SJF algorithm is simply

a priority algorithm where the priority is grouped
with __________
Select correct option for: An SJF algorithm is simply
a priority algorithm where the priority is grouped
with __________

Identify a solution to the problem of indefinite

blockage of low priority processes is

Indicate the following scheduling algorithm which

gives minimum average waiting time

Identify a process is selected from the ______ queue

by the ________ scheduler, to be executed.
Select correct option for: Scheduling is
implemented in order to ____________.

Select the correct option: "If a process is executing

in its critical section, then no other processes can
be executing in their critical section. This condition
is expressed as - "

Identify one of the following can be express as a

synchronization tool.
Identify one of the following can be express as a
synchronization tool.

Process synchronization can be identified at

_________

Identify the correct option for complete the

statement. Semaphore that is a/an _______ to solve
the critical section problem.
Choose the code that change the value of the
semaphore

Identify the two kinds of semaphores

Choose the correct option: the binary semaphore is

a semaphore with integer values
Select correct option: Semaphore is used for

Identify the deadlock avoidance algorithm.

Identify a problem that encountered in multitasking,

that a process is perpetually denied necessary
resources is known as
Select the method to avoid deadlock

Identify the correct option: the pager is associated

with
Identify the location of Swap space

Identify the algorithm that chooses the page that

has not been used for the longest period of time
whenever the page required to be replaced

Select the following page replacement algorithms

that suffers from Belady’s Anomaly.
Select the following page replacement algorithms
that suffers from Belady’s Anomaly.

Choose the aim for creating page replacement

algorithms.

Identify correct option for : A FIFO replacement

algorithm associates with each page the _______
Choose the most effective page replacement
algorithm.

Select correct option for: Virtual memory is

normally implemented by ________.

Segment replacement algorithms are more complex

than page replacement algorithms, choose the
cause
Segment replacement algorithms are more complex
than page replacement algorithms, choose the
cause

Choose the two methods of the LRU page

replacement policy that can be implemented in
hardware

LRU page – replacement algorithm indicates with

each page the _____
For 3 page frames, the following is the reference
string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0
1.Identify total page faults does the LRU page
replacement algorithm produce.

Identify the reason of a page fault.

Identify the examination of a low page fault

Identify correct option for: physical memory is

broken into fixed-sized blocks is known as

Identify correct option for: logical memory is broken

into blocks of the same size are known as -
Every address generated by the CPU is divided into
two parts. They are indicated as ____________

Identify correct option: with paging there is no

________ fragmentation.

Identify the page table registers that should be

framed with _______
Identify the page table registers that should be
framed with _______

For larger page tables identify that they are kept in

main memory and a __________ points to the page
table.

Identify the correct option: for every process there

is a __________
Select Disk bandwidth description

Consider a disk queue with requests for I/O to

blocks on cylinders.98 183 37 122 14 124 65 67
Considering FCFS (first cum first served)
scheduling, Identify the total number of head
movements is, if the disk head is initially at 53 is
Consider a disk queue with requests for I/O to
blocks on cylinders.98 183 37 122 14 124 65
67 .Considering SSTF (shortest seek time first)
scheduling, identify the total number of head
movements is, if the disk head is initially at 53 is

Identify the algorithm for, the disk arm starts at one

end of the disk and servicing requests till the other
end of the disk. At the other end, the direction is
reversed and servicing continues.

Identify the software layer that is nearest to the

hardware.
Identify the software layer that is nearest to the
hardware.

Select the responsibilities of Operating System

Identify from the following that is not an operating

system.

After turn off the computer, identify the location

from the place the data is lost.
After turn off the computer, identify the location
from the place the data is lost.

Identify the memory that is placed at the

intermediate level of technology.

Indicate the main function of the command

interpreter.
Identify the features of operating system.

Indicate the system the FCFS algorithm is

particularly troublesome.
Indicate the system the FCFS algorithm is
particularly troublesome.

Choose correct option that represent CPU

scheduling algorithms in Operating Systems.

Select the primary goal of protection in an

operating system.
Select the main difference between protection and
security in an operating system.

Select the purpose of firewall.

Select the common technique used for intrusion

detection.
Select the common technique used for intrusion
detection.

Indicate the module that gives control of the CPU to

the process selected by the short-term scheduler.

Indicate the interval from the time of submission of

a process to the time of completion is termed as
____________

Identify the scheduling algorithm that allocates the

CPU first for the process that requests the CPU first.
Identify the features of priority scheduling
algorithm.

Identify the features of priority scheduling algorithm

____________
Identify the algorithm that uses time quantum -

Identify the algorithm that the processes are

classified into different groups -
Identify the algorithm that the processes are
classified into different groups -

Identify the feature of multilevel feedback

scheduling algorithm -

Select the correct option for: The CPU scheduling

forms the foundation of
Select the correct option for: The CPU scheduling
forms the foundation of

Identify the two steps of a process execution.

Identify the correct option for: non – preemptive

scheduling occurs
Identify the correct option for: non – preemptive
scheduling occurs

Select the primary function of an I/O device

controller.

Select the purpose of an I/O buffer in an operating

system.
Select the purpose of an I/O buffer in an operating
system.

Select the I/O techniques that allows devices to

send and receive data simultaneously.

Select the data structure that is commonly used to

implement directory structures in a file system

Identify disk scheduling algorithm that traverses the

disk in a fixed direction servicing requests until the
end and then reverses direction.
Identify disk scheduling algorithm that traverses the
disk in a fixed direction servicing requests until the
end and then reverses direction.

Identify the purpose of the disk formatting process.

Identify structure that is responsible for maintaining

information about files such as ownership,
permissions, and location on disk.
Select the primary objective of device management
in an operating system.

Select the component of the operating system that

handles incoming hardware interrupts from I/O
devices.
Identify the primary purpose of Direct Memory
Access (DMA) in a computer system.

Select the aim of device-independent I/O software.

Select the purpose of an interrupt in device
management.

Identify User authentication methods typically

involve _____________.
A firewall indicate as a security barrier between
________________.

Select the primary goal of disk scheduling

algorithms.
Select correct option for: The segment of code in
which the process may change common variables,
update tables, write into files is called as

Select the simplest disk scheduling algorithm.

Identify the primary purpose of virtual memory.

Identify the primary purpose of virtual memory.

Identify in contiguous file allocation, data blocks for

a file are stored in ____________.
Select the primary function of an I-node (index
node) in a file system.

Identify the main disadvantage of FCFS disk

scheduling.
Select the condition that required for a deadlock to
be possible

Select correct option: Bad blocks on a disk are

Select FCFS (First-Come-First-Served) disk
scheduling algorithm prioritizes

Select the basic unit of storage on a hard disk.

Select the component of a hard disk that is
responsible for reading and writing data.

Select "platter" in a hard disk drive.

Identify "track" in disk architecture.

Identify "track" in disk architecture.

Scheduling is implemented in order to -

Select correct option for: An SJF algorithm is

essentially a priority algorithm that, the priority is
Select correct option for: An SJF algorithm is
essentially a priority algorithm that, the priority is
associated with -

Identify the scheduling algorithm that minimizes

the average waiting time

Multi-threaded programs indicate

Select the main disadvantage of the SSTF
algorithm.

Select the scheduling algorithm that is also known

as the "elevator algorithm".

Select the key difference between SCAN and C-

SCAN.
SCAN.

Select the goal of interrupt handlers.

Select the primary advantage of C-LOOK over

SCAN.
Select the primary advantage of C-LOOK over
SCAN.

Select that is not a function of operating system

Select the function of an operating system

If the kernel operates with a single thread, indicate
the correct option for the behavior of any user-level
thread executing a blocking system call

Select the type of OS reads and reacts in terms of

actual time
actual time

Identify the objective of multiprogramming

Identify correct option for, in terms Multiprocessor

system is better than single processor

Select the system call that creates a new process

Select the system call that creates a new process

Select the correct option. The CPU fetches the

instruction from memory according to the value
of-------

Select the following is indicated as the deadlock

avoidance algorithm
Choose the method to avoid deadlock

Select the definition of deadlock in operating

systems
Select the definition of deadlock in operating
systems

Select the necessary condition for deadlock to occur

Select the primary purpose of the Resource

Allocation Graph in deadlock detection
Select the primary purpose of the Resource
Allocation Graph in deadlock detection

Identify the component of a Resource Allocation

Graph that indicates a potential deadlock -

Identify deadlock handling technique that focuses

on structuring resource allocation to prevent
deadlock altogether.
Identify algorithm that is used for deadlock
avoidance and considers the safe allocation of
resources based on the available resources and
future requests

Choose Wait-for Graph, in the context of deadlock

detection.
Choose the correct option for the primary purpose
of the Banker\'s algorithm in deadlock avoidance.

Choose the primary objective of deadlock recovery

Choose the primary objective of deadlock recovery

Suppose the available primary memory size is

smaller than required size of the program. Choose
the correct scheme from the followings to allocate
allocate the program.

Identify the purpose of dirty bit.

Identify the purpose of dirty bit.

Identify Scheduler selects processes to be brought

into the Ready Queue

Choose the necessary conditions needed before

deadlock can occur
Choose the necessary conditions needed before
deadlock can occur

Identify the reason for occurrence of a page fault

Choose the correct option for purpose of Banker's

algorithm :
Choose the correct option for purpose of Banker's
algorithm :

Identify from the following, that is not a common

file permission.

Identify the strongest password from the followings.

Choose the characteristics of Authorization from the

followings.
Choose the characteristics of Authorization from the
followings.

Identify a piece of code that reproduce itself.

Indicate the type of the internal code of any

software that will set of a malicious function during
specified conditions are met.

Identify the operating system.

Identify the operating system.

Select false statement about the function of an

operating system

Select the operating system that is used in

embedded devices
Select a characteristic of a time-sharing operating
system -

Identify the company that is primarily behind the

development of Tizen OS .

Select the purpose of the system call in an

operating system.
Select the purpose of the system call in an
operating system.

Select the programming languages those are

mainly used for developing applications for Tizen
OS -

Identify the characteristic of a Monolithic Kernel.

Choose the main function of the kernel in an
operating system.

Choose the false option for “the part of the

operating system”

Choose the operating systems that is primarily

designed for mobile devices.
Choose the operating systems that is primarily
designed for mobile devices.

Choose correct option for “Tizen is primarily

developed for devices of type “

Choose the correct option for -“the Tizen Store used

for.“
Choose the incorrect option for – “ a typical function
of a Microkernel”

Choose the type of operating system that is most

likely to be used in a cloud computing environment.

Describes Operating System with it features.

Describe the advantages and disadvantages of

Operating System.

Describes Process control block with it features.

Describe the importance of Kernel in Operating

System.

Describe batch processing with an example.

Describe batch processing with an example.

Describe benefits of a multiprocessor system.

Describe are the advantages and disadvantages of

Multithreaded Programming.

Differentiate among the following types of OS by

defining their essential properties: Simple batch
System and Real time System.
Discuss the importance of Process Control Block.

Define the two categories of CPU scheduling

algorithm.

Discuss LRU-Approximation page Replacement.

Describe the importance of Semaphore.

Discuss about the generation of Operating System.

Discuss about the Process Synchronization.
Express the advantages of layered structure over
monolithic structure.

Compare between macro kernel and micro kernel.

Discuss about the application of User Space and
Kernel Space.
Explain Priority scheduling algorithm.

Explain the following process scheduling algorithm

a) Priority scheduling b) Shortest job first
scheduling.
Explain different states of a process.

Illustrate Deadlock with an example.

Explain the necessary conditions for achieving a

Deadlock.

Express your view for the differences between

paging and segmentation.

Explain Semaphore with an example.

Compare between Distributed system and Real time
system.

Explain dinning philosopher problem & its solution.

Explain Critical Section and it's effect in application
point of view in OS.

Explain the following terms related to IPC: a) critical

region b) Race condition
Explain Peterson’s solution for achieving mutual
exclusion.

Explain batch system and multiprogrammed

System.
Consider the following page reference string.
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2. Estimate
total page faults occur for the following FIFO
replacement algorithm, assuming four frames.

Compare between process and thread.

Explain the advantages and disadvantages of using
a linear list vs. a hash table for implementing
directory structures in a file system.
Explain the concept of a virtual file system (VFS).
Predict about the information of an I-node file
system.
Compare and contrast the following disk scheduling
algorithms: FCFS, SSTF.
Compare and contrast the following disk scheduling
algorithms: SCAN, and C-SCAN.

Explain different file allocation methods:

contiguous, linked, indexed.
Justify the concept of sectors, tracks, and cylinders
on a disk.

Describe any three main functions of an Operating

System.

Describe the services of Operating System.

Define OS, User Space and Kernel Space.

Describe simple structure of operating system.

Describe monolithic approach of Operating system.

Describe layered approach of Operating System.

State the different types of operating systems.

Describe the difference between multiprogramming

and multitasking.

Define Deadlock.
Explain the necessary conditions for deadlock to
occur.

Explain mutual exclusion and its role in deadlock

formation.

Explain the concept of hold and wait in deadlock

scenarios.
Illustrate Inter-process communication.

Explain the term page fault and its implications in

virtual memory systems.
Illustrate the concept of demand paging and its
significance in virtual memory systems.
Explain FIFO page replacement policy with the help
of an example.

Define Deadlock along with the four conditions

required for deadlock to occur.

Define the application function of fork() and exec()

in kernel with example.
Compare the Monolithic and Micro Kernel.

Explain different types of techniques for deadlock

prevention.

Differentiate between Preemptive scheduling and

Non-preemptive scheduling algorithm.

Explain the methods to recover from the deadlock

in the system.

Explain four general necessary and sufficient

conditions for deadlocks.

Explain the use of Banker’s Algorithm for Deadlock

Avoidance with illustration.

Compare kernel level thread and user level thread.

Explain thrashing and the methods to avoid

thrashing.
Explain thrashing and the methods to avoid
thrashing.

Describe binary semaphore and counting

semaphore with example.

Explain the mechanism of inter process

communication using shared memory in a
producer-consumer problem.

Explain any two page-replacement

strategies/algorithms.

Explain FIFO and LRU replacement algorithms with

example reference string.

Explain the algorithm of the Dining Philosopher

problem as a classical problem of process
synchronization.
Suppose the head of a moving- head disk with 200
tracks, numbered 0 to 199, is Currently serving a
request at track 143 and has just finished a request
at track 125. If the queue of requests is kept in FIFO
order: 86, 147, 91, 177, 94, 150, 102, 175, 130.
Estimate the total head movement to satisfy these
requests for the following Disk scheduling
algorithms: (a)SCAN (b) FCFS.
Consider the following five processes, with the
length of the CPU burst time given in milliseconds.
Process Burst time P1 10 P2 29 P3 3 P4 7 P5 12
Consider the First come First serve (FCFS), Non-
Preemptive Shortest Job First (SJF), Round Robin
(RR) (quantum=10ms) scheduling algorithms.
Illustrate the scheduling using Gantt chart. Find out
Average Turnaround time. Justify which is better.
“Multiprocessor operating systems are also known
as parallel OS or tightly coupled OS.”—Justify the
statement

Differentiate between deadlock and starvation.

Compare the difference between user and kernel
thread.

Describe SJF scheduling algorithm with example.

Evaluate the Average Waiting Time and Turn
Around Time of FCFS and SJF with following
conditions. There are total five processes. The
arrival time of the five processes are 0, 1,2,3,4
(milliseconds). The burst time of the five processes
are 7, 5, 3, 1, 2 (milliseconds).
 Explain with neat diagram for mapping logical
address into physical address in contiguous
memory allocation.

Consider a reference string: 4, 7, 6, 1, 7, 6, 1, 2, 7,

2. the number of frames in the memory is 3.
Evaluate the number of page faults respective to
FIFO Page Replacement Algorithm.

Discriminate preemptive scheduling from non-

preemptive scheduling with example.
Discriminate preemptive scheduling from non-
preemptive scheduling with example.

Explain the usage of device controllers in I/O

hardware in operating systems.

Explain how do device drivers facilitate

communication between hardware devices and the
operating system.

Compare and contrast contiguous, linked, and

indexed allocation methods in secondary storage
structures.

Evaluate the different types of files and their

characteristics in file management systems.

Justify the concept of a directory structure.

Compare various disk scheduling algorithms such

as SCAN and C-SCAN in terms of their efficiency and
performance.

Explain I-node in a file system for file management

and disk management operations.

Consider the LRU page replacement algorithm,

assuming there are 3 frames and the page
reference string is 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1
7 0 1 8. Estimate the number of page faults.

Describe functions of an Operating System.

Describe the services of the Operating System.

Describe Real time Operating System.

Describe structure of Operating System.

Explain Spooling in the operating system.

Explain different types of operating systems.

Explain how does an operating system manage

system resources such as CPU, memory, and I/O
devices

Explain how an operating system provides an

interface for user-level processes to interact with
the hardware.

Explain circular wait and its significance in

deadlock formation.
Justify the concept of a Wait-for Graph and its role
in deadlock detection.
Write the difference between paging and
fragmentation.
Illustrate multilevel paging scheme with the help of
a diagram.
Construct the mapping between logical and
physical address in non-contiguous memory
allocation.

Given page reference string:

1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 Compare the
number of page faults for LRU and FIFO.
Given page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 Compare the
number of page faults for LRU and Optimal page
replacement algorithm.

Compare and contrast between multilevel-paging

and inverted page table

Compare and contrast between paging and

segmentation.

Explain with the help of a diagram the File System

of Unix Operating system.
 Answer Text

Application Software(N)

System Software(Y)

both a and b(N)

None of these(N)

Makes Communication between Hardware and Software(Y)

Makes Communication between Application and Software.(N)

Makes interface for Users(N)

None of the mentioned(N)

Blocked State(N)
Ready State(Y)

Suspended State(N)

Terminated State(N)

first-come, first-served scheduling(Y)

shortest job scheduling(N)

priority scheduling(N)

none of the mentioned(N)

shortest job scheduling algorithm(N)

round robin scheduling algorithm(Y)

priority scheduling algorithm(N)

multilevel queue scheduling algorithm (N)

Fast SJF scheduling(N)

EDF scheduling – Earliest Deadline First(N)

HRRN scheduling – Highest Response Ratio Next(N)

SRTN scheduling – Shortest Remaining Time Next(Y)

the predicted next CPU burst(Y)

the inverse of the predicted next CPU burst (N)

the current CPU burst(N)

anything the user wants (N)

Starvation(N)

Wait queue(N)

Ready queue(N)

Aging(Y)

Round Robin(N)

FCFS(N)

SJF(Y)

Priority(N)

blocked, short term(N)

wait, long term(N)

ready, short term(Y)

ready, long term(N)

increase CPU utilization(Y)

decrease CPU utilization(N)

keep the CPU more idle(N)

none of the mentioned(N)

mutual exclusion(Y)

critical exclusion(N)

synchronous exclusion(N)

asynchronous exclusion(N)

Thread (N)

Pipe(N)
Semaphore(Y)

Socket (N)

hardware level(N)

software level(N)

both hardware and software level(Y)

none of the mentioned(N)

special program for a system(N)

hardware for a system(N)

integer variable(Y)

none of the mentioned(N)

critical section code(Y)

remainder section code(N)

non – critical section code(N)

none of the mentioned(N)

binary & counting(Y)

mutex & counting(N)

counting & decimal (N)

decimal & binary (N)

0 and 1(Y)

0 and -1(N)

0.8 and 0(N)

0.5 and 0(N)

IPC System Calls(Y)

System calls (N)

System protection(N)

None of the mentioned(N)

banker’s algorithm(Y)

round-robin algorithm(N)

elevator algorithm(N)

karn’s algorithm(N)

starvation(Y)

deadlock(N)

inversion (N)

aging(N)
there must be a fixed number of resources to allocate(Y)

resource allocation must be done only once(N)

all deadlocked processes must be aborted(N)

inversion technique can be used (N)

individual page of a process(Y)

entire process(N)

entire thread(N)

first page of a process(N)

primary memory (Y)

secondary memory(N)

Central Processing Unit(N)

none of the mentioned(N)

least recently used algorithm(Y)

first in first out algorithm(N)

additional reference bit algorithm(N)

counting based page replacement algorithm(N)

FIFO(Y)

Optimal replacement(N)

LRU(N)
Both optimal replacement and FIFO(N)

replace pages faster(N)

increase the page fault rate(N)

decrease the page fault rate(Y)

to allocate multiple pages to processes(N)

time it was brought into memory(Y)

size of the page in memory(N)

page after and before it(N)

all of the mentioned(N)

Replace the page that has not been used for a long time(N)

Replace the page that has been used for a long time(N)

Replace the page that will not be used for a long time(Y)

None of the mentioned(N)

demand paging(Y)

virtualization(N)

buses(N)

All(N)

Segments are better than pages(N)

Pages are better than segments(N)

Segments have variable sizes(Y)

Segments have fixed sizes(N)

Counters(N)

RAM & Registers(N)

Stack & Counters(Y)

Registers (N)

the time of that page’s last use(Y)

time it was brought into memory(N)

page after and before it(N)

all the mentioned(N)

10(N)

11(N)

12(Y)

13(N)

a page cannot be accessed due to its absence from memory (Y)

a page gives inconsistent data(N)

a page is invisible(N)

all of the mentioned(N)

the effective access time decreases(Y)

the turnaround time increases(N)

the effective access time increases(N)

turnaround time & effective access time increases (N)

frames(Y)

pages (N)

backing store(N)

None of the mentioned (N)

frames(N)

pages(Y)

backing store(N)

None of the mentioned(N)

frame bit & page number(N)

page number & page offset(Y)

page offset & frame bit(N)

frame offset & page offset(N)

external(Y)

internal(N)

either type of (N)

None of the mentioned(N)

very low speed logic(Y)

very high-speed logic(N)

a large memory space (N)

none of the mentioned(N)

page table base register(Y)

page table base pointer(N)

page table register pointer(N)

page table base (N)

page table(Y)

copy of page table(N)

pointer to page table(N)

all of the mentioned (N)

the total number of bytes transferred(N)

total time between the first request for service and the completion on the last
transfer(N)

the total number of bytes transferred divided by the total time between the
first request for service and the completion on the last transfer(Y)

none of the mentioned(N)

620(N)

630(N)

640(Y)

650(N)
224(N)

236(Y)

248(N)

260(N)

SCAN(Y)

C-SCAN(N)

C-LOOK(N)

LOOK(N)

Operating System (Y)

Application Software (N)

Compiler(N)
Loader (N)

Providing resources that are required by the user or applications(N)

Providing initial set-ups(N)

Services that is required for the communication over the network.(N)

All(Y)

Oracle(Y)

Dos(N)

Windows(N)

Linux(N)

Non-Volatile Memory(N)
Volatile Memory(Y)

Both(N)

None(N)

Main memory(N)

Cache(Y)

Secondary memory(N)

Registers(N)

to get and execute the next user-specified command(Y)

to provide the interface between the API and application program(N)

to handle the files in the operating system(N)

none of the mentioned(N)

interface between the hardware and application programs(N)

collection of programs that manages hardware resources(N)

system service provider to the application programs(N)

all of the mentioned(Y)

time sharing systems(Y)

operating systems(N)

multiprocessor systems(N)
multi programming systems(N)

Priority(N)

Round Robin(N)

Shortest Job First(N)

All(Y)

Prevent unauthorized access(N)

Ensure data integrity(N)

Manage resource sharing(N)

All(Y)

Protection deals with internal threats, while security deals with external
threats(Y)
Security is a subset of protection(N)

Protection and security are the same(N)

Protection is for networks, security is for processes(N)

Control access to network resources(Y)

Protect against viruses(N)

Encrypt files on disk(N)

Detect hardware failures(N)

Encryption(N)

Hashing(N)

Signature-based monitoring(Y)
Disk fragmentation(N)

dispatcher(Y)

interrupt(N)

scheduler(N)

none of the mentioned(N)

Turnaround Time(Y)

Waiting Time(N)

Response Time(N)

Through Put(N)

FCFS(Y)

SJF(N)

priority(N)

None of the mentioned(N)

CPU is allocated to the process with highest priority(Y)

CPU is allocated to the process with lowest priority(N)

Equal priority processes cannot be scheduled(N)

None of the mentioned (N)

CPU is allocated to the process with highest priority(Y)

CPU is allocated to the process with lowest priority (N)

Equal priority processes cannot be scheduled(N)

None of the mentioned (N)

round robin scheduling algorithm(Y)

shortest job scheduling algorithm(N)

priority scheduling algorithm(N)

multilevel queue scheduling algorithm(N)

shortest job scheduling algorithm(N)

round robin scheduling algorithm(N)

priority scheduling algorithm(N)

multilevel queue scheduling algorithm(Y)

a process can move to a different classified ready queue(N)

classification of ready queue is permanent(N)

processes are not classified into groups(N)

None of the mentioned(Y)

Multi programming Operating System(Y)

Multi programming (N)

larger memory sized systems(N)

none of the mentioned(N)

CPU & I/O Burst(Y)

I/O & OS Burst(N)

Memory & OS Burst(N)

OS & OS Burst(N)

When a process switches from the running state to the ready stateRead(N)

When a process goes from the running state to the waiting state(Y)
When a process switches from the waiting state to the ready state(N)

All of the mentioned(N)

To execute I/O operations(N)

To manage data transfer between I/O devices and memory(Y)

To control the CPU(N)

To interpret user commands(N)

Store temporary data during I/O operations(Y)

Speed up the CPU clock(N)

Manage virtual memory(N)

Allocate CPU time to processes(N)

Half-duplex communication(N)

Full-duplex communication(Y)

Simplex communication(N)

Synchronous communication(N)

Linear list(N)

Binary tree(N)

Hash table(Y)

Stack(N)

FCFS(N)

SSTF(N)
SCAN(Y)

C-LOOK(N)

To prepare the disk for file storage(N)

To optimize disk access times(N)

To create a file system(N)

To detect and mark bad disk sectors(Y)

File allocation table(N)

Inode(Y)

Directory entry(N)

File Control Block(N)

Managing CPU scheduling(N)

Controlling and coordinating hardware devices(Y)

Allocating memory to processes (N)

Handling user authentication(N)

Interrupt handler(Y)

Device driver(N)

Device Controller(N)

File System(N)

To manage CPU interrupts (N)

To enable device-independent I/O operations(N)

To transfer data directly between memory and I/O devices(Y)

To allocate disk space for files(N)

Optimize data transfer for specific devices (N)

Provide a uniform interface for accessing various devices(Y)

Handle device-specific errors directly (N)

Reduce the load on the CPU during I/O operations (N)

To signal the CPU when an I/O operation is complete(Y)

To increase CPU clock speed(N)

To prevent memory leaks(N)

To execute user commands(N)

Access control lists (ACLs) only(N)

A combination of username and password (Y)

Biometric identifiers like fingerprints(N)

All of these(N)

The CPU and memory(N)

The operating system and user applications(N)

A trusted internal network and an untrusted external network (Y)

Different processes running on the same system(N)

Maximize CPU utilization(N)

Minimize seek time and improve disk performance(Y)

Increase memory access speed(N)

Reduce file fragmentation (N)

critical section(Y)

program(N)

non – critical section(N)

synchronizing (N)

Shortest Seek Time First (SSTF)(N)

First Come, First Served (FCFS)(Y)

SCAN(N)

LOOK(N)

Reduce physical memory requirements for processes(N)

Enhance memory security by isolating processes (Y)

Improve data transfer speeds between memory and disk(N)

Simplify memory allocation for user applications(N)

In any available locations on the disk(N)

Sequentially in consecutive disk blocks(Y)

Scattered across the disk based on an index(N)

Interleaved with data blocks from other files(N)

Store the actual file data(N)

Act as a pointer to the data blocks containing the file(Y)

Define access permissions for the file(N)

Maintain timestamps for file creation and modification(N)

It causes starvation(N)

It leads to the "convoy effect"(Y)

It requires sorting of requests(N)

It is difficult to implement (N)

no resource can be forcibly removed from a process holding it(N)

a process may hold allocated resources while awaiting assignment of other

resources(N)

mutual exclusion(Y)

all of the mentioned(N)

Sectors pre-allocated for temporary files(N)

Unusable disk areas due to physical defects (Y)

Sectors reserved for the file system structure(N)

Areas dedicated to storing the disk controller firmware(N)

The process of arranging, controlling and optimizing work and workloads in a

production process(Y)

Minimizing overall disk arm movement(N)

Reducing rotational latency(N)

Prioritizing high-priority processes (N)

Bit(N)

Byte(N)

Sector(Y)

Track(N)
Platter(N)

Spindle(N)

Read/Write Head(Y)

Actuator Arm(N)

The disk's casing(N)

A circular disk where data is stored magnetically(Y)

A component that moves the read/write head(N)

The power supply of the hard drive(N)

A single file stored on the disk(N)

A circular path on the surface of a disk where data is written(Y)

The gap between two platters(N)

A memory cache used in disk operations (N)

keep the CPU more idle(N)

increase CPU utilization(Y)

decrease CPU utilization(N)

none of the mentioned(N)

the predicted next CPU burst(N)

the inverse of the predicted next CPU burst(N)

the current CPU burst(Y)

anything the user wants(N)

Round Robin(N)

Priority(N)

FCFS(N)

SJF(Y)

lesser prone to deadlocks(N)

more prone to deadlocks(N)

not at all prone to deadlocks(N)

none of the mentioned(Y)

High seek time(N)

Starvation of far-off requests(Y)

It processes requests sequentially(N)

It ignores disk head movement(N)

SSTF(N)

SCAN(Y)

C-SCAN(N)

LOOK(N)

C-SCAN services requests in a circular manner(Y)

SCAN is more efficient than C-SCAN(N)

C-SCAN prioritizes shorter requests(N)

SCAN ignores requests at the end of the disk(N)

Increase CPU performance(N)

Decrease device controller efficiency(N)

Minimize I/O device errors(N)

Improve I/O device responsiveness(Y)

It reduces unnecessary movement of the disk arm(Y)

It serves requests in random order(N)

It prioritizes the shortest seek time first(N)

It avoids starvation completely(N)

Managing computer hardware resources(N)

Running applications and managing processes(N)

Providing user interface and interaction(N)

Managing computer peripherals(Y)

Memory management(N)

File management(N)

Device management(N)
All(Y)

cause the entire process to run along with the other threads(N)

cause the thread to block with the other threads running(N)

cause the entire process to block even if the other threads are available to
run(Y)

none of the mentioned(N)

Real time OS(Y)

Batch OS(N)

Quick sharing OS(N)

Time sharing OS(N)

Have a process running at all time(N)

To increase CPU utilization(Y)

Have multiple programs waiting in a queue ready to run(N)

None of these(N)

Increased Throughput(Y)

Expensive hardware(N)

Operating system(N)

Both a and b(N)

fork()(Y)

new()(N)
create()(N)

None of these(N)

Program counter(Y)

Status register(N)

Instruction register(N)

Program status word(N)

banker’s algorithm(Y)

round-robin algorithm(N)

elevator algorithm(N)

karn’s algorithm(N)
there must be a fixed number of resources to allocate(Y)

resource allocation must be done only once(N)

all deadlocked processes must be aborted(N)

inversion technique can be used(N)

A state where processes wait indefinitely for resources held by others(Y)

A state where processes execute concurrently without any synchronization(N)

A state where processes terminate abruptly due to resource contention(N)

A state where processes are preempted by the operating system(N)

Mutual exclusion(N)

Hold and wait(N)

No preemption(N)

Circular wait(Y)

To represent processes and resources in a system(N)

To visualize circular wait conditions(N)

To depict resource allocation and request relationships(Y)

To prevent mutual exclusion in the system(N)

A directed edge(N)

A cycle(Y)

A vertex(N)

A tree(N)

Deadlock prevention(Y)

Deadlock avoidance(N)

Deadlock detection(N)

Deadlock recovery(N)

Banker\'s algorithm(Y)
Wait for Graph algorithm(N)

Resource Request Algorithm(N)

Circular wait algorithm(N)

A graph representing processes and resources(N)

A graph showing the order of process terminations(N)

A graph indicating the waiting relationships between processes(Y)

A graph illustrating the allocation of resources(N)

To allocate resources in a way that avoids the possibility of deadlock(Y)

To preempt resources from processes to resolve deadlocks(N)

To detect deadlocks and recover from them(N)

To ensure mutual exclusion among processes(N)

To prevent deadlocks from occurring(N)

To identify deadlocks in the system(N)

To restore the system to a consistent state after a deadlock(Y)

To allocate resources to processes in a fair manner(N)

paging (N)

fragmentation (N)

Compaction (N)

Virtual Memory (Y)

Dynamic allocation of memory used by one process to another (N)

Implementing FIFO page replacement algorithm (N)

Dirty bit is associated with each page in order to reduce the page fault service
time (Y)

None(N)

Real-term (N)

Long-term (Y)

Mid-term (N)

Short-term(N)

No mutual exclusion, hold and wait, pre-emption, circular wait (N)

Mutual exclusion, No hold and wait, pre-emption, circular wait (N)

Mutual exclusion, hold and wait, no pre-emption, circular wait (Y)

Mutual exclusion, hold and wait, pre-emption, no circular wait(N)

The deadlock happens (N)

The segmentation starts (N)

The page is found in the memory (N)

The page is not found in the memory(Y)

Rectify deadlock(N)

Detect deadlock (N)

Prevent deadlock (N)

Solve deadlock(Y)

a) Write(N)

Execute (N)

Stop (Y)

Read(N)

19thAugust88 (N)

Delhi88 (N)

P@assw0rd (Y)

!augustdelh(N)

RADIUS and RSA (N)

3 way handshaking with syn (N)

Multilayered protection for securing resources (N)

Deals with privileges and rights (Y)

Virus (N)

Worm (Y)

Threat (N)

None.(N)

logic bomb (Y)

trap door (N)

code stacker (N)

none of the mentioned(N)

Windows 10(N)

Linux(N)
macOS(N)

All(Y)

Process management(N)

Memory management(N)

Hardware manufacturing(Y)

File management(N)

Batch Operating System(N)

Network Operating System(N)

Real-Time Operating System(Y)

Multi-user Operating System(N)

CPU time is divided equally among users(Y)

Each user gets exclusive access to the CPU(N)

It does not support multiple users(N)

It cannot execute multiple processes at the same time(N)

Apple(N)

Google(N)

Samsung(Y)

Microsoft(N)

Allow user applications to interact with the hardware(N)

Handle system interruptions(N)

Enable communication between processes(N)

All(Y)

Java and C++(N)

C, C++, HTML5, and JavaScript(Y)

Python and Java(N)

Ruby and PHP(N)

Divides the kernel into separate modules(N)

Operates in a layered fashion(N)

Has all its code in a single address space(Y)

Uses microservices architecture(N)

Manage hardware resources(Y)

Provide a user interface(N)

Control network communication(N)

Process data from applications(N)

File system(N)

Device drivers(N)

Application programs(Y)

Memory manager(N)

Windows(N)

Linux(N)
Android(Y)

Ubuntu(N)

Desktop computers(N)

Smartphones and Tablets(N)

Wearable devices, Smart TVs, and IoT(Y)

Servers(N)

Storing system updates(N)

Distributing Tizen OS updates(N)

Downloading and purchasing Tizen applications(Y)

Managing device settings(N)

Communication between hardware and software(N)

Memory management(N)

File system management(Y)

Process scheduling(N)

Real-time OS(N)

Distributed OS(Y)

Multi-user OS(N)

Single-user OS(N)