

McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of Science in Computer Science FY (BSc CS) , Bachelor of Computer Applications (BCA) , Bachelor of Science in Computer Science (BSc CS) .
351. |
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» D. all of the mentioned |
352. |
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» A. delayed until run time |
353. |
What is Dynamic loading? |
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» B. loading a routine only when it is called |
354. |
What is the advantage of dynamic loading? |
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» B. an unused routine is never loaded |
355. |
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» D. all of the mentioned |
356. |
The must design and program the overlay structure. |
A. | programmer |
B. | system architect |
C. | system designer |
D. | none of the mentioned |
Answer» A. programmer |
357. |
The swaps processes in and out of the memory. |
A. | memory manager |
B. | cpu |
C. | cpu manager |
D. | user |
Answer» A. memory manager |
358. |
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» C. can never |
359. |
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» A. the compiler normally binds symbolic addresses (variables) to relocatable addresses |
360. |
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» B. logical address |
361. |
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» A. physical address |
362. |
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» B. memory management unit |
363. |
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» A. physical memory |
364. |
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» D. may |
365. |
Swapping requires a |
A. | motherboard |
B. | keyboard |
C. | monitor |
D. | backing store |
Answer» D. backing store |
366. |
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» D. all of the mentioned |
367. |
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» B. ready queue |
368. |
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» A. context – switch |
369. |
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» C. must never |
370. |
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» A. as a chunk of disk |
371. |
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» A. program counter |
372. |
A memory buffer used to accommodate a speed differential is called |
A. | stack pointer |
B. | cache |
C. | accumulator |
D. | disk buffer |
Answer» B. cache |
373. |
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» C. logical address |
374. |
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» A. memory management unit |
375. |
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» B. paging |
376. |
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» B. page table base register |
377. |
Program always deals with |
A. | logical address |
B. | absolute address |
C. | physical address |
D. | relative address |
Answer» A. logical address |
378. |
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» A. base address of each page in physical memory |
379. |
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» C. a technique for overcoming external fragmentation |
380. |
Operating System maintains the page table for |
A. | each process |
B. | each thread |
C. | each instruction |
D. | each address |
Answer» A. each process |
381. |
The main memory accommodates |
A. | operating system |
B. | cpu |
C. | user processes |
D. | all of the mentioned |
Answer» A. operating system |
382. |
What is the operating system? |
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» C. either low or high memory (depending on the location of interrupt vector) |
383. |
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» A. each process is contained in a single contiguous section of memory |
384. |
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» C. to protect the address spaces of processes |
385. |
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» D. every address generated by the cpu is being checked against the relocation and limit registers |
386. |
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» B. comes and goes as needed |
387. |
Using transient code, the size of the operating system during program execution. |
A. | increases |
B. | decreases |
C. | changes |
D. | maintains |
Answer» C. changes |
388. |
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» A. the number of partitions |
389. |
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» C. free hole from a set of available holes |
390. |
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» B. is not being used |
391. |
A solution to the problem of external fragmentation is |
A. | compaction |
B. | larger memory space |
C. | smaller memory space |
D. | none of the mentioned |
Answer» A. compaction |
392. |
Another solution to the problem of external fragmentation problem is to |
A. | permit the logical address space of a process to be noncontiguous |
B. | permit smaller processes to be allocated memory at last |
C. | permit larger processes to be allocated memory at last |
D. | all of the mentioned |
Answer» A. permit the logical address space of a process to be noncontiguous |
393. |
If relocation is static and is done at assembly or load time, compaction |
A. | cannot be done |
B. | must be done |
C. | must not be done |
D. | can be done |
Answer» A. cannot be done |
394. |
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 |
A. | the cost incurred |
B. | the memory used |
C. | the cpu used |
D. | all of the mentioned |
Answer» A. the cost incurred |
395. |
External fragmentation will not occur when? |
A. | first fit is used |
B. | best fit is used |
C. | worst fit is used |
D. | no matter which algorithm is used, it will always occur |
Answer» D. no matter which algorithm is used, it will always occur |
396. |
Sometimes the overhead of keeping track of a hole might be |
A. | larger than the memory |
B. | larger than the hole itself |
C. | very small |
D. | all of the mentioned |
Answer» B. larger than the hole itself |
397. |
When the memory allocated to a process is slightly larger than the process, then |
A. | internal fragmentation occurs |
B. | external fragmentation occurs |
C. | both internal and external fragmentation occurs |
D. | neither internal nor external fragmentation occurs |
Answer» A. internal fragmentation occurs |
398. |
Physical memory is broken into fixed-sized blocks called |
A. | frames |
B. | pages |
C. | backing store |
D. | none of the mentioned |
Answer» A. frames |
399. |
Logical memory is broken into blocks of the same size called |
A. | frames |
B. | pages |
C. | backing store |
D. | none of the mentioned |
Answer» B. pages |
400. |
Every address generated by the CPU is divided into two parts. They are |
A. | frame bit & page number |
B. | page number & page offset |
C. | page offset & frame bit |
D. | frame offset & page offset |
Answer» B. page number & page offset |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.