Advanced Operating System Set 3 MCQs

Q1 | Process are classified into different groups in

shortest job scheduling algorithm

round robin scheduling algorithm

priority scheduling algorithm

multilevel queue scheduling algorithm

Q2 | In multilevel feedback scheduling algorithm

a process can move to a different classified ready queue

classification of ready queue is permanent

processes are not classified into groups

none of the mentioned

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

kernel level thread

user level thread

process

none of the mentioned

Q4 | What is the reusable resource?

that can be used by one process at a time and is not depleted by that use

that can be used by more than one process at a time

that can be shared between various threads

none of the mentioned

Q5 | Which of the following condition is required for deadlock to be possible?

mutual exclusion

a process may hold allocated resources while awaiting assignment of other resources

no resource can be forcibly removed from a process holding it

all of the mentioned

Q6 | A system is in the safe state if

the system can allocate resources to each process in some order and still avoid a deadlock

there exist a safe sequence

both (a) and (b)

none of the mentioned

Q7 | The circular wait condition can be prevented by

defining a linear ordering of resource types

using thread

using pipes

all of the mentioned

Q8 | Which one of the following is the deadlock avoidance algorithm?

banker’s algorithm

round-robin algorithm

elevator algorithm

karn’s algorithm

Q9 | What is the drawback of banker’s algorithm?

in advance processes rarely know that how much resource they will need

the number of processes changes as time progresses

resource once available can disappear

all of the mentioned

Q10 | For effective operating system, when to check for deadlock?

every time a resource request is made

at fixed time intervals

both (a) and (b)

none of the mentioned

Q11 | A problem encountered in multitasking when a process is perpetually denied necessary resources is called

deadlock

starvation

inversion

aging

Q12 | Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

resource allocation graph

starvation graph

inversion graph

none of the mentioned

Q13 | To avoid deadlock

there must be a fixed number of resources to allocate

resource allocation must be done only once

all deadlocked processes must be aborted

inversion technique can be used

Q14 | CPU fetches the instruction from memory according to the value of

program counter

status register

instruction register

program status word

Q15 | A memory buffer used to accommodate a speed differential is called

stack pointer

cache

accumulator

disk buffer

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

physical address

absolute address

logical address

none of the mentioned

Q17 | Run time mapping from virtual to physical address is done by

memory management unit

cpu

pci

none of the mentioned

Q18 | Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

fragmentation

paging

mapping

none of the mentioned

Q19 | The address of a page table in memory is pointed by

stack pointer

page table base register

page register

program counter

Q20 | Program always deals with

logical address

absolute address

physical address

relative address

Q21 | The page table contains

base address of each page in physical memory

page offset

page size

none of the mentioned

Q22 | What is compaction?

a technique for overcoming internal fragmentation

a paging technique

a technique for overcoming external fragmentation

a technique for overcoming fatal error

Q23 | Operating System maintains the page table for

each process

each thread

each instruction

each address

Q24 | In segmentation, each address is specified by :

a segment number

an offset

a value

a key

Q25 | In paging the user provides only ________, which is partitioned by the hardware into ________ and ______.

one address, page number, offset

one offset, page number, address

page number, offset, address

none of these