Deck 3: Operating System and Process Management: Part B

Question 1

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

Answer 1

multilevel queue scheduling algorithm

Question 2

In multilevel feedback scheduling algorithm

A)a process can move to a different classified ready queue
B)classification of ready queue is permanent
C)processes are not classified into groups
D)none of the mentioned

Answer 2

a process can move to a different classified ready queue

Question 3

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

Answer 3

user level thread

Question 4

What is the 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

Question 5

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

A)mutual exclusion
B)a process may hold allocated resources while awaiting assignment of other resources
C)no resource can be forcibly removed from a process holding it
D)all of the mentioned

Question 6

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)both (a) and (b)
D)none of the mentioned

Question 7

The circular wait condition can be prevented by

A)defining a linear ordering of resource types
B)using thread
C)using pipes
D)all of the mentioned

Question 8

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

Question 9

What is the drawback of banker's algorithm?

A)in advance processes rarely know that how much resource they will need
B)the number of processes changes as time progresses
C)resource once available can disappear
D)all of the mentioned

Question 10

For effective operating system, when to check for deadlock?

A)every time a resource request is made
B)at fixed time intervals
C)both (a) and (b)
D)none of the mentioned

Question 11

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

A)deadlock
B)starvation
C)inversion
D)aging

Question 12

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

Question 13

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

Question 14

CPU fetches the instruction from memory according to the value of

A)program counter
B)status register
C)instruction register
D)program status word

Question 15

A memory buffer used to accommodate a speed differential is called

A)stack pointer
B)cache
C)accumulator
D)disk buffer

Question 16

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

Question 17

Run time mapping from virtual to physical address is done by

A)memory management unit
B)cpu
C)pci
D)none of the mentioned

Question 18

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

Question 19

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

Question 20

Program always deals with

A)logical address
B)absolute address
C)physical address
D)relative address

Question 21

The page table contains

A)base address of each page in physical memory
B)page offset
C)page size
D)none of the mentioned

Question 22

What is compaction?

A)a technique for overcoming internal fragmentation
B)a paging technique
C)a technique for overcoming external fragmentation
D)a technique for overcoming fatal error

Question 23

Operating System maintains the page table for

A)each process
B)each thread
C)each instruction
D)each address

Question 24

In segmentation, each address is specified by :

A)a segment number
B)an offset
C)a value
D)a key

Question 25

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

A)one address, page number, offset
B)one offset, page number, address
C)page number, offset, address
D)none of these