MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 22 Mcqs, each offering curated multiple-choice questions to sharpen your Common Topics in Competitive and Entrance exams knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In the pure User Level Threads (ULT)(i) Thread management is done by application,(ii) Thread management is done by kernel,(iii) Kernel is not aware of the existence of thread,(iv) Application program interface (API) to the kernel thread facility. |
| A. | i, iii are true |
| B. | i, ii and iii are true |
| C. | All are false |
| D. | None of these are true |
| Answer» B. i, ii and iii are true | |
| 2. |
Following is not the stream oriented I/O device |
| A. | Printer |
| B. | Mouse |
| C. | Communication modules |
| D. | Disk/tape |
| Answer» E. | |
| 3. |
In RAID scheme, which of the RAID level does not use parity calculation in redundancy achievement |
| A. | RAID 4 |
| B. | RAID 3 |
| C. | RAID 2 |
| D. | RAID 1 |
| Answer» E. | |
| 4. |
In RAID (Redundant Array of Independent Disks) scheme, which of the following RAID level does not include redundancy to improve performance ? |
| A. | RAID level 0 |
| B. | RAID level 1 |
| C. | RAID level 2 |
| D. | RAID level 4 |
| Answer» B. RAID level 1 | |
| 5. |
Which of the RAID level does not employ independent access technique ? |
| A. | RAID 6 |
| B. | RAID 5 |
| C. | RAID 4 |
| D. | RAID 3 |
| Answer» E. | |
| 6. |
Data from and to magnetic disk is transformed in |
| A. | Continuation |
| B. | Blocks |
| C. | Block and Continuation both |
| D. | None of these. |
| Answer» C. Block and Continuation both | |
| 7. |
For file management, in file operations device drivers are |
| A. | Disk drivers |
| B. | Tape drivers |
| C. | A and B both |
| D. | None of these. |
| Answer» D. None of these. | |
| 8. |
In secondary storage management, bit table, for each block on disk a vector contains |
| A. | One bit each block |
| B. | Two bit each block |
| C. | Three bit each block |
| D. | Four bit each block. |
| Answer» B. Two bit each block | |
| 9. |
When pre cleaning policy is applied in memory management |
| A. | A page is written out to secondary memory only when it has been selected for replacement. |
| B. | Modified pages are written before their page frames are needed so that can be written out in batches. |
| C. | A and B both true. |
| D. | None of these. |
| Answer» C. A and B both true. | |
| 10. |
A policy in memory management referred as clock policy because one can visualize the page frames as laid out in |
| A. | Straight line |
| B. | Rectangle |
| C. | Circle |
| D. | Square |
| Answer» D. Square | |
| 11. |
In round robin (time slicing) policy applied on uni processor scheduling |
| A. | When interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in First come First serve basis. |
| B. | When interrupt occurs, the currently running process is placed in ready queue and next ready job is selected in random order. |
| C. | No interruption is entertain |
| Answer» B. When interrupt occurs, the currently running process is placed in ready queue and next ready job is selected in random order. | |
| 12. |
The total time to prepare a disk drive mechanism for a block of data to be read from it is |
| A. | seek time |
| B. | Latency |
| C. | latency plus seek time |
| D. | transmission time |
| Answer» D. transmission time | |
| 13. |
Match the following pairs A. Logical address(1) An actual location in main memory B. Relative address (2) An address is expressed as a location relative to some known point. C. Physical address (3) A memory location independent of the current assignment of data to memory |
| A. | A 3, B 2, C 1 |
| B. | A 2, B 1, C 3 |
| C. | A 3, B 1, C 2 |
| D. | A 1, B 2, C 3 |
| Answer» B. A 2, B 1, C 3 | |
| 14. |
In real time computing |
| A. | The result of computation does not depend on the time at which computa- tion is done. |
| B. | The result of computation also depends on the time at which computation is done. |
| C. | The results are independent of the time consider |
| Answer» B. The result of computation also depends on the time at which computation is done. | |
| 15. |
The Least Recently Used (LRU) policy |
| A. | Replaces the page in memory that has not been referenced for the least time. |
| B. | Replaces the page in memory that has not been referenced for the longest time. |
| C. | Replaces the page in memory in round robin fashion. |
| D. | None of these. |
| Answer» B. Replaces the page in memory that has not been referenced for the longest time. | |
| 16. |
Which combination of the following features will suffice to characterize an OS as a multi programmed OS ?(i) More than one program may be loaded into main memory at the same time for execution.(ii) If a program waits for certain events such as I/O, another program is immediately scheduled for execution.(iii) If the execution of a program terminates, another program is immediately scheduled for execution. |
| A. | (i) only |
| B. | (ii) and (iii) |
| C. | (i) and (iii) |
| D. | (i), (ii) and (iii). |
| Answer» E. | |
| 17. |
The following resources can cause deadlocks |
| A. | Read only files |
| B. | Shared programs |
| C. | Printers |
| D. | All of the above Complex scheduling algorithms |
| Answer» D. All of the above Complex scheduling algorithms | |
| 18. |
Shared sub-directories and files are example of |
| A. | cyclic graph directory |
| B. | tree structured direction |
| C. | one level directory |
| D. | none of these |
| Answer» B. tree structured direction | |
| 19. |
The correct matching for the following pairs is - (A) Disk sucheduling, (1) Round robin, (B) Batch processing, (2) SCAN ,(C) Time sharing, (3) LIFO, (D) Interrupt processing, (4) FIFO, |
| A. | A-2, B-4, C-1, D-3 |
| B. | A-1, B-2, C-3, D-4 |
| C. | A-2, B-1, C-4, D-3 |
| D. | None of these |
| Answer» B. A-1, B-2, C-3, D-4 | |
| 20. |
Which types of file organization are supported by magnetic tape? |
| A. | random files |
| B. | contiguous sequential file |
| C. | indexed sequential file |
| D. | all of the above |
| Answer» C. indexed sequential file | |
| 21. |
In virtual memory systems, dynamic address translation |
| A. | is the hardware necessary to implement paging |
| B. | stores pages at a specific location on disk |
| C. | is useless when swapping is used |
| D. | is the part of the operating system paging algorithm |
| Answer» B. stores pages at a specific location on disk | |
| 22. |
A. Absolute Loading B. Relocatable Loading C. Dynamic Run-Time Loading; 1- It requires that a load module always be loaded into some location in main memory. 2- A load module can be located anywhere in main memory. |
| A. | A 2, B 1, C 1 |
| B. | A 1, B 1, C 2 |
| C. | A 1, B 2, C 2 |
| D. | A 1, B 2, C 1 |
| Answer» D. A 1, B 2, C 1 | |