Operating System Set 16 MCQs

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

stack pointer

page table base register

page register

program counter

Q2 | Program always deals with

logical address

absolute address

physical address

relative address

Q3 | The page table contains

base address of each page in physical memory

page offset

page size

none of the mentioned

Q4 | What is compaction?

a technique for overcoming internal fragmentation

a paging technique

a technique for overcoming external fragmentation

a technique for overcoming fatal error

Q5 | Operating System maintains the page table for

each process

each thread

each instruction

each address

Q6 | The main memory accommodates

operating system

cpu

user processes

all of the mentioned

Q7 | What is the operating system?

in the low memory

in the high memory

either low or high memory (depending on the location of interrupt vector)

none of the mentioned

Q8 | In contiguous memory allocation

each process is contained in a single contiguous section of memory

all processes are contained in a single contiguous section of memory

the memory space is contiguous

none of the mentioned

Q9 | The relocation register helps in

providing more address space to processes

a different address space to processes

to protect the address spaces of processes

none of the mentioned

Q10 | The operating system and the other processes are protected from being modified by an already running process because

they are in different memory spaces

they are in different logical addresses

they have a protection algorithm

every address generated by the cpu is being checked against the relocation and limit registers

Q11 | Transient operating system code is code that

is not easily accessible

comes and goes as needed

stays in the memory always

never enters the memory space

Q12 | Using transient code, the size of the operating system during program execution.

increases

decreases

changes

maintains

Q13 | In fixed size partition, the degree of multiprogramming is bounded by

the number of partitions

the cpu utilization

the memory size

all of the mentioned

Q14 | The first fit, best fit and worst fit are strategies to select a

process from a queue to put in memory

processor to run the next process

free hole from a set of available holes

all of the mentioned

Q15 | In internal fragmentation, memory is internal to a partition and

is being used

is not being used

is always used

none of the mentioned

Q16 | A solution to the problem of external fragmentation is

compaction

larger memory space

smaller memory space

none of the mentioned

Q17 | Another solution to the problem of external fragmentation problem is to

permit the logical address space of a process to be noncontiguous

permit smaller processes to be allocated memory at last

permit larger processes to be allocated memory at last

all of the mentioned

Q18 | If relocation is static and is done at assembly or load time, compaction

cannot be done

must be done

must not be done

can be done

Q19 | The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is

the cost incurred

the memory used

the cpu used

all of the mentioned

Q20 | External fragmentation will not occur when?

first fit is used

best fit is used

worst fit is used

no matter which algorithm is used, it will always occur

Q21 | Sometimes the overhead of keeping track of a hole might be

larger than the memory

larger than the hole itself

very small

all of the mentioned

Q22 | When the memory allocated to a process is slightly larger than the process, then

internal fragmentation occurs

external fragmentation occurs

both internal and external fragmentation occurs

neither internal nor external fragmentation occurs

Q23 | Physical memory is broken into fixed-sized blocks called

frames

pages

backing store

none of the mentioned

Q24 | Logical memory is broken into blocks of the same size called

frames

pages

backing store

none of the mentioned

Q25 | Every address generated by the CPU is divided into two parts. They are

frame bit & page number

page number & page offset

page offset & frame bit

frame offset & page offset