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.
| 201. |
The data structure for a sector typically contains |
| A. | header |
| B. | data area |
| C. | trailer |
| D. | all of the mentioned |
| Answer» E. | |
| 202. |
In the              algorithm, the disk arm starts at one end of the disk and moves toward the other end, servicing requests till the other end of the disk. At the other end, the direction is reversed and servicing continues. |
| A. | look |
| B. | scan |
| C. | c-scan |
| D. | c-look |
| Answer» C. c-scan | |
| 203. |
SSTF algorithm, like SJF Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â of some requests. |
| A. | may cause starvation |
| B. | will cause starvation |
| C. | does not cause starvation |
| D. | causes aging |
| Answer» B. will cause starvation | |
| 204. |
On media that use constant linear velocity (CLV), the                            is uniform. |
| A. | density of bits on the disk |
| B. | density of bits per sector |
| C. | the density of bits per track |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 205. |
Magnetic tape drives can write data at a speed                  disk drives. |
| A. | much lesser than |
| B. | comparable to |
| C. | much faster than |
| D. | none of the mentioned |
| Answer» C. much faster than | |
| 206. |
If a process needs I/O to or from a disk, and if the drive or controller is busy then |
| A. | the request will be placed in the queue of pending requests for that drive |
| B. | the request will not be processed and will be ignored completely |
| C. | the request will be not be placed |
| D. | none of the mentioned |
| Answer» B. the request will not be processed and will be ignored completely | |
| 207. |
Whenever a process needs I/O to or from a disk it issues a |
| A. | system call to the cpu |
| B. | system call to the operating system |
| C. | a special procedure |
| D. | all of the mentioned |
| Answer» C. a special procedure | |
| 208. |
What is the disk bandwidth? |
| A. | the total number of bytes transferred |
| B. | total time between the first request for service and the completion on the last transfer |
| C. | the total number of bytes transferred divided by the total time between the first request for service and the completion on the last transfer |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 209. |
             controller sends the command placed into it, via messages to the            controller. |
| A. | host, host |
| B. | disk, disk |
| C. | host, disk |
| D. | disk, host |
| Answer» D. disk, host | |
| 210. |
What is the host controller? |
| A. | controller built at the end of each disk |
| B. | controller at the computer end of the bus |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 211. |
When the head damages the magnetic surface, it is known as |
| A. | disk crash |
| B. | head crash |
| C. | magnetic damage |
| D. | all of the mentioned |
| Answer» C. magnetic damage | |
| 212. |
The time taken for the desired sector to rotate to the disk head is called |
| A. | positioning time |
| B. | random access time |
| C. | seek time |
| D. | rotational latency |
| Answer» E. | |
| 213. |
The time taken to move the disk arm to the desired cylinder is called the |
| A. | positioning time |
| B. | random access time |
| C. | seek time |
| D. | rotational latency |
| Answer» D. rotational latency | |
| 214. |
The set of tracks that are at one arm position make up a |
| A. | magnetic disks |
| B. | electrical disks |
| C. | assemblies |
| D. | cylinders |
| Answer» E. | |
| 215. |
The heads of the magnetic disk are attached to a            that moves all the heads as a unit. |
| A. | spindle |
| B. | disk arm |
| C. | track |
| D. | none of the mentioned |
| Answer» C. track | |
| 216. |
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because |
| A. | it reduces the memory access time to read or write a memory location |
| B. | it helps to reduce the size of page table needed to implement the virtual address space of a process |
| C. | it is required by the translation lookaside buffer |
| D. | it helps to reduce the number of page faults in page replacement algorithms |
| Answer» C. it is required by the translation lookaside buffer | |
| 217. |
Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block? |
| A. | 2048 |
| B. | 256 |
| C. | 64 |
| D. | 8 |
| Answer» D. 8 | |
| 218. |
If there are 32 segments, each of size 1Kb, then the logical address should have |
| A. | 13 bits |
| B. | 14 bits |
| C. | 15 bits |
| D. | 16 bits |
| Answer» B. 14 bits | |
| 219. |
In                information is recorded magnetically on platters. |
| A. | magnetic disks |
| B. | electrical disks |
| C. | assemblies |
| D. | cylinders |
| Answer» B. electrical disks | |
| 220. |
The protection bit is 0/1 based on |
| A. | write only |
| B. | read only |
| C. | read – write |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 221. |
When the entries in the segment tables of two different processes point to the same physical location |
| A. | the segments are invalid |
| B. | the processes get blocked |
| C. | segments are shared |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 222. |
If the offset is legal |
| A. | it is used as a physical memory address itself |
| B. | it is subtracted from the segment base to produce the physical memory address |
| C. | it is added to the segment base to produce the physical memory address |
| D. | none of the mentioned |
| Answer» B. it is subtracted from the segment base to produce the physical memory address | |
| 223. |
The offset ‘d’ of the logical address must be |
| A. | greater than segment limit |
| B. | between 0 and segment limit |
| C. | between 0 and the segment number |
| D. | greater than the segment number |
| Answer» C. between 0 and the segment number | |
| 224. |
The segment limit contains the |
| A. | starting logical address of the process |
| B. | starting physical address of the segment in memory |
| C. | segment length |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 225. |
Each entry in a segment table has a |
| A. | segment base |
| B. | segment peak |
| C. | segment value |
| D. | none of the mentioned |
| Answer» B. segment peak | |
| 226. |
In segmentation, each address is specified by |
| A. | a segment number & offset |
| B. | an offset & value |
| C. | a value & segment number |
| D. | a key & value |
| Answer» B. an offset & value | |
| 227. |
What is the reason for using the LFU page replacement algorithm? |
| A. | an actively used page should have a large reference count |
| B. | a less used page has more chances to be used again |
| C. | it is extremely efficient and optimal |
| D. | all of the mentioned |
| Answer» B. a less used page has more chances to be used again | |
| 228. |
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by |
| A. | the instruction set architecture |
| B. | page size |
| C. | physical memory size |
| D. | number of processes in memory |
| Answer» B. page size | |
| 229. |
There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called |
| A. | queue algorithms |
| B. | stack algorithms |
| C. | string algorithms |
| D. | none of the mentioned |
| Answer» C. string algorithms | |
| 230. |
When using counters to implement LRU, we replace the page with the |
| A. | smallest time value |
| B. | largest time value |
| C. | greatest size |
| D. | none of the mentioned |
| Answer» B. largest time value | |
| 231. |
What are the two methods of the LRU page replacement policy that can be implemented in hardware? |
| A. | counters |
| B. | ram & registers |
| C. | stack & counters |
| D. | registers |
| Answer» D. registers | |
| 232. |
What is the Optimal page – replacement algorithm? |
| A. | replace the page that has not been used for a long time |
| B. | replace the page that has been used for a long time |
| C. | replace the page that will not be used for a long time |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 233. |
LRU page – replacement algorithm associates with each page the |
| A. | time it was brought into memory |
| B. | the time of that page’s last use |
| C. | page after and before it |
| D. | all of the mentioned |
| Answer» C. page after and before it | |
| 234. |
A FIFO replacement algorithm associates with each page the |
| A. | time it was brought into memory |
| B. | size of the page in memory |
| C. | page after and before it |
| D. | all of the mentioned |
| Answer» B. size of the page in memory | |
| 235. |
If no frames are free, Â Â Â Â Â Â Â Â Â Â Â page transfer(s) is/are required. |
| A. | one |
| B. | two |
| C. | three |
| D. | four |
| Answer» C. three | |
| 236. |
Users                that their processes are running on a paged system. |
| A. | are aware |
| B. | are unaware |
| C. | may unaware |
| D. | none of the mentioned |
| Answer» C. may unaware | |
| 237. |
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is |
| A. | lru |
| B. | lfu |
| C. | fifo |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 238. |
In question 2, if the number of page frames is increased to 4, then the number of page transfers |
| A. | decreases |
| B. | increases |
| C. | remains the same |
| D. | none of the mentioned |
| Answer» C. remains the same | |
| 239. |
Which of the following page replacement algorithms suffers from Belady’s Anomaly? |
| A. | optimal replacement |
| B. | lru |
| C. | fifo |
| D. | both optimal replacement and fifo |
| Answer» D. both optimal replacement and fifo | |
| 240. |
Locality of reference implies that the page reference being made by a process |
| A. | will always be to the page used in the previous page reference |
| B. | is likely to be one of the pages used in the last few page references |
| C. | will always be one of the pages existing in memory |
| D. | will always lead to page faults |
| Answer» C. will always be one of the pages existing in memory | |
| 241. |
When the page fault rate is low |
| A. | the turnaround time increases |
| B. | the effective access time increases |
| C. | the effective access time decreases |
| D. | turnaround time & effective access time increases |
| Answer» D. turnaround time & effective access time increases | |
| 242. |
If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 |
| A. | p x ma + (1-p) x page fault time |
| B. | ma + page fault time |
| C. | (1-p) x ma + p x page fault time |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 243. |
When a process begins execution with no pages in memory? |
| A. | process execution becomes impossible |
| B. | a page fault occurs for every page brought into memory |
| C. | process causes system crash |
| D. | none of the mentioned |
| Answer» C. process causes system crash | |
| 244. |
When a page fault occurs, the state of the interrupted process is |
| A. | disrupted |
| B. | invalid |
| C. | saved |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 245. |
A page fault occurs when? |
| A. | a page gives inconsistent data |
| B. | a page cannot be accessed due to its absence from memory |
| C. | a page is invisible |
| D. | all of the mentioned |
| Answer» C. a page is invisible | |
| 246. |
The valid – invalid bit, in this case, when valid indicates? |
| A. | the page is not legal |
| B. | the page is illegal |
| C. | the page is in memory |
| D. | the page is not in memory |
| Answer» D. the page is not in memory | |
| 247. |
Using a pager |
| A. | increases the swap time |
| B. | decreases the swap time |
| C. | decreases the swap time & amount of physical memory needed |
| D. | increases the amount of physical memory needed |
| Answer» D. increases the amount of physical memory needed | |
| 248. |
A swapper manipulates                        whereas the pager is concerned with individual                of a process. |
| A. | the entire process, parts |
| B. | all the pages of a process, segments |
| C. | the entire process, pages |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 249. |
Segment replacement algorithms are more complex than page replacement algorithms because |
| A. | segments are better than pages |
| B. | pages are better than segments |
| C. | segments have variable sizes |
| D. | segments have fixed sizes |
| Answer» D. segments have fixed sizes | |
| 250. |
The ability to execute a program that is only partially in memory has benefits like |
| A. | the amount of physical memory cannot put a constraint on the program |
| B. | programs for an extremely large virtual space can be created |
| C. | throughput increases |
| D. | all of the mentioned |
| Answer» E. | |