MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 557 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 251. |
A process is thrashing if |
| A. | it is spending more time paging than executing |
| B. | it is spending less time paging than executing |
| C. | page fault occurs |
| D. | swapping can not take place |
| Answer» B. it is spending less time paging than executing | |
| 252. |
Virtual memory allows |
| A. | execution of a process that may not be completely in memory |
| B. | a program to be smaller than the physical memory |
| C. | a program to be larger than the secondary storage |
| D. | execution of a process without being in physical memory |
| Answer» B. a program to be smaller than the physical memory | |
| 253. |
Virtual memory is normally implemented by |
| A. | demand paging |
| B. | buses |
| C. | virtualization |
| D. | all of the mentioned |
| Answer» B. buses | |
| 254. |
In FIFO page replacement algorithm, when a page must be replaced |
| A. | oldest page is chosen |
| B. | newest page is chosen |
| C. | random page is chosen |
| D. | none of the mentioned |
| Answer» B. newest page is chosen | |
| 255. |
Effective access time is directly proportional to |
| A. | page-fault rate |
| B. | hit ratio |
| C. | memory access time |
| D. | none of the mentioned |
| Answer» B. hit ratio | |
| 256. |
When a program tries to access a page that is mapped in address space but not loaded in physical memory, then |
| A. | segmentation fault occurs |
| B. | fatal error occurs |
| C. | page fault occurs |
| D. | no error occurs |
| Answer» D. no error occurs | |
| 257. |
Swap space exists in |
| A. | primary memory |
| B. | secondary memory |
| C. | cpu |
| D. | none of the mentioned |
| Answer» C. cpu | |
| 258. |
In paged memory systems, if the page size is increased, then the internal fragmentation generally |
| A. | becomes less |
| B. | becomes more |
| C. | remains constant |
| D. | none of the mentioned |
| Answer» C. remains constant | |
| 259. |
           is the concept in which a process is copied into the main memory from the secondary memory according to the requirement. |
| A. | paging |
| B. | demand paging |
| C. | segmentation |
| D. | swapping |
| Answer» C. segmentation | |
| 260. |
The pager concerns with the |
| A. | special support from hardware is required |
| B. | special support from operating system is essential |
| C. | special support from both hardware and operating system is essential |
| D. | user programs can implement dynamic loading without any special support from hardware or operating system |
| Answer» E. | |
| 261. |
When there is a large logical address space, the best way of paging would be |
| A. | not to page |
| B. | a two level paging algorithm |
| C. | the page table itself |
| D. | all of the mentioned |
| Answer» C. the page table itself | |
| 262. |
Memory protection in a paged environment is accomplished by |
| A. | protection algorithm with each page |
| B. | restricted access rights to users |
| C. | restriction on page visibility |
| D. | protection bit with each page |
| Answer» E. | |
| 263. |
When the valid – invalid bit is set to valid, it means that the associated page |
| A. | is in the tlb |
| B. | has data in it |
| C. | is in the process’s logical address space |
| D. | is the system’s physical address space |
| Answer» D. is the system’s physical address space | |
| 264. |
The percentage of times a page number is found in the TLB is known as |
| A. | miss ratio |
| B. | hit ratio |
| C. | miss percent |
| D. | none of the mentioned |
| Answer» C. miss percent | |
| 265. |
An              uniquely identifies processes and is used to provide address space protection for that process. |
| A. | address space locator |
| B. | address space identifier |
| C. | address process identifier |
| D. | none of the mentioned |
| Answer» C. address process identifier | |
| 266. |
If a page number is not found in the TLB, then it is known as a |
| A. | tlb miss |
| B. | buffer miss |
| C. | tlb hit |
| D. | all of the mentioned |
| Answer» B. buffer miss | |
| 267. |
Each entry in a translation lookaside buffer (TLB) consists of |
| A. | key |
| B. | value |
| C. | bit value |
| D. | constant |
| Answer» B. value | |
| 268. |
Time taken in memory access through PTBR is |
| A. | extended by a factor of 3 |
| B. | extended by a factor of 2 |
| C. | slowed by a factor of 3 |
| D. | slowed by a factor of 2 |
| Answer» E. | |
| 269. |
For every process there is a |
| A. | page table |
| B. | copy of page table |
| C. | pointer to page table |
| D. | all of the mentioned |
| Answer» B. copy of page table | |
| 270. |
For larger page tables, they are kept in main memory and a                      points to the page table. |
| A. | page table base register |
| B. | page table base pointer |
| C. | page table register pointer |
| D. | page table base |
| Answer» B. page table base pointer | |
| 271. |
Smaller page tables are implemented as a set of |
| A. | queues |
| B. | stacks |
| C. | counters |
| D. | registers |
| Answer» E. | |
| 272. |
The page table registers should be built with |
| A. | very low speed logic |
| B. | very high speed logic |
| C. | a large memory space |
| D. | none of the mentioned |
| Answer» C. a large memory space | |
| 273. |
The operating system maintains a              table that keeps track of how many frames have been allocated, how many are there, and how many are available. |
| A. | page |
| B. | mapping |
| C. | frame |
| D. | memory |
| Answer» D. memory | |
| 274. |
Paging increases the              time. |
| A. | waiting |
| B. | execution |
| C. | context – switch |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 275. |
If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order            bits of a logical address designate the page number, and the          low order bits designate the page offset. |
| A. | m, n |
| B. | n, m |
| C. | m – n, m |
| D. | m – n, n |
| Answer» E. | |
| 276. |
The size of a page is typically |
| A. | varied |
| B. | power of 2 |
| C. | power of 4 |
| D. | none of the mentioned |
| Answer» C. power of 4 | |
| 277. |
The            table contains the base address of each page in physical memory. |
| A. | process |
| B. | memory |
| C. | page |
| D. | frame |
| Answer» D. frame | |
| 278. |
The                      is used as an index into the page table. |
| A. | frame bit |
| B. | page number |
| C. | page offset |
| D. | frame offset |
| Answer» C. page offset | |
| 279. |
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» C. page offset & frame bit | |
| 280. |
Logical memory is broken into blocks of the same size called |
| A. | frames |
| B. | pages |
| C. | backing store |
| D. | none of the mentioned |
| Answer» C. backing store | |
| 281. |
Physical memory is broken into fixed-sized blocks called |
| A. | frames |
| B. | pages |
| C. | backing store |
| D. | none of the mentioned |
| Answer» B. pages | |
| 282. |
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» B. external fragmentation occurs | |
| 283. |
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» C. very small | |
| 284. |
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» E. | |
| 285. |
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» B. the memory used | |
| 286. |
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» B. must be done | |
| 287. |
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 | |
| 288. |
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» B. permit smaller processes to be allocated memory at last | |
| 289. |
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» B. larger memory space | |
| 290. |
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 | |
| 291. |
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 | |
| 292. |
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 | |
| 293. |
Using transient code, Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â the size of the operating system during program execution. |
| A. | increases |
| B. | decreases |
| C. | changes |
| D. | maintains |
| Answer» D. maintains | |
| 294. |
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. | |
| 295. |
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 | |
| 296. |
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 | |
| 297. |
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» D. none of the mentioned | |
| 298. |
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 | |
| 299. |
The main memory accommodates |
| A. | operating system |
| B. | cpu |
| C. | user processes |
| D. | all of the mentioned |
| Answer» B. cpu | |
| 300. |
Operating System maintains the page table for |
| A. | each process |
| B. | each thread |
| C. | each instruction |
| D. | each address |
| Answer» B. each thread | |