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.
| 1. |
Which of the following is not human readable I/O device ? |
| A. | Video display terminals |
| B. | Key board |
| C. | Printers |
| D. | Disk drives |
| Answer» E. | |
| 2. |
IR (Instruction register) |
| A. | Contains the address of an instruction to be fetched. |
| B. | Contains the instruction most recently fetched |
| C. | Specifies memory addresses. |
| D. | None of these. |
| Answer» C. Specifies memory addresses. | |
| 3. |
The number of process states recognized by UNIX |
| A. | Two |
| B. | Nine |
| C. | Eight |
| D. | Seven. |
| Answer» C. Eight | |
| 4. |
By principle of locality, cache memory |
| A. | Increases average memory access time. |
| B. | Reduces average memory access time |
| C. | Does not affect the average memory access time |
| D. | None of these |
| Answer» C. Does not affect the average memory access time | |
| 5. |
In two level scheme for page table, if one assume byte-level addressing and 4-kbyte (212 pages) then the 4-Gbyte (232) virtual address space is composed of |
| A. | 210 pages |
| B. | 220 pages |
| C. | 230 pages |
| D. | 240 pages |
| Answer» C. 230 pages | |
| 6. |
In disk storage devices during read and write operation |
| A. | Head is rotate while platter is stationary |
| B. | Head is stationary while platter rotates |
| C. | Head and platter are both stationary |
| D. | None is true |
| Answer» C. Head and platter are both stationary | |
| 7. |
In system buffer cache, used in UNIX, following not true |
| A. | It is a disk cache |
| B. | It is not a disk cache |
| C. | Data transfer between buffer cache and user process space always occurs using DMA. |
| D. | I/O operations with disk are handled through buffer code. |
| Answer» C. Data transfer between buffer cache and user process space always occurs using DMA. | |
| 8. |
Allocate the first hole that is big enough is called |
| A. | first fit |
| B. | best fit |
| C. | worst fit |
| D. | all of the above |
| Answer» B. best fit | |
| 9. |
The trace of the process is |
| A. | A set of instructions that execute process |
| B. | A listing of sequence of instructions that execute process |
| C. | A track of network |
| D. | None of these. |
| Answer» C. A track of network | |
| 10. |
External fragmentation solved by which allocation? |
| A. | contiguous allocation |
| B. | linked allocation |
| C. | index allocation |
| D. | both B and C |
| Answer» E. | |
| 11. |
In memory management Free page list is: A- A list of page frames available for reading in pages. B- A list where replaced page is assigned without modification. C-A list where replaced page is assigned with modification. |
| A. | A, B, C are true |
| B. | A and B are true |
| C. | A and C are true |
| D. | B and C are true. |
| Answer» C. A and C are true | |
| 12. |
Instruction register contains |
| A. | The address of an instruction to be fetched. |
| B. | The instructions most recently fetched. |
| C. | The data to be written into memory. |
| D. | The data to be read from memory. |
| Answer» C. The data to be written into memory. | |
| 13. |
In UNIX process management, the following is true |
| A. | User process enters kernel mode by issuing a system call when interrupt occurs. |
| B. | Kernel mode is executed in user process. |
| C. | User process enters kernel mode with out issuing a system call when interrupt occurs. |
| D. | None of these. |
| Answer» B. Kernel mode is executed in user process. | |
| 14. |
Allocate the smallest hole that. is big enough is called |
| A. | first fit |
| B. | best fit |
| C. | worst fit |
| D. | all of the above |
| Answer» C. worst fit | |
| 15. |
The Java run time environment is an example of |
| A. | Single user process with multiple threads |
| B. | Multiple user processes with single thread per process. |
| C. | Multiple user processes with multiple threads per process. |
| D. | None of these. |
| Answer» B. Multiple user processes with single thread per process. | |
| 16. |
UNIX recognizes following I/O devices |
| A. | Disk and Tape drives |
| B. | Terminals |
| C. | Communication lines |
| D. | All the above. |
| Answer» E. | |
| 17. |
In semaphore the process blocked by wait operation is unblocked if |
| A. | Semaphore value becomes non- negative |
| B. | Semaphore value becomes non- positive |
| C. | Semaphore value is negative |
| D. | Semaphore value is positive. |
| Answer» C. Semaphore value is negative | |
| 18. |
Data from and to magnetic disk istransformed in |
| A. | Continuation |
| B. | Blocks |
| C. | Block and Continuation both |
| D. | None of these. |
| Answer» C. Block and Continuation both | |
| 19. |
Virtual system swapping |
| A. | allocates all of memory to one program |
| B. | pages working set pages in and out as a group |
| C. | is never as efficient as normal paging |
| D. | is used only on systems that are thrashing |
| Answer» E. | |
| 20. |
RAID (Redundant Array of Independent Disks) scheme consists of |
| A. | Five levels from one to six. |
| B. | Six levels, from zero to five. |
| C. | Seven levels, from zero to six. |
| D. | None of these. |
| Answer» D. None of these. | |
| 21. |
Match the following I/O devices : A- Keyboard, 1- Human readable, B- Disk and tape drives, 2- Communication, C- Modems, 3-Machine readable |
| A. | A – 1, B – 3, C – 2 |
| B. | A – 1, B – 2, C – 3 |
| C. | A – 3, B – 2, C – 1 |
| D. | A – 2, B – 1, C – 3 |
| Answer» B. A – 1, B – 2, C – 3 | |
| 22. |
In disk storage devices, data are recorded on and later retrieved from disk via a conducting coil named |
| A. | Tail |
| B. | Foot |
| C. | Head |
| D. | Hand. |
| Answer» D. Hand. | |
| 23. |
Processor-bound tasks |
| A. | use the processor more often |
| B. | use more processor time |
| C. | use less processor time |
| D. | always take longer to execute |
| Answer» C. use less processor time | |
| 24. |
The most efficient data set organization is |
| A. | a sequential file |
| B. | an ISAM file |
| C. | variable depending upon the usage of the data set |
| D. | a partitioned data set |
| Answer» D. a partitioned data set | |
| 25. |
In 16 G byte disk with 512-bit block, the bit table requires |
| A. | 1 M bytes |
| B. | 2 M bytes |
| C. | 3 M bytes |
| D. | 4 M bytes. |
| Answer» E. | |
| 26. |
In a fixed head disk, the number of read/write head per track are |
| A. | One |
| B. | Two |
| C. | Three |
| D. | Four. |
| Answer» B. Two | |
| 27. |
The Linux operating system supports |
| A. | Single thread per process and single process. |
| B. | Multiple thread per process and single process. |
| C. | Single thread per process and multiple processes. |
| D. | Multiple thread per process and multiple processes. |
| Answer» E. | |
| 28. |
Which is/are the most important features of Microsoft windows program? |
| A. | Windows |
| B. | Pull-down menus |
| C. | Icons |
| D. | All of the above |
| Answer» E. | |
| 29. |
User-Visible register Which of the following do not support GUI (Graphical User Interface) |
| A. | DOS |
| B. | WINDOWS |
| C. | Linux |
| D. | None of these. |
| Answer» B. WINDOWS | |
| 30. |
The operating system control tables maintains file table, because |
| A. | These tables manage I/O devices and channels of the computer system. |
| B. | These tables provide information about the existence of files, their location on secondary memory and their current status. |
| C. | These tables provide information to manage process. |
| D. | None of these. |
| Answer» C. These tables provide information to manage process. | |
| 31. |
The operating system control tables maintain process tables, because |
| A. | These tables manages I/O devices |
| B. | These tables manages files |
| C. | These tables manages memory |
| D. | None of these. |
| Answer» E. | |
| 32. |
In First-In-First-out (FIFO) replacement policy used in memory management, the page frames to allocated to a process as circular buffer and |
| A. | The most recent page is removed at first |
| B. | The most recent page is removed at the last |
| C. | The most recent page is removed any time |
| D. | None of these |
| Answer» C. The most recent page is removed any time | |
| 33. |
The following is not true for master/slave architecture |
| A. | A failure of master brings down the whole system |
| B. | Operating system kernel runs on master processor only. |
| C. | Operating system kernel can run on any processor either master or slave. |
| D. | All scheduling and process manage- ment is done on master processor. |
| Answer» D. All scheduling and process manage- ment is done on master processor. | |
| 34. |
The following is not an advantage of User Level Threads (ULT). |
| A. | Thread switching does not requires kernel mode privileges because all of the thread management are within the user address space of a single process. |
| B. | Here scheduling can be application specific. |
| C. | ULT can be run an any operating system. |
| D. | When ULT executes a system call, not only that thread blocked, but all of the threads within the process are blocked. |
| Answer» E. | |
| 35. |
The process control blocks are referred for |
| A. | Process control |
| B. | I/O devices |
| C. | Memory allocation |
| D. | None of these. |
| Answer» B. I/O devices | |
| 36. |
Statement A : In memory management, the replacement policy deals with the selection of pages in memory to be replaced by arrived new page. Statement B: In memory management, the policy the fetch policy determines when a page should be bought into main memory. |
| A. | A and B both false |
| B. | A and B both true |
| C. | A is true, B is false |
| D. | A is false, B is true |
| Answer» C. A is true, B is false | |
| 37. |
In file management, the primary interface of computer system with external environment is done through |
| A. | Device drivers |
| B. | Basic file system |
| C. | Basic I/O supervisor |
| D. | Logical I/O. |
| Answer» C. Basic I/O supervisor | |
| 38. |
In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process. |
| A. | A – 1, B – 2, C – 3 |
| B. | A – 2, B – 1, C – 3 |
| C. | A – 1, B – 3, C – 2 |
| D. | A – 3, B – 1, C – 1 |
| Answer» E. | |
| 39. |
In disk scheduling when SCAN (Look) policy is applied and when last track reached in one direction |
| A. | The service direction is reversed and scan proceeds in opposite direction. |
| B. | The arm returns to the opposite end of the disk and scan begins again. |
| C. | A and B both true. |
| D. | None of these. |
| Answer» B. The arm returns to the opposite end of the disk and scan begins again. | |
| 40. |
In semaphore when the order of processes that are waiting to be removed from the queue is first in first out (FIFO) then it is called |
| A. | Weak semaphore |
| B. | Strong semaphore |
| C. | Binary semaphore |
| D. | None of these. |
| Answer» C. Binary semaphore | |
| 41. |
In monolithic operating system |
| A. | Virtually any procedure can call any other procedure. |
| B. | Virtually specific procedure can call any other procedure. |
| C. | Virtually specific procedure can call specific procedure. |
| D. | None of these. |
| Answer» B. Virtually specific procedure can call any other procedure. | |
| 42. |
Process control block is also referred as |
| A. | Fast control block |
| B. | Process descriptor |
| C. | Task descriptor |
| D. | A, B, C are all true. |
| Answer» E. | |
| 43. |
Program counter (P(C) contains |
| A. | Address of an instruction to be fetched |
| B. | Instructions most recently fetched |
| C. | Data to be written into memory |
| D. | Data to be read from memory |
| Answer» B. Instructions most recently fetched | |
| 44. |
Stub |
| A. | is included in the image for each library routine reference |
| B. | is small piece of code that indicates how to locate the appropriate memory resident library routine |
| C. | how to load the library if the routine is not already present |
| D. | all of the above |
| Answer» E. | |
| 45. |
The following resources can causedeadlocks |
| 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 | |
| 46. |
Fixed partitions |
| A. | are very common in current operating systems |
| B. | are very efficient in memory utilization |
| C. | are very inefficient in memory utilization |
| D. | are most used on large mainframe operating systems |
| Answer» D. are most used on large mainframe operating systems | |
| 47. |
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 | |
| 48. |
In uni-processor management processor through put |
| A. | Is a measure of how much work is being performed |
| B. | Is the percentage of time that the processor is busy |
| C. | Is a time interval between the submission of a process and its completion |
| D. | None of these |
| Answer» B. Is the percentage of time that the processor is busy | |
| 49. |
For multithreading |
| A. | Tasks to be performed can be independent |
| B. | Task to be performed is essentially serialized. |
| C. | Tasks cannot be divided into number of threads. |
| D. | None is true. |
| Answer» B. Task to be performed is essentially serialized. | |
| 50. |
Multithreading allows |
| A. | To run threads concurrently |
| B. | To run threads independently |
| C. | A is true, B is false |
| D. | A and B both true. |
| Answer» E. | |