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.
| 201. |
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 | |
| 202. |
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 | |
| 203. |
If a process does not call exec after forking |
| A. | the program specified in the parameter to exec will replace the entire process |
| B. | all the threads should be duplicated |
| C. | all the threads should not be duplicated |
| D. | none of the mentioned |
| Answer» C. all the threads should not be duplicated | |
| 204. |
The table contains the base address of each page in physical memory. |
| A. | process |
| B. | memory |
| C. | page |
| D. | frame |
| Answer» D. frame | |
| 205. |
Which system call can be used by a parent process to determine the termination of child process? |
| A. | wait |
| B. | exit |
| C. | fork |
| D. | get |
| Answer» B. exit | |
| 206. |
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 | |
| 207. |
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 | |
| 208. |
In the instruction ADD A, B, the answer gets stored in |
| A. | b |
| B. | a |
| C. | buffer |
| D. | c |
| Answer» C. buffer | |
| 209. |
A process can never be sure that a signal it has sent |
| A. | has which identifier |
| B. | has not been lost |
| C. | has been sent |
| D. | all of the mentioned |
| Answer» C. has been sent | |
| 210. |
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 | |
| 211. |
The usual effect of abnormal termination of a program is |
| A. | core dump file generation |
| B. | system crash |
| C. | program switch |
| D. | signal destruction |
| Answer» B. system crash | |
| 212. |
Which algorithm is defined in Time quantum? |
| A. | shortest job scheduling algorithm |
| B. | round robin scheduling algorithm |
| C. | priority scheduling algorithm |
| D. | multilevel queue scheduling algorithm |
| Answer» C. priority scheduling algorithm | |
| 213. |
What is the degree of multiprogramming? |
| A. | the number of processes executed per unit time |
| B. | the number of processes in the ready queue |
| C. | the number of processes in the i/o queue |
| D. | the number of processes in memory |
| Answer» E. | |
| 214. |
The child process completes execution, but the parent keeps executing, then the child process is known as |
| A. | orphan |
| B. | zombie |
| C. | body |
| D. | dead |
| Answer» C. body | |
| 215. |
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 | |
| 216. |
Which of the following do not belong to queues for processes? |
| A. | job queue |
| B. | pcb queue |
| C. | device queue |
| D. | ready queue |
| Answer» C. device queue | |
| 217. |
Signals are identified by |
| A. | signal identifiers |
| B. | signal handlers |
| C. | signal actions |
| D. | none of the mentioned |
| Answer» B. signal handlers | |
| 218. |
Causing the CPU to step through a series of micro operations is called |
| A. | execution |
| B. | runtime |
| C. | sequencing |
| D. | pipelining |
| Answer» D. pipelining | |
| 219. |
A circuitry that processes that responds to and processes the basic instructions that are required to drive a computer system is |
| A. | memory |
| B. | alu |
| C. | cu |
| D. | processor |
| Answer» E. | |
| 220. |
Signals that occur at the same time, are presented to the process |
| A. | one at a time, in a particular order |
| B. | one at a time, in no particular order |
| C. | all at a time |
| D. | none of the mentioned |
| Answer» C. all at a time | |
| 221. |
A locking protocol is one that |
| A. | governs how locks are acquired |
| B. | governs how locks are released |
| C. | governs how locks are acquired and released |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 222. |
The growing phase is a phase in which? |
| A. | a transaction may obtain locks, but does not release any |
| B. | a transaction may obtain locks, and releases a few or all of them |
| C. | a transaction may release locks, but does not obtain any new locks |
| D. | a transaction may release locks, and does obtain new locks |
| Answer» B. a transaction may obtain locks, and releases a few or all of them | |
| 223. |
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 | |
| 224. |
In the bakery algorithm to solve the critical section problem |
| A. | each process is put into a queue and picked up in an ordered manner |
| B. | each process receives a number (may or may not be unique) and the one with the lowest number is served next |
| C. | each process gets a unique number and the one with the highest number is served next |
| D. | each process gets a unique number and the one with the lowest number is served next |
| Answer» C. each process gets a unique number and the one with the highest number is served next | |
| 225. |
When the data at a location in cache is different from the data located in the main memory, the cache is called |
| A. | unique |
| B. | inconsistent |
| C. | variable |
| D. | fault |
| Answer» C. variable | |
| 226. |
What is the solution to starvation? |
| 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 | |
| 227. |
The code that changes the value of the semaphore is |
| A. | remainder section code |
| B. | non – critical section code |
| C. | critical section code |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 228. |
What does PC stand for? |
| A. | program changer |
| B. | program counter |
| C. | performance counter |
| D. | performance changer |
| Answer» C. performance counter | |
| 229. |
What is a medium-term scheduler? |
| A. | it selects which process has to be brought into the ready queue |
| B. | it selects which process has to be executed next and allocates cpu |
| C. | it selects which process to remove from memory by swapping |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 230. |
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 | |
| 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. |
Thread pools are useful when |
| A. | when we need to limit the number of threads running in the application at the same time |
| B. | when we need to limit the number of threads running in the application as a whole |
| C. | when we need to arrange the ordering of threads |
| D. | none of the mentioned |
| Answer» B. when we need to limit the number of threads running in the application as a whole | |
| 233. |
A deadlock can be broken by |
| A. | abort one or more processes to break the circular wait |
| B. | abort all the process in the system |
| C. | preempt all resources from all processes |
| D. | none of the mentioned |
| Answer» B. abort all the process in the system | |
| 234. |
A thread shares its resources(like data section, code section, open files, signals) with |
| A. | other process similar to the one that the thread belongs to |
| B. | other threads that belong to similar processes |
| C. | other threads that belong to the same process |
| D. | all of the mentioned |
| Answer» D. all of the mentioned | |
| 235. |
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 | |
| 236. |
The number of the threads in the pool can be decided on factors such as |
| A. | number of cpus in the system |
| B. | amount of physical memory |
| C. | expected number of concurrent client requests |
| D. | all of the mentioned |
| Answer» E. | |
| 237. |
The program initializes all aspects of the system, from CPU registers to device controllers and the contents of main memory, and then starts the operating system. |
| A. | main |
| B. | bootloader |
| C. | bootstrap |
| D. | rom |
| Answer» D. rom | |
| 238. |
Smaller page tables are implemented as a set of |
| A. | queues |
| B. | stacks |
| C. | counters |
| D. | registers |
| Answer» E. | |
| 239. |
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 | |
| 240. |
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 | |
| 241. |
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 | |
| 242. |
A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 1 |
| Answer» B. 3 | |
| 243. |
The swaps processes in and out of the memory. |
| A. | memory manager |
| B. | cpu |
| C. | cpu manager |
| D. | user |
| Answer» B. cpu | |
| 244. |
A non blocking system call |
| A. | halts the execution of the application for an extended time |
| B. | does not halt the execution of the application |
| C. | does not block the interrupts |
| D. | none of the mentioned |
| Answer» C. does not block the interrupts | |
| 245. |
If the number of cycles spent busy – waiting is not excessive, then |
| A. | interrupt driven i/o is more efficient than programmed i/o |
| B. | programmed i/o is more efficient than interrupt driven i/o |
| C. | both programmed and interrupt driven i/o are equally efficient |
| D. | none of the mentioned |
| Answer» C. both programmed and interrupt driven i/o are equally efficient | |
| 246. |
If a thread invokes the exec system call |
| A. | only the exec executes as a separate process |
| B. | the program specified in the parameter to exec will replace the entire process |
| C. | the exec is ignored as it is invoked by a thread |
| D. | none of the mentioned |
| Answer» C. the exec is ignored as it is invoked by a thread | |
| 247. |
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 | |
| 248. |
Caching is spooling. |
| A. | same as |
| B. | not the same as |
| C. | all of the mentioned |
| D. | none of the mentioned |
| Answer» C. all of the mentioned | |
| 249. |
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 | |
| 250. |
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 | |