CS604 Solved MCQs for upcoming final term by M. Zeeshan & Arslan Ali

Question # 1 of 15 ( Start time: 08:17:15 PM )  Total Marks: 1

Address Binding will be at _______ in Multiprogramming with Fixed Tasks (MFT)

Select correct option:

Run time

Load time

 Dynamic time 

None of the given options

 

Question # 2 of 15 ( Start time: 08:18:37 PM )  Total Marks: 1

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

Select correct option:

 

Swapping

Overlays

Multiprogramming with Fixed Tasks (MFT)

Multiprogramming with Variable Tasks (MVT)

Question # 4 of 15 ( Start time: 08:20:40 PM )  Total Marks: 1

———-holds the smallest legal physical memory address for a process

Select correct option:

 

 Base register 

Limit register

Index register

Stack pointers register

 

Question # 5 of 15 ( Start time: 08:21:32 PM )  Total Marks: 1

————–refers to the situation when free memory space exists to load a process in the memory but the space is not contiguous.

Select correct option:

Segmentation

Internal fragmentation

Swapping

External Fragmentation

Question # 5 of 15 ( Start time: 08:21:32 PM )  Total Marks: 1

————–refers to the situation when free memory space exists to load a process in the memory but the space is not contiguous.

Select correct option:

 

Segmentation

Internal fragmentation

Swapping

External Fragmentation

 

Question # 6 of 15 ( Start time: 08:22:41 PM )  Total Marks: 1

Variable names are ———– addresses

Select correct option:

 

Physical

Relocatable

Relative

Symbolic

 

Question # 7 of 15 ( Start time: 08:23:55 PM )  Total Marks: 1

Main Memory is _______________ memory.

Select correct option:

 

         Volatile

Non-volatile

Permanent

Virtual

 

Question # 8 of 15 ( Start time: 08:25:11 PM )  Total Marks: 1

Deadlock detection and recovery technique is exactly similar to deadlock avoidance technique to handle deadlock in the system.

Select correct option:

 

               True

False

Question # 9 of 15 ( Start time: 08:25:57 PM )  Total Marks: 1

In Overlay technique, we can overload any part of the program with the part of the program required needed recently.

Select correct option:

 

True

False

 

Question # 10 of 15 ( Start time: 08:27:25 PM )  Total Marks: 1

Secondary Storage memory devices have _____________ memory.

Select correct option:

 

Volatile

Permanent and non volatile

Temporary

None of the options is correct

 

Question # 11 of 15 ( Start time: 08:28:53 PM )  Total Marks: 1

__________ is used in the detection and recovery mechanism to handle deadlocks.

Select correct option:

 

Wait-for Graph

Resource allocation Graph

Circular Graph

Claim Edge Graph

 

Question # 12 of 15 ( Start time: 08:30:10 PM )  Total Marks: 1

___________ algorithm is used in Deadlock avoidance.

Select correct option:

 

Bakery

                                Banker’s

Mutual exclusion

Safe Sequence

 

Question # 13 of 15 ( Start time: 08:30:35 PM )  Total Marks: 1

—————keep in memory only those instructions and data that are needed at any given time.

Select correct option:

Fragmentation

Paging

Swapping

                        Overlays

 

Question # 14 of 15 ( Start time: 08:31:26 PM )  Total Marks: 1

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

Select correct option:

 

Relocatable

Virtual

Symbolic

Physical

 

Question # 15 of 15 ( Start time: 08:32:31 PM )  Total Marks: 1

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

Select correct option:

 

 Memory management unit (MMU)

CPU Scheduler

Registers

None of the given options