Wednesday, 11 July 2012

[VUSR] 65937 CS604 Quiz No. 3 dated 11, July 2012

CS04 – operating system

Quiz #3 July 11, 2012

Solved By Maria Hafeez

 

The collection of process that is waiting on the disk to be brought into the memory for execution forms the _______

Input queue      

Output queue          

Both of the         

 None of the above

_____is used due to un-used space in fixed size blocks/ pages.

Internal fragmentation

 External fragmentation       

  Paging         

MVT   

Fragmentation when using ICMP for path MTU should be avoided.

Select correct option:

 True

 False

Static routing

Variable name are _____ address.

Physical     

Reloadable       

  Relative     

Symbolic          

Secondary storage memory devices have ____ memory.

Volatile 

Permanent and non volatile 

 Temporary      

None of the   

 

_____is caused due to un-used in physical memory.

 

Internal fragmentation   

External fragmentation  

 Paging    

  MVT 

The set of all physical address corresponding to the logical address is a _____of the process

 

Logical address space

Process address space   

Physical address space   

 None of the

 

Addresses generated relative to part of program, not to start of physical memory are

 

Relocatable    

Virtual    

Symbolic      

Physical    

 

In deadlock detection and recovery algorithm exists in the system if and only if the wait for graph contains a _______.

 

Cycle   

Graph     

Edge 

 Node    

 

Object files and library are combined by a ____ program to produce the executable binary

Compiler             

Linker             

Text editor       

Loader

 The run-time mapping from virtual to physical address is done by a piece of hardware in the CPU, called the _______

 

Memory management unit (MMU)     

CPU scheduler      

Registers      

None of the above

Main memory is ______ memory.

Volatile memory    

Non-volatile    

Permanent     

Virtual  

Cache is non-volatile memory.

True   

False

 

What do we name to an address that is generated by CPU?

 

Logical address        

Physical address     

Binary address      

None of the above

 

_____holds the smallest legal physical memory address for a process

 

Base register     

Limit register    

Index register    

Stack pointer register

 

Physical memory is broken dowm in to fixed-sized blocks, called______ and logical memory is divided into blocks of the same size, called______

 

Frames, pages   

Pages, frames  

Frames, holes    

Holes, segments 

 

Address Binding will be at _____ in multiprogramming with fixed tasks (MFT)

 

Rub time   

Load time                   

Dynamic time          

None of the

 

In ____ technique, memory is divided into several fixed-size partitions.

Swapping            

Overlays                

Multiprogramming with fixed tasks (MFT)    

Multiprogramming with fixed tasks (MFT)

 

Banker's algorithm is used for________

Deadlock avoidance   

Deadlock detection  

Deadlock prevention   

Deadlock removal

 

_____is used in the detection and recovery mechanism to handle deadlocks.

Wait-for graph       

Resource allocation graph        

Circular graph       

Claim edge graph

The size of pages and frames are same in logical memory and physical memory respectively.

True 

 False 

 

An optimal page-replacement algorithm has the lowest page fault rate of all algorithms.

True

False 

In pages segmentation, the logical address is legal if d is _________segment length.

< less then

The set of all physical addresses corresponding to the logical addresses is a ----------------- of the process

Physical address space

 

he main memory is usually divided into partitions, one for __________ and other for __________ .

 

Operating System, User processes

 

In ______ allocation scheme number of frames allocated to a process is proportional to its size .

Proportional Allocation

In case of thrashing if CPU utilization is too low the operating system ______ the degree of multiprogramming.

Increases

_________ Point to the page table.

Translation look-aside buffers

Page offset

Page-table length registers (PRLR)

Page-table base registers (PRLR)

The segment table maps the _____________ the physical addresses.

Page addresses

Shared page addresses

One-dimensional logical addresses

Two-dimensional logical addresses

Segmentation is a memory management scheme that support_______?

Programmer's view of memory

System's view of memory

Programmer's view of memory

Hardware's view of memory

None of the given

The pager is used in connection with ____________.

Demand paging

Paging

Segmentation

Page segmentation

Cache is non-volatile memory.

True

False

Overlays are implementing by the __________.

Operating system

Programmer

Kernel

Shell

When the process tries to access locations that are not in memory, the hard traps the operating system. This is called as_______.

Page fault

Page replacement

Paging

Segmentation

The optimal page-replacement algorithm has a lowest page fault rate of all algorithms.

True

False  

The main criteria of page replacement in optimal page replacement algorithm is to

Replacement that page will not be use for the longest period of time

Replacement that page will be required most frequently in the execution of process

Replace the page which is biggest in size.

 

 

 

 

 

 

 

 

 

 

 

 

--
Contact to Admn. AamirAbbas9@gmail.com
 
Send email to group at: mcs-mit@googlegroups.com
Visit For Previous Papers http://groups.google.com/group/mcs-mit/files
 
Follow these Rules to stay long in Group:
http://groups.google.com/group/mcs-mit/web/group-rules



--
Zindagi mein 2 Logo ka buhat khayal rahkoooo

Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo (Father)

2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)

Regards, 
Umair Saulat

--
Please visit http://vusr.net for Old and Latest Papers, Assignments, Quiz and GDBs.
 
http://VUSR.net The ultimate VU Study Resource
 
You received this message because you are subscribed to the Google
Groups "VUSR" group.
 
 
To unsubscribe
vusr+unsubscribe@googlegroups.com
To Visit Group Home Page
http://groups.google.com/group/vusr?hl=en?hl=en

No comments:

Post a Comment