Operating System Quiz 2

Operating System

Operating System Quiz

Operating System Quiz

Operating Systems Series 3

Physical memory is broken into fixed-sized blocks called ________.
a) frames
b) pages
c) backing store
d) None of these

The __________ is used as an index into the page table.
a) frame bit
b) page number
c) page offset
d) frame offset

The _____ table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame

If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order _____ bits of a logical address designate the page number, and the ____ low order bits designate the page offset.
a) m, n
b) n, m
c) m – n, m
d) m – n, n

For every process there is a __________.
a) page table
b) copy of page table
c) pointer to page table
d) All of these

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

 Turnaround time is :
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

 If a page number is not found in the TLB, then it is known as a :
a) TLB miss
b) buffer miss
c) TLB hit

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 these

Memory protection in a paged environment is accomplished by :
a) protection algorithm with each page
b) restricted access rights to users
c) restriction on page visibility
d) protection bit with each page

 Illegal addresses are trapped using the _____ bit.
a) error
b) protection
c) valid – invalid
d) access

In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is :
a) 3.0 ns
b) 68.0 ns
c) 68.5 ns
d) 78.5 ns

Round robin scheduling falls under the category of :
a) Non preemptive scheduling
b) Preemptive scheduling
c) None of these

With round robin scheduling algorithm in a time shared system,
a) using very large time slices converts it into First come First served scheduling algorithm
b) using very small time slices converts it into First come First served scheduling algorithm
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm

Operating System Series 2

With relocation and limit registers, each logical address must be _______ the limit register.
a) less than
b) equal to
c) greater than
d) None of these

The first fit, best fit and worst fit are strategies to select a ______.
a) process from a queue to put in memory
b) processor to run the next process
c) free hole from a set of available holes
d) All of these

Which of the following do not belong to queues for processes ?
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready 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

In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :
a) Blocked state
b) Ready state
c) Suspended state
d) Terminated state

 The context of a process in the PCB of a process does not contain :
a) the value of the CPU registers
b) the process state
c) memory-management information
d) context switch time

 Which of the following state transitions is not possible ?
a) blocked to running
b) ready to running
c) blocked to ready
d) running to blocked

 __________ is generally faster than _________ and _________.
a) first fit, best fit, worst fit
b) best fit, first fit, worst fit
c) worst fit, best fit, first fit
d) None of these

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 these

External fragmentation will not occur when :
a) first fit is used
b) best fit is used
c) worst fit is used
d) no matter which algorithm is used, it will always occur

The interval from the time of submission of a process to the time of completion is termed as
a) waiting time
b) turnaround time
c) response time
d) throughput

Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned

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

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of
a) all process
b) currently running process
c) parent process
d) init process

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

Operating System Series 1

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

 In Unix, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned

What is the ready state of a process?
a) when process is scheduled to run after some execution
b) when process is unable to run until some task has been completed
c) when process is using the CPU
d) none 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

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

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

Operating System maintains the page table for
a) each process
b) each thread
c) each instruction
d) each address

The number of processes completed per unit time is known as __________.
a) Output
b) Throughput
c) Efficiency
d) Capacity

The Process Control Block is :
a) Process type variable
b) Data Structure
c) a secondary storage section
d) a Block in memory

The degree of multi-programming is :
a) the number of processes executed per unit time
b) the number of processes in the ready queue
c) the number of processes in the I/O queue
d) the number of processes in memory

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 these