Cauvery Institute of Technology, Mandya CET Code: C557MC

Operating System Concepts

Process

Basics: -

What is an operating system?

a) interface between the hardware and application programs
b) collection of programs that manages hardware resources
c) system service provider to the application programs
d) all of the mentioned

What is the main function of the command interpreter?

a) to provide the interface between the API and application program
b) to handle the files in the operating system
c) to get and execute the next user-specified command
d) none of the mentioned

In Operating Systems, which of the following is/are CPU scheduling algorithms?

a) Priority
b) Round Robin
c) Shortest Job First
d) All of the mentioned

CPU scheduling is the basis of ___________

a) multiprogramming operating systems
b) larger memory sized systems
c) multiprocessor systems
d) none of the mentioned

Which one of the following errors will be handle by the operating system?
a) lack of paper in printer
b) connection failure in the network
c) power failure
d) all of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 1
Cauvery Institute of Technology, Mandya CET Code: C557MC

If a process fails, most operating system write the error information to a ______
a) new file
b) another running process
c) log file
d) none of the mentioned

What does OS X has?

a) monolithic kernel with modules
b) microkernel
c) monolithic kernel
d) hybrid kernel

In operating system, each process has its own __________

a) open files
b) pending alarms, signals, and signal handlers
c) address space and global variables
d) all of the mentioned

For an effective operating system, when to check for deadlock?

a) every time a resource request is made at fixed time intervals
b) at fixed time intervals
c) every time a resource request is made
d) none of the mentioned

A deadlock avoidance algorithm dynamically examines the __________ to ensure that a

circular wait condition can never exist.
a) operating system
b) resources
c) system storage state
d) resource allocation state

The operating system is responsible for?

a) bad-block recovery
b) booting from disk
c) disk initialization
d) all of the mentioned

The priority of a process will ______________ if the scheduler assigns it a static priority.
a) depends on the operating system
b) change
c) remain unchanged
d) none of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 2
Cauvery Institute of Technology, Mandya CET Code: C557MC

The information about all files is kept in ____________

a) operating system
b) separate directory structure
c) swap space
d) none of the mentioned

To recover from failures in the network operations _____________ information may be

maintained.
a) operating system
b) ip address
c) stateless
d) state

Whenever a process needs I/O to or from a disk it issues a ______________

a) system call to the operating system
b) a special procedure
c) system call to the CPU
d) all of the mentioned

Network operating system runs on ___________

a) every system in the network
b) server
c) both server and every system in the network
d) none of the mentioned

In Unix, which system call creates the new process?

a) create
b) fork
c) new
d) none of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 3
Cauvery Institute of Technology, Mandya CET Code: C557MC

Process Management: -

The systems which allow only one process execution at a time, are called __________
a) uniprogramming systems
b) uniprocessing systems
c) unitasking systems
d) none of the mentioned

A process can be terminated due to __________

a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned

What is interprocess communication?

a) communication within the process
b) communication between two process
c) communication between two threads of same process
d) none of the mentioned

A set of processes is deadlock if __________

a) each process is blocked and will remain so forever
b) each process is terminated
c) all processes are trying to kill each other
d) none of the mentioned

The address of the next instruction to be executed by the current process is provided by
the __________
a) CPU registers
b) Program counter
c) Process stack
d) Pipe

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 4
Cauvery Institute of Technology, Mandya CET Code: C557MC

Process Control Block: -

A Process Control Block(PCB) does not contain which of the following?

a) Code
b) Stack
c) Bootstrap program
d) Data

The number of processes completed per unit time is known as __________

a) Output
b) Throughput
c) Efficiency
d) Capacity

The state of a process is defined by __________

a) the final activity of the process
b) the activity just executed by the process
c) the activity to next be executed by the process
d) the current activity of the process

Which of the following is not the state of a process?

a) New
b) Old
c) Waiting
d) Running

What is a Process Control Block?

a) Process type variable
b) Data Structure
c) A secondary storage section
d) A Block in memory

A single thread of control allows the process to perform __________

a) only one task at a time
b) multiple tasks at a time
c) only two tasks at a time
d) all of the mentioned

What is the objective of multiprogramming?

a) Have a process running at all time
b) Have multiple programs waiting in a queue ready to run
c) To increase CPU utilization
d) None of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 5
Cauvery Institute of Technology, Mandya CET Code: C557MC

Process Scheduling Queue: -

When the process issues an I/O request __________

a) It is placed in an I/O queue
b) It is placed in a waiting queue
c) It is placed in the ready queue
d) It is placed in the Job queue

What will happen when a process terminates?

a) It is removed from all queues
b) It is removed from all, but the job queue
c) Its process control block is de-allocated
d) Its process control block is never de-allocated

The primary distinction between the short term scheduler and the long term scheduler is
__________
a) The length of their queues
b) The type of processes they schedule
c) The frequency of their execution
d) None of the mentioned

In a multiprogramming environment __________

a) the processor executes more than one process at a time
b) the programs are developed by more than one person
c) more than one process resides in the memory
d) a single user can execute many programs at the same time

Process Synchronization: -

Which process can be affected by other processes executing in the system?

a) cooperating process
b) child process
c) parent process
d) init process

When several processes access the same data concurrently and the outcome of the
execution depends on the particular order in which the access takes place is called
________
a) dynamic condition
b) race condition
c) essential condition
d) critical condition

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 6
Cauvery Institute of Technology, Mandya CET Code: C557MC

If a process is executing in its critical section, then no other processes can be executing in
their critical section. What is this condition called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion

Which one of the following is a synchronization tool?

a) thread
b) pipe
c) semaphore
d) socket

Mutual exclusion can be provided by the __________

a) mutex locks
b) binary semaphores
c) both mutex locks and binary semaphores
d) none of the mentioned

Process synchronization can be done on __________

a) hardware level
b) software level
c) both hardware and software level
d) none of the mentioned

A monitor is a module that encapsulates __________

a) shared data structures
b) procedures that operate on shared data structure
c) synchronization between concurrent procedure invocation
d) all of the mentioned

Process Creation: -

A parent process calling _____ system call will be suspended until children processes
terminate.
a) wait
b) fork
c) exit
d) exec

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 7
Cauvery Institute of Technology, Mandya CET Code: C557MC

Cascading termination refers to termination of all child processes if the parent process
terminates ______
a) Normally
b) Abnormally
c) Normally or abnormally
d) None of the mentioned

In UNIX, each process is identified by its __________

a) Process Control Block
b) Device Queue
c) Process Identifier
d) None of the mentioned

2. Distributed Communication
Remote Procedure Call: -

Remote Procedure Calls are used ____________

a) for communication between two processes remotely different from each other on the
same system
b) for communication between two processes on the same system
c) for communication between two processes on separate systems
d) none of the mentioned

To differentiate the many network services a system supports ______ are used.
a) Variables
b) Sockets
c) Ports
d) Service names

To resolve the problem of data representation on different systems RPCs define

_____________
a) machine dependent representation of data
b) machine representation of data
c) machine-independent representation of data
d) none of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 8
Cauvery Institute of Technology, Mandya CET Code: C557MC

What is the full form of RMI?

a) Remote Memory Installation
b) Remote Memory Invocation
c) Remote Method Installation
d) Remote Method Invocation

Structures: -

The initial program that is run when the computer is powered up is called __________
a) boot program
b) bootloader
c) initializer
d) bootstrap program

How does the software trigger an interrupt?

a) Sending signals to CPU through bus
b) Executing a special operation called system call
c) Executing a special program called system program
d) Executing a special program called interrupt trigger program

What is a trap/exception?
a) hardware generated interrupt caused by an error
b) software generated interrupt caused by an error
c) user generated interrupt caused by an error
d) none of the mentioned

What is an ISR?
a) Information Service Request
b) Interrupt Service Request
c) Interrupt Service Routine
d) Information Service Routine

What is an interrupt vector?

a) It is an address that is indexed to an interrupt handler
b) It is a unique device number that is indexed by an address
c) It is a unique identity given to an interrupt
d) None of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 9
Cauvery Institute of Technology, Mandya CET Code: C557MC

DMA is used for __________

a) High speed devices(disks and communications network)
b) Low speed devices
c) Utilizing CPU cycles
d) All of the mentioned

How does the Hardware trigger an interrupt?

a) Sending signals to CPU through a system bus
b) Executing a special program called interrupt program
c) Executing a special program called system program
d) Executing a special operation called system call

Which operation is performed by an interrupt handler?

a) Saving the current state of the system
b) Loading the interrupt handling code and executing it
c) Once done handling, bringing back the system to the original state it was before the
interrupt occurred
d) All of the mentioned

3. CPU Scheduling
CPU Scheduling: -

Which module gives control of the CPU to the process selected by the short-term
scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned

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 queue
c) execution queue
d) process queue

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 10
Cauvery Institute of Technology, Mandya CET Code: C557MC

In priority scheduling algorithm ____________

a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) Equal priority processes can not be scheduled
d) None of the mentioned

Which algorithm is defined in Time quantum?

a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

Process are classified into different groups in ____________

a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

Which one of the following can not be scheduled by the kernel?

a) kernel level thread
b) user level thread
c) process
d) none of the mentioned

CPU Scheduling Benefits: -

CPU scheduling is the basis of ___________

a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
d) none of the mentioned

With multiprogramming ______ is used productively.

a) time
b) space
c) money
d) all of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 11
Cauvery Institute of Technology, Mandya CET Code: C557MC

What are the two steps of a process execution?

a) I/O & OS Burst
b) CPU & I/O Burst
c) Memory & I/O Burst
d) OS & Memory Burst

A process is selected from the ______ queue by the ________ scheduler, to be executed.
a) blocked, short term
b) wait, long term
c) ready, short term
d) ready, long term

In the following cases non – preemptive scheduling occurs?

a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state
c) When a process switches from the waiting state to the ready state
d) All of the mentioned

The switching of the CPU from one process or thread to another is called ____________
a) process switch
b) task switch
c) context switch
d) all of the mentioned

Scheduling is done so as to ____________

a) increase CPU utilization
b) decrease CPU utilization
c) keep the CPU more idle
d) none of the mentioned

What is Turnaround time?

a) the total waiting time for a process to finish execution
b) the total time spent in the ready queue
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process

What is Waiting time?

a) the total time in the blocked and waiting queues
b) the total time spent in the ready queue
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 12
Cauvery Institute of Technology, Mandya CET Code: C557MC

What is Response time?

a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is produced
c) the total time taken from submission time till the response is output
d) none of the mentioned

CPU Scheduling Algorithms: -

Round robin scheduling falls under the category of ____________

a) Non-preemptive scheduling
b) Preemptive scheduling
c) All of the mentioned
d) None of the mentioned

Complex scheduling algorithms ____________

a) are very appropriate for very large computers
b) use minimal resources
c) use many resources
d) all of the mentioned

What is FIFO algorithm?

a) first executes the job that came in last in the queue
b) first executes the job that came in first in the queue
c) first executes the job that needs minimal processor
d) first executes the job that has maximum processor needs

What is Scheduling?
a) allowing a job to use the processor
b) making proper use of processor
c) all of the mentioned
d) none of the mentioned

Which is the most optimal scheduling algorithm?

a) FCFS – First come First served
b) SJF – Shortest Job First
c) RR – Round Robin
d) None of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 13
Cauvery Institute of Technology, Mandya CET Code: C557MC

Choose one of the disadvantages of the priority scheduling algorithm?

a) it schedules in a very complex manner
b) its scheduling takes up a lot of time
c) it can lead to some low priority process waiting indefinitely for the CPU
d) none of the mentioned

4. Process Synchronization

Critical Section Problem: -

Concurrent access to shared data may result in ____________

a) data consistency
b) data insecurity
c) data inconsistency
d) none of the mentioned

The segment of code in which the process may change common variables, update tables,
write into files is known as ____________
a) program
b) critical section
c) non – critical section
d) synchronizing

Which of the following conditions must be satisfied to solve the critical section
problem?
a) Mutual Exclusion
b) Progress
c) Bounded Waiting
d) All of the mentioned

A minimum of _____ variable(s) is/are required to be shared between processes to

solve the critical section problem.
a) one
b) two
c) three
d) four

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 14
Cauvery Institute of Technology, Mandya CET Code: C557MC

Semaphores: -

An un-interruptible unit is known as ____________

a) single
b) atomic
c) static
d) none of the mentioned

Semaphore is a/an _______ to solve the critical section problem.

a) hardware for a system
b) special program for a system
c) integer variable
d) none of the mentioned

What are the two atomic operations permissible on semaphores?

a) wait and signal
b) stop and wait
c) hold and signal
d) none of the mentioned

The signal operation of the semaphore basically works on the basic _______ system call.
a) continue()
b) wakeup()
c) getup()
d) start()

What is a semaphore?
a) is a binary mutex
b) must be accessed from only one process
c) can be accessed from multiple processes
d) none of the mentioned

What are the two kinds of semaphores?

a) mutex & counting
b) binary & counting
c) counting & decimal
d) decimal & binary

The bounded buffer problem is also known as ____________

a) Readers – Writers problem
b) Dining – Philosophers problem
c) Producer – Consumer problem
d) None of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 15
Cauvery Institute of Technology, Mandya CET Code: C557MC

A deadlock free solution to the dining philosophers problem ____________

a) necessarily eliminates the possibility of starvation
b) does not necessarily eliminate the possibility of starvation
c) eliminates any possibility of any kind of problem further
d) none of the mentioned

Monitors: -

A monitor is characterized by ____________

a) a set of programmer defined operators
b) an identifier
c) the number of variables in it
d) all of the mentioned

The monitor construct ensures that ____________

a) only one process can be active at a time within the monitor
b) n number of processes can be active at a time within the monitor (n being greater than
1)
c) the queue has only one process in it at a time
d) all of the mentioned

If no process is suspended, the signal operation ____________

a) puts the system into a deadlock state
b) suspends some default process execution
c) nothing happens
d) the output is unpredictable

5. Deadlocks

Deadlock: -

What is a reusable resource?

a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 16
Cauvery Institute of Technology, Mandya CET Code: C557MC

A system is in the safe state if ____________

a) the system can allocate resources to each process in some order and still avoid a
deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned

Which one of the following is the deadlock avoidance algorithm?

a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm

For an effective operating system, when to check for deadlock?

a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mentioned

Which one of the following is a visual ( mathematical ) way to determine the deadlock
occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned

To avoid deadlock ____________

a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used

Deadlock Prevention: -

The number of resources requested by a process ____________

a) must always be less than the total number of resources available in the system
b) must always be equal to the total number of resources available in the system
c) must not exceed the total number of resources available in the system
d) must exceed the total number of resources available in the system

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 17
Cauvery Institute of Technology, Mandya CET Code: C557MC

The request and release of resources are ___________

a) command line statements
b) interrupts
c) system calls
d) special programs

What are Multithreaded programs?

a) lesser prone to deadlocks
b) more prone to deadlocks
c) not at all prone to deadlocks
d) none of the mentioned

Deadlock Avoidance: -

Each request requires that the system consider the _____________ to decide whether the
current request can be satisfied or must wait to avoid a future possible deadlock.
a) resources currently available
b) processes that have previously been in the system
c) resources currently allocated to each process
d) future requests and releases of each process

A deadlock avoidance algorithm dynamically examines the __________ to ensure that a

circular wait condition can never exist.
a) resource allocation state
b) system storage state
c) operating system
d) resources

A state is safe, if ____________

a) the system does not crash due to deadlock occurrence
b) the system can allocate resources to each process in some order and still avoid a
deadlock
c) the state keeps the system protected and safe
d) all of the mentioned

All unsafe states are ____________

a) deadlocks
b) not deadlocks
c) fatal
d) none of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 18
Cauvery Institute of Technology, Mandya CET Code: C557MC

Deadlock Detection: -

The wait-for graph is a deadlock detection algorithm that is applicable when __________
a) all resources have a single instance
b) all resources have multiple instances
c) all resources have a single 7 multiple instances
d) all of the mentioned

If deadlocks occur frequently, the detection algorithm must be invoked ________

a) rarely
b) frequently
c) rarely & frequently
d) none of the mentioned

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2

units then, deadlock ____________
a) can never occur
b) may occur
c) has to occur
d) none of the mentioned

Deadlock Recovery: -

The two ways of aborting processes and eliminating deadlocks are ____________
a) Abort all deadlocked processes
b) Abort all processes
c) Abort one process at a time until the deadlock cycle is eliminated
d) All of the mentioned

To _______ to a safe state, the system needs to keep more information about the states of
processes.
a) abort the process
b) roll back the process
c) queue the process
d) none of the mentioned

What is the solution to starvation?

a) the number of rollbacks must be included in the cost factor
b) the number of resources must be included in resource preemption
c) resource preemption be done instead
d) all of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 19
Cauvery Institute of Technology, Mandya CET Code: C557MC

6. Memory Management

Swapping Process: -

What is Address Binding?

a) going to an address in memory
b) locating an address with the help of another address
c) binding two addresses together to form a new address in a different memory space
d) a mapping from one address space to another

Binding of instructions and data to memory addresses can be done at ____________

a) Compile time
b) Load time
c) Execution time
d) All of the mentioned

What is Dynamic loading?

a) loading multiple routines dynamically
b) loading a routine only when it is called
c) loading multiple routines randomly
d) none of the mentioned

The idea of overlays is to ____________

a) data that are needed at any given time
b) enable a process to be larger than the amount of memory allocated to it
c) keep in memory only those instructions
d) all of the mentioned

The ___________ must design and program the overlay structure.

a) programmer
b) system architect
c) system designer
d) none of the mentioned

The ___________ swaps processes in and out of the memory.

a) Memory manager
b) CPU
c) CPU manager
d) User

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 20
Cauvery Institute of Technology, Mandya CET Code: C557MC

The address generated by the CPU is referred to as ____________

a) Physical address
b) Logical address
c) Neither physical nor logical
d) None of the mentioned

The address loaded into the memory address register of the memory is referred to as
____________
a) Physical address
b) Logical address
c) Neither physical nor logical
d) None of the mentioned

The run time mapping from virtual to physical addresses is done by a hardware device
called the ____________
a) Virtual to physical mapper
b) Memory management unit
c) Memory mapping unit
d) None of the mentioned

The base register is also known as the ____________

a) basic register
b) regular register
c) relocation register
d) delocation register

The size of a process is limited to the size of ____________

a) physical memory
b) external storage
c) secondary storage
d) none of the mentioned

Swapping requires a _________

a) motherboard
b) keyboard
c) monitor
d) backing store

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 21
Cauvery Institute of Technology, Mandya CET Code: C557MC

The ________ consists of all processes whose memory images are in the backing store or
in memory and are ready to run.
a) wait queue
b) ready queue
c) cpu
d) secondary storage

The major part of swap time is _______ time.

a) waiting
b) transfer
c) execution
d) none of the mentioned

Swap space is allocated ____________

a) as a chunk of disk
b) separate from a file system
c) into a file system
d) all of the mentioned

Memory Management: -

CPU fetches the instruction from memory according to the value of ____________
a) program counter
b) status register
c) instruction register
d) program status word

A memory buffer used to accommodate a speed differential is called ____________

a) stack pointer
b) cache
c) accumulator
d) disk buffer

Which one of the following is the address generated by CPU?

a) physical address
b) absolute address
c) logical address
d) none of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 22
Cauvery Institute of Technology, Mandya CET Code: C557MC

Run time mapping from virtual to physical address is done by ____________

a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned

Memory management technique in which system stores and retrieves data from
secondary storage for use in main memory is called?
a) fragmentation
b) paging
c) mapping
d) none of the mentioned

The address of a page table in memory is pointed by ____________

a) stack pointer
b) page table base register
c) page register
d) program counter

Program always deals with ____________

a) logical address
b) absolute address
c) physical address
d) relative address

The page table contains ____________

a) base address of each page in physical memory
b) page offset
c) page size
d) none of the mentioned

Operating System maintains the page table for ____________

a) each process
b) each thread
c) each instruction
d) each address

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 23
Cauvery Institute of Technology, Mandya CET Code: C557MC

Memory Allocation: -

The main memory accommodates ____________

a) operating system
b) cpu
c) user processes
d) all of the mentioned

In contiguous memory allocation ____________

a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned

The operating system and the other processes are protected from being modified by an
already running process because ____________
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the relocation and
limit registers

In internal fragmentation, memory is internal to a partition and ____________

a) is being used
b) is not being used
c) is always used
d) none of the mentioned

A solution to the problem of external fragmentation is ____________

a) compaction
b) larger memory space
c) smaller memory space
d) none of the mentioned

External fragmentation exists when?

a) enough total memory exists to satisfy a request but it is not contiguous
b) the total memory is insufficient to satisfy a request
c) a request cannot be satisfied even when the total memory is free
d) none of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 24
Cauvery Institute of Technology, Mandya CET Code: C557MC

Paging: -

Physical memory is broken into fixed-sized blocks called ________

a) frames
b) pages
c) backing store
d) none of the mentioned

Logical memory is broken into blocks of the same size called _________
a) frames
b) pages
c) backing store
d) none of the mentioned

Every address generated by the CPU is divided into two parts. They are ____________
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset

The __________ is used as an index into the page table.

a) frame bit
b) page number
c) page offset
d) frame offset

The size of a page is typically ____________

a) varied
b) power of 2
c) power of 4
d) none of the mentioned

With paging there is no ________ fragmentation.

a) internal
b) external
c) either type of
d) none of the mentioned

Paging increases the ______ time.

a) waiting
b) execution
c) context – switch
d) all of the mentioned

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 25
Cauvery Institute of Technology, Mandya CET Code: C557MC

For every process there is a __________

a) page table
b) copy of page table
c) pointer to page table
d) all of the mentioned

Each entry in a translation lookaside buffer (TLB) consists of ____________

a) key
b) value
c) bit value
d) constant

The percentage of times a page number is found in the TLB is known as ____________
a) miss ratio
b) hit ratio
c) miss percent
d) none of the mentioned

Illegal addresses are trapped using the _____ bit.

a) error
b) protection
c) valid – invalid
d) access

Segmentation: -

In segmentation, each address is specified by ____________

a) a segment number & offset
b) an offset & value
c) a value & segment number
d) a key & value

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 26
Cauvery Institute of Technology, Mandya CET Code: C557MC

7. I/O Systems
I/O System Interface: -

If one or more devices use a common set of wires to communicate with the computer
system, the connection is called ______
a) CPU
b) Monitor
c) Wirefull
d) Bus

A ____ a set of wires and a rigidly defined protocol that specifies a set of messages that
can be sent on the wires.
a) port
b) node
c) bus
d) none of the mentioned

A ________ is a collection of electronics that can operate a port, a bus, or a device.

a) controller
b) driver
c) host
d) bus

An I/O port typically consists of four registers status, control, ________ and ________
registers.
a) system in, system out
b) data in, data out
c) flow in, flow out
d) input, output

The hardware mechanism that allows a device to notify the CPU is called _______
a) polling
b) interrupt
c) driver
d) controlling

Prepared by: Amos R,

Associate Professor & Head,
Ph: 9844035206, [email protected] Page 27