MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1690 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 1401. |
In internal fragmentation, memory is internal to a partition and : |
| A. | is being used |
| B. | is not being used |
| C. | is always used |
| D. | none of the mentioned |
| Answer» C. is always used | |
| 1402. |
The first fit, best fit and worst fit are strategies to select a ______ |
| A. | process from a queue to put in memory |
| B. | processor to run the next process |
| C. | free hole from a set of available holes |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 1403. |
In fixed size partition, the degree of multiprogramming is bounded by ___________ |
| A. | the number of partitions |
| B. | the CPU utilization |
| C. | the memory size |
| D. | all of the mentioned |
| Answer» B. the CPU utilization | |
| 1404. |
When memory is divided into several fixed sized partitions, each partition may contain ________ |
| A. | exactly one process |
| B. | at least one process |
| C. | multiple processes at once |
| D. | none of the mentioned |
| Answer» B. at least one process | |
| 1405. |
Using transient code, _______ the size of the operating system during program execution. |
| A. | increases |
| B. | decreases |
| C. | changes |
| D. | maintains |
| Answer» D. maintains | |
| 1406. |
Transient operating system code is code that : |
| A. | is not easily accessible |
| B. | comes and goes as needed |
| C. | stays in the memory always |
| D. | never enters the memory space |
| Answer» C. stays in the memory always | |
| 1407. |
The operating system and the other processes are protected from being modified by an already running process because : |
| A. | they are in different memory spaces |
| B. | they are in different logical addresses |
| C. | they have a protection algorithm |
| D. | every address generated by the CPU is being checked against the relocation and limit registers |
| Answer» E. | |
| 1408. |
With relocation and limit registers, each logical address must be _______ the limit register. |
| A. | less than |
| B. | equal to |
| C. | greater than |
| D. | none of the mentioned |
| Answer» B. equal to | |
| 1409. |
The relocation register helps in : |
| A. | providing more address space to processes |
| B. | a different address space to processes |
| C. | to protect the address spaces of processes |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1410. |
In contiguous memory allocation : |
| A. | each process is contained in a single contiguous section of memory |
| B. | all processes are contained in a single contiguous section of memory |
| C. | the memory space is contiguous |
| D. | none of the mentioned |
| Answer» B. all processes are contained in a single contiguous section of memory | |
| 1411. |
The operating system is : |
| A. | in the low memory |
| B. | in the high memory |
| C. | either low or high memory (depending on the location of interrupt vector) |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1412. |
The main memory accommodates : |
| A. | operating system |
| B. | cpu |
| C. | user processes |
| D. | all of the mentioned |
| Answer» B. cpu | |
| 1413. |
Operating System maintains the page table for |
| A. | each process |
| B. | each thread |
| C. | each instruction |
| D. | each address |
| Answer» B. each thread | |
| 1414. |
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 |
| Answer» D. a technique for overcoming fatal error | |
| 1415. |
The page table contains |
| A. | base address of each page in physical memory |
| B. | page offset |
| C. | page size |
| D. | none of the mentioned |
| Answer» B. page offset | |
| 1416. |
Program always deals with |
| A. | logical address |
| B. | absolute address |
| C. | physical address |
| D. | relative address |
| Answer» B. absolute address | |
| 1417. |
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 |
| Answer» C. page register | |
| 1418. |
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 |
| Answer» C. mapping | |
| 1419. |
Run time mapping from virtual to physical address is done by |
| A. | Memory management unit |
| B. | CPU |
| C. | PCI |
| D. | None of the mentioned |
| Answer» B. CPU | |
| 1420. |
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 |
| Answer» D. none of the mentioned | |
| 1421. |
A memory buffer used to accommodate a speed differential is called |
| A. | stack pointer |
| B. | cache |
| C. | accumulator |
| D. | disk buffer |
| Answer» C. accumulator | |
| 1422. |
CPU fetches the instruction from memory according to the value of |
| A. | program counter |
| B. | status register |
| C. | instruction register |
| D. | program status word |
| Answer» B. status register | |
| 1423. |
Swap space is allocated : |
| A. | as a chunk of disk |
| B. | separate from a file system |
| C. | into a file system |
| D. | all of the mentioned |
| Answer» B. separate from a file system | |
| 1424. |
Swapping _______ be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers. |
| A. | must |
| B. | can |
| C. | must never |
| D. | maybe |
| Answer» D. maybe | |
| 1425. |
The major part of swap time is _______ time. |
| A. | waiting |
| B. | transfer |
| C. | execution |
| D. | none of the mentioned |
| Answer» C. execution | |
| 1426. |
The _________ time in a swap out of a running process and swap in of a new process into the memory is very high. |
| A. | context – switch |
| B. | waiting |
| C. | execution |
| D. | all of the mentioned |
| Answer» B. waiting | |
| 1427. |
The ________ consists of all processes whose memory images are in the backing store or in memory and are ready to run. |
| A. | wait queue |
| B. | ready queue |
| C. | cpu |
| D. | secondary storage |
| Answer» C. cpu | |
| 1428. |
The backing store is generally a : |
| A. | fast disk |
| B. | disk large enough to accommodate copies of all memory images for all users |
| C. | disk to provide direct access to the memory images |
| D. | all of the mentioned |
| Answer» E. | |
| 1429. |
Swapping requires a _________ |
| A. | motherboard |
| B. | keyboard |
| C. | monitor |
| D. | backing store |
| Answer» E. | |
| 1430. |
If execution time binding is being used, then a process ______ be swapped to a different memory space. |
| A. | has to be |
| B. | can never |
| C. | must |
| D. | may |
| Answer» E. | |
| 1431. |
The size of a process is limited to the size of : |
| A. | physical memory |
| B. | external storage |
| C. | secondary storage |
| D. | none of the mentioned |
| Answer» B. external storage | |
| 1432. |
The base register is also known as the : |
| A. | basic register |
| B. | regular register |
| C. | relocation register |
| D. | delocation register |
| Answer» D. delocation register | |
| 1433. |
The run time mapping from virtual to physical addresses is done by a hardware device called the : |
| A. | Virtual to physical mapper |
| B. | Memory management unit |
| C. | Memory mapping unit |
| D. | None of the mentioned |
| Answer» C. Memory mapping unit | |
| 1434. |
The address loaded into the memory address register of the memory is referred to as : |
| A. | Physical address |
| B. | Logical address |
| C. | Neither physical nor logical |
| D. | None of the mentioned |
| Answer» B. Logical address | |
| 1435. |
The address generated by the CPU is referred to as : |
| A. | Physical address |
| B. | Logical address |
| C. | Neither physical nor logical |
| D. | None of the mentioned |
| Answer» C. Neither physical nor logical | |
| 1436. |
Which of the following is TRUE ? |
| A. | Overlays are used to increase the size of physical memory |
| B. | Overlays are used to increase the logical address space |
| C. | When overlays are used, the size of a process is not limited to the size of the physical memory |
| D. | Overlays are used whenever the physical address space is smaller than the logical address space |
| Answer» D. Overlays are used whenever the physical address space is smaller than the logical address space | |
| 1437. |
In a system that does not support swapping, |
| A. | the compiler normally binds symbolic addresses (variables) to relocatable addresses |
| B. | the compiler normally binds symbolic addresses to physical addresses |
| C. | the loader binds relocatable addresses to physical addresses |
| D. | binding of symbolic addresses to physical addresses normally takes place during execution |
| Answer» B. the compiler normally binds symbolic addresses to physical addresses | |
| 1438. |
If binding is done at assembly or load time, then the process _____ be moved to different locations after being swapped out and in again. |
| A. | can |
| B. | must |
| C. | can never |
| D. | may |
| Answer» D. may | |
| 1439. |
If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called : |
| A. | priority swapping |
| B. | pull out, push in |
| C. | roll out, roll in |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 1440. |
The ___________ swaps processes in and out of the memory. |
| A. | Memory manager |
| B. | CPU |
| C. | CPU manager |
| D. | User |
| Answer» B. CPU | |
| 1441. |
The ___________ must design and program the overlay structure. |
| A. | programmer |
| B. | system architect |
| C. | system designer |
| D. | none of the mentioned |
| Answer» B. system architect | |
| 1442. |
The idea of overlays is to : |
| A. | data that are needed at any given time |
| B. | enable a process to be larger than the amount of memory allocated to it |
| C. | keep in memory only those instructions |
| D. | all of the mentioned |
| Answer» E. | |
| 1443. |
The advantage of dynamic loading is that : |
| A. | A used routine is used multiple times |
| B. | An unused routine is never loaded |
| C. | CPU utilization increases |
| D. | All of the mentioned |
| Answer» C. CPU utilization increases | |
| 1444. |
Dynamic loading is : |
| A. | loading multiple routines dynamically |
| B. | loading a routine only when it is called |
| C. | loading multiple routines randomly |
| D. | none of the mentioned |
| Answer» C. loading multiple routines randomly | |
| 1445. |
If the process can be moved during its execution from one memory segment to another, then binding must be : |
| A. | delayed until run time |
| B. | preponed to compile time |
| C. | preponed to load time |
| D. | none of the mentioned |
| Answer» B. preponed to compile time | |
| 1446. |
Binding of instructions and data to memory addresses can be done at : |
| A. | Compile time |
| B. | Load time |
| C. | Execution time |
| D. | All of the mentioned |
| Answer» E. | |
| 1447. |
Address Binding is : |
| A. | going to an address in memory |
| B. | locating an address with the help of another address |
| C. | binding two addresses together to form a new address in a different memory space |
| D. | a mapping from one address space to another |
| Answer» E. | |
| 1448. |
The solution to starvation is : |
| A. | the number of rollbacks must be included in the cost factor |
| B. | the number of resources must be included in resource preemption |
| C. | resource preemption be done instead |
| D. | all of the mentioned |
| Answer» B. the number of resources must be included in resource preemption | |
| 1449. |
If the resources are always preempted from the same process, __________ can occur. |
| A. | deadlock |
| B. | system crash |
| C. | aging |
| D. | starvation |
| Answer» E. | |
| 1450. |
To _______ to a safe state, the system needs to keep more information about the states of processes. |
| A. | abort the process |
| B. | roll back the process |
| C. | queue the process |
| D. | none of the mentioned |
| Answer» C. queue the process | |