MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 332 Mcqs, each offering curated multiple-choice questions to sharpen your Master of Science in Computer Science (M.Sc CS) knowledge and support exam preparation. Choose a topic below to get started.
| 251. |
For most computers, the bootstrap is stored in ____. |
| A. | ram |
| B. | rom |
| C. | cache |
| D. | tertiary storage |
| Answer» C. cache | |
| 252. |
and then starts the operating system. |
| A. | main |
| B. | bootloader |
| C. | bootstrap |
| D. | rom |
| Answer» D. rom | |
| 253. |
The two steps the operating system takes to use a disk to hold its files are _______ and ________. |
| A. | partitioning |
| B. | swap space creation |
| C. | caching |
| D. | logical formatting |
| Answer» E. | |
| 254. |
The header and trailer of a sector contain information used by the disk controller such as _________ and _________. |
| A. | main section |
| B. | error correcting codes (ecc) |
| C. | sector number |
| D. | disk identifier |
| Answer» D. disk identifier | |
| 255. |
The data structue for a sector typically contains : (choose all that apply) |
| A. | header |
| B. | data area |
| C. | trailer |
| D. | main section |
| Answer» D. main section | |
| 256. |
before a disk can store data is known as : (choose all that apply) |
| A. | partitioning |
| B. | swap space creation |
| C. | low-level formatting |
| D. | physical formatting |
| Answer» E. | |
| 257. |
In the Many to Many model when a thread performs a blocking system call : |
| A. | other threads are strictly prohibited from running |
| B. | other threads are allowed to run |
| C. | other threads only from other processes are allowed to run |
| D. | none of these |
| Answer» C. other threads only from other processes are allowed to run | |
| 258. |
In the Many to Many model true concurrency cannot be gained because : |
| A. | the kernel can schedule only one thread at a time |
| B. | there are too many threads to handle |
| C. | it is hard to map threads with each other |
| D. | none of these |
| Answer» B. there are too many threads to handle | |
| 259. |
When is the Many to One model at an advantage ? |
| A. | when the program does not need multi-threading |
| B. | when the program has to be multi-threaded |
| C. | when there is a single processor |
| D. | none of these |
| Answer» B. when the program has to be multi-threaded | |
| 260. |
Which of the following is the drawback of the One to One Model ? |
| A. | increased concurrency provided by this model |
| B. | decreased concurrency provided by this model |
| C. | creating so many threads at once can crash the system |
| D. | creating a user thread requires creating the corresponding kernel thread |
| Answer» E. | |
| 261. |
In the One to One model when a thread makes a blocking system call : |
| A. | other threads are strictly prohibited from running |
| B. | other threads are allowed to run |
| C. | other threads only from other processes are allowed to run |
| D. | none of these |
| Answer» C. other threads only from other processes are allowed to run | |
| 262. |
The One to One model allows : |
| A. | increased concurrency |
| B. | decreased concurrency |
| C. | increased or decreased concurrency |
| D. | concurrency equivalent to other models |
| Answer» B. decreased concurrency | |
| 263. |
In the Many to One model, multiple threads are unable to run in parallel on multiprocessors because : |
| A. | only one thread can access the kernel at a time |
| B. | many user threads have access to just one kernel thread |
| C. | there is only one kernel thread |
| D. | none of these |
| Answer» B. many user threads have access to just one kernel thread | |
| 264. |
In the Many to One model, if a thread makes a blocking system call : |
| A. | the entire process will be blocked |
| B. | a part of the process will stay blocked, with the rest running |
| C. | the entire process will run |
| D. | none of these |
| Answer» B. a part of the process will stay blocked, with the rest running | |
| 265. |
The model in which one user-level thread is mapped to many kernel level threads is called : |
| A. | many to one model |
| B. | one to many model |
| C. | many to many model |
| D. | one to one model |
| Answer» C. many to many model | |
| 266. |
The model in which one kernel thread is mapped to many user-level threads is called : |
| A. | many to one model |
| B. | one to many model |
| C. | many to many model |
| D. | one to one model |
| Answer» B. one to many model | |
| 267. |
To let a client have random access to a media stream : |
| A. | the protocol used must not be stateless |
| B. | the server must support download |
| C. | the stream should give access rights to the client |
| D. | all of these |
| Answer» B. the server must support download | |
| 268. |
The difficulty with multicasting from a practical point of view is : (choose all that apply) |
| A. | memory allocation is difficult |
| B. | server must establish a seperate unicast session for each client |
| C. | the routers must support multicasting |
| D. | the clients must be close to the server |
| Answer» E. | |
| 269. |
The problem with unicast delivery is that the : |
| A. | memory allocation is difficult |
| B. | server must establish a seperate unicast session for each client |
| C. | the routers must support unicasting |
| D. | the clients must be close to the server |
| Answer» C. the routers must support unicasting | |
| 270. |
RTP stands for : |
| A. | real time protocol |
| B. | real time transmission control protocol |
| C. | real time transmission protocol |
| D. | real time transport protocol |
| Answer» E. | |
| 271. |
In the TEARDOWN state : |
| A. | the server breaks down the connection and releases the resources allocated for the session |
| B. | the client breaks down the connection and releases the resources allocated for the session |
| C. | the system crashes |
| D. | none of these |
| Answer» B. the client breaks down the connection and releases the resources allocated for the session | |
| 272. |
In the SETUP state : |
| A. | the server is setup |
| B. | the client is setup |
| C. | the server allocates resources for the client session |
| D. | the client sends requests to the server |
| Answer» D. the client sends requests to the server | |
| 273. |
HTTP is __________. (choose two) |
| A. | a stateful protocol |
| B. | a stateless protocol |
| C. | a protocol that maintains the status of its connection with the client |
| D. | a protocol that does not maintain the status of its connection with the client |
| Answer» E. | |
| 274. |
RTSP stands for : |
| A. | real time streaming policy |
| B. | real time streaming protocol |
| C. | real time systems protocol |
| D. | read time streaming policy |
| Answer» C. real time systems protocol | |
| 275. |
Multicasting delivers the content to : |
| A. | a single client |
| B. | all clients, regardless whether they want the content or not |
| C. | a group of receivers who indicate they wish to receive the content |
| D. | none of these |
| Answer» D. none of these | |
| 276. |
Broadcasting delivers the content to : |
| A. | a single client |
| B. | all clients, regardless whether they want the content or not |
| C. | a group of receivers who indicate they wish to receive the content |
| D. | none of these |
| Answer» C. a group of receivers who indicate they wish to receive the content | |
| 277. |
Unicasting delivers the content to : |
| A. | a single client |
| B. | all clients, regardless whether they want the content or not |
| C. | a group of receivers who indicate they wish to receive the content |
| D. | none of these |
| Answer» B. all clients, regardless whether they want the content or not | |
| 278. |
The three general methods for delivering content from a server to a client across a network are : |
| A. | unicasting |
| B. | duplex-casting |
| C. | broadcasting |
| D. | multicasting |
| Answer» E. | |
| 279. |
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 look aside buffer |
| D. | it helps to reduce the number of page faults in page replacement algorithms |
| Answer» C. it is required by the translation look aside buffer | |
| 280. |
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 | |
| 281. |
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 | |
| 282. |
The protection bit is 0/1 based on : (choose all that apply) |
| A. | write only |
| B. | read only |
| C. | read – write |
| D. | none of these |
| Answer» D. none of these | |
| 283. |
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 these |
| Answer» D. all of these | |
| 284. |
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 these |
| Answer» B. it is subtracted from the segment base to produce the physical memory address | |
| 285. |
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 | |
| 286. |
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 these |
| Answer» D. none of these | |
| 287. |
The segment base contains the : |
| A. | starting logical address of the process |
| B. | starting physical address of the segment in memory |
| C. | segment length |
| D. | none of these |
| Answer» C. segment length | |
| 288. |
Each entry in a segment table has a : |
| A. | segment base |
| B. | segment peak |
| C. | segment limit |
| D. | segment value |
| Answer» D. segment value | |
| 289. |
In paging the user provides only ________, which is partitioned by the hardware into ________ and ______. |
| A. | one address, page number, offset |
| B. | one offset, page number, address |
| C. | page number, offset, address |
| D. | none of these |
| Answer» B. one offset, page number, address | |
| 290. |
In segmentation, each address is specified by : |
| A. | a segment number |
| B. | an offset |
| C. | a value |
| D. | a key |
| Answer» C. a value | |
| 291. |
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 | |
| 292. |
For effective operating system, when to check for deadlock? |
| A. | every time a resource request is made |
| B. | at fixed time intervals |
| C. | both (a) and (b) |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 293. |
A system is in the safe state if |
| A. | the system can allocate resources to each process in some order and still avoid a deadlock |
| B. | there exist a safe sequence |
| C. | both (a) and (b) |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 294. |
Which of the following condition is required for deadlock to be possible? |
| A. | mutual exclusion |
| B. | a process may hold allocated resources while awaiting assignment of other resources |
| C. | no resource can be forcibly removed from a process holding it |
| D. | all of the mentioned |
| Answer» E. | |
| 295. |
What is the reusable resource? |
| A. | that can be used by one process at a time and is not depleted by that use |
| B. | that can be used by more than one process at a time |
| C. | that can be shared between various threads |
| D. | none of the mentioned |
| Answer» B. that can be used by more than one process at a time | |
| 296. |
In multilevel feedback scheduling algorithm |
| A. | a process can move to a different classified ready queue |
| B. | classification of ready queue is permanent |
| C. | processes are not classified into groups |
| D. | none of the mentioned |
| Answer» B. classification of ready queue is permanent | |
| 297. |
Time quantum is defined in |
| A. | shortest job scheduling algorithm |
| B. | round robin scheduling algorithm |
| C. | priority scheduling algorithm |
| D. | multilevel queue scheduling algorithm |
| Answer» C. priority scheduling algorithm | |
| 298. |
In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of |
| A. | all process |
| B. | currently running process |
| C. | parent process |
| D. | init process |
| Answer» C. parent process | |
| 299. |
The processes that are residing in main memory and are ready and waiting to execute are kept on a list called |
| A. | job queue |
| B. | ready queue |
| C. | execution queue |
| D. | process queue |
| Answer» C. execution queue | |
| 300. |
Which of the following state transitions is not possible ? |
| A. | blocked to running |
| B. | ready to running |
| C. | blocked to ready |
| D. | running to blocked |
| Answer» B. ready to running | |