MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 68 Mcqs, each offering curated multiple-choice questions to sharpen your C Programming knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The RAID devotes all of its resources to performing reconstruction, is a |
| A. | Online reconstruction |
| B. | Offline reconstruction |
| C. | Offline deconstruction |
| D. | Online deconstruction |
| Answer» C. Offline deconstruction | |
| 2. |
Exponential distribution, is such a distribution ehich has a C, of value |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» C. 2 | |
| 3. |
A fault creates one or more |
| A. | Latent error |
| B. | Mistake |
| C. | Failure |
| D. | None of above |
| Answer» B. Mistake | |
| 4. |
The sum of entry time, system response time and think time is known as |
| A. | Transaction time |
| B. | Latency |
| C. | Clock rate |
| D. | Hit delay |
| Answer» B. Latency | |
| 5. |
The times between two successive requests arriving, called the |
| A. | Interarrival time |
| B. | Arrival time |
| C. | Poisson distribution |
| D. | Average residual service time |
| Answer» B. Arrival time | |
| 6. |
When this effective error produces erroneous data that affect the delivered service, then |
| A. | Error occurs |
| B. | Failure occurs |
| C. | Fault occurs |
| D. | All above |
| Answer» C. Fault occurs | |
| 7. |
In a RAID disk array, the logical unit is configured as a particular RAID layout, such as |
| A. | RAID 4 |
| B. | RAID 5 |
| C. | RAID 6 |
| D. | RAID 7 |
| Answer» C. RAID 6 | |
| 8. |
The average arrival rate of new tasks, and the average time to perform a task is: |
| A. | Mean number of tasks in system = Arrival rate / Mean response time |
| B. | Mean number of tasks in system = Arrival rate + Mean response time |
| C. | Mean number of tasks in system = Arrival rate - Mean response time |
| D. | Mean number of tasks in system = Arrival rate |
| Answer» E. | |
| 9. |
The failure occurred because of an error, a defect in that module. The cause of an error is a |
| A. | Error |
| B. | Mistake |
| C. | Fail |
| D. | Corruption |
| Answer» B. Mistake | |
| 10. |
The area where the tasks accumulate, waiting to be serviced, is called the |
| A. | Queue |
| B. | Waiting line |
| C. | DIMM |
| D. | Both a and b |
| Answer» E. | |
| 11. |
The later added suppport known as RAID 6 is also called a |
| A. | Row-diagonal parity |
| B. | RAID-DP |
| C. | RADI 7 |
| D. | Both a and b |
| Answer» E. | |
| 12. |
An I/O system with a single disk gets on average 50 I/O requests per second and the average time for a disk to service an I/O request is 10 ms, the utilization of the I/O system would be |
| A. | 0.2 |
| B. | 0.5 |
| C. | 0.75 |
| D. | 1.5 |
| Answer» C. 0.75 | |
| 13. |
RAID 0 has no redundancy and is sometimes nicknamed as |
| A. | BJOD |
| B. | SAIL |
| C. | DIMM |
| D. | JBOD |
| Answer» E. | |
| 14. |
Bits or blocks in a file going bad over time, is a |
| A. | Interarrival time |
| B. | Logical volumes |
| C. | Bit rot |
| D. | All above |
| Answer» D. All above | |
| 15. |
The …………….. policy segments the disks request queue into sub queues of the length N. |
| A. | SCAN |
| B. | C-SCAN |
| C. | N-Step SCAN |
| D. | FSCAN |
| Answer» D. FSCAN | |
| 16. |
The capacity of a memory unit = (the number of words) * (the number of bits / words). What will be the number of separate address and data lines needed for a memory of 4k * 16 ? |
| A. | 12 address and 16 data lines |
| B. | 12 address and 12 data lines |
| C. | 11 address and 6 data lines |
| D. | 12 address and 8 data lines |
| Answer» B. 12 address and 12 data lines | |
| 17. |
What will happen when we format a floppy disk? |
| A. | Identification information is written on all tracks and sectors |
| B. | The system area is deleted |
| C. | Data is written |
| D. | Data is arranged on the disk in contiguous fashion |
| Answer» E. | |
| 18. |
Average time/task in the system, or the response time, which is the sum of Time queue and Time server is |
| A. | Time system |
| B. | Time server |
| C. | Time queue |
| D. | Arrival rate |
| Answer» B. Time server | |
| 19. |
What works on the principle of locality? |
| A. | Cache memory |
| B. | Interrupts |
| C. | Polling |
| D. | DMA |
| Answer» B. Interrupts | |
| 20. |
Data are allocated to disks in the RAID at the |
| A. | Block level |
| B. | Cache level |
| C. | Low level |
| D. | High level |
| Answer» B. Cache level | |
| 21. |
Server utilization (and, in this case, the mean number of tasks per server) is simply: |
| A. | Server utilization = Arrival rate - Timeserver |
| B. | Server utilization = Arrival rate + Timeserver |
| C. | Server utilization = Arrival rate |
| D. | Server utilization = Arrival rate / Timeserver |
| Answer» D. Server utilization = Arrival rate / Timeserver | |
| 22. |
A server utilization of 0.5, the mean number of I/O requests in the queue is |
| A. | 1.5 |
| B. | 0.75 |
| C. | (0.5)^2 |
| D. | 0.5 |
| Answer» E. | |
| 23. |
The memory allocation scheme subject to “external” fragmentation is |
| A. | segmentation |
| B. | swapping |
| C. | pure demand paging |
| D. | multiple fixed contiguous partitions |
| Answer» B. swapping | |
| 24. |
I/O throughput is sometimes called I/O bandwidth and response time is sometimes called |
| A. | Delay |
| B. | Mistake |
| C. | Failure |
| D. | Latency |
| Answer» E. | |
| 25. |
The operating system typically provides the file abstraction on top of blocks stored on the disk, called |
| A. | Logical units |
| B. | Logical volumes |
| C. | Physical volumes |
| D. | Both a and b |
| Answer» E. | |
| 26. |
The Poisson distribution is described by the following equation (called the probability mass function): |
| A. | Probability(k) = e^ a*a^k/k! |
| B. | Probability(k) = e^ |
| C. | Probability(k) = e^ |
| D. | Probability(k) = e^ |
| Answer» C. Probability(k) = e^ | |
| 27. |
Consider a computer with 8 Mbytes of main memory and a 128 K 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 | |
| 28. |
The squared coefficient of variance, traditionally called |
| A. | C^2 |
| B. | C^3 |
| C. | S^2 |
| D. | S^3 |
| Answer» B. C^3 | |
| 29. |
Improvement in capacity; measured in bits per square inch, refered to |
| A. | WAR stall |
| B. | Instruction optimizer |
| C. | Window |
| D. | Areal density |
| Answer» E. | |
| 30. |
Each entry in a Translation look-aside buffer (TLB) consists of : |
| A. | key |
| B. | value |
| C. | bit value |
| D. | constant |
| Answer» B. value | |
| 31. |
Improvement in capacity is customarily expressed as improvement in |
| A. | WAR and WAW stalls |
| B. | WAR stall |
| C. | Areal density |
| D. | Unoptimized code |
| Answer» D. Unoptimized code | |
| 32. |
Throughput is the performance metric, but response times are |
| A. | Best |
| B. | Delay |
| C. | Limited |
| D. | None of above |
| Answer» D. None of above | |
| 33. |
If interarrival times are exponentially distributed, the number ofarrivals in a time interval t is a |
| A. | Passion distribution |
| B. | Poisson process |
| C. | Poisson distribution |
| D. | Both a and b |
| Answer» C. Poisson distribution | |
| 34. |
In fixed sized partition, the degree of multi programming is bounded by ___________ |
| A. | the number of partitions |
| B. | the CPU utilization |
| C. | the memory size |
| D. | all of the mentioned |
| Answer» B. the CPU utilization | |
| 35. |
The disks found inside a server connected to an I/O bus, is refered as |
| A. | Indirect memory module |
| B. | Direct memory module |
| C. | Direct attached |
| D. | Indirect attached |
| Answer» D. Indirect attached | |
| 36. |
Adding the 0.1 ms ATA controller overhead means 0.2 ms to 0.5 ms per I/O, making the maximum rate per controller |
| A. | 500 IOPS and 300 IOPS |
| B. | 5000 IOPS and 3000 IOPS |
| C. | 3000 IOPS and 2000 IOPS |
| D. | 5000 IOPS and 2000 IOPS |
| Answer» E. | |
| 37. |
The network protocol stacks use about |
| A. | 100 CPU instructions |
| B. | 1000 CPU instructions |
| C. | 10,000 CPU instructions |
| D. | 100,000 CPU instructions |
| Answer» E. | |
| 38. |
When a fault occurs, it creates a latent error, when gets activated, becomes |
| A. | Error |
| B. | Mistake |
| C. | Effective |
| D. | Corruption |
| Answer» D. Corruption | |
| 39. |
The time between the occurrence of an error and the resulting failure is the |
| A. | Effection |
| B. | Mistake |
| C. | Latent error |
| D. | Error latency |
| Answer» E. | |
| 40. |
Faults that do not correct themselves with the passing of time, are |
| A. | Temporary faults |
| B. | Mistakes |
| C. | Permanent faults |
| D. | Failures |
| Answer» D. Failures | |
| 41. |
For disks with more than 200 cylinders, the seek distance is: |
| A. | Seek time(Distance) = a |
| B. | Seek time(Distance) = a |
| C. | Seek time(Distance) = a /( Distance |
| D. | Seek time(Distance) = a |
| Answer» B. Seek time(Distance) = a | |
| 42. |
The time for the user to enter the command, is refered as |
| A. | System response time |
| B. | Entry time |
| C. | Delay |
| D. | Latency |
| Answer» C. Delay | |
| 43. |
The average residual service time, which again assumes Poisson arrivals as: |
| A. | Average residual service time= 1/Arithemtic mean+(1+ C^2) |
| B. | Average residual service time= 2xArithemtic mean+(1+ C^2) |
| C. | Average residual service time=1/ 2xArithemtic mean+(1+ C^2) |
| D. | Average residual service time=1/ 2xArithemtic meanx(1+ C^2) |
| Answer» D. Average residual service time=1/ 2xArithemtic meanx(1+ C^2) | |
| 44. |
Redundant array, that is known as mirroring or shadowing is |
| A. | RAID 0 |
| B. | RAID 1 |
| C. | RAID 2 |
| D. | RAID 3 |
| Answer» C. RAID 2 | |
| 45. |
Memory management is |
| A. | not used in modern operating system |
| B. | replaced with virtual memory on current system |
| C. | not used on multiprogramming systems |
| D. | critical for even the simplest operating system |
| Answer» C. not used on multiprogramming systems | |
| 46. |
The I/O bus limits the maximum performance to no more than 18,600 IOPS for 16 KB blocks, then the transfer time would be |
| A. | 0.1 ms |
| B. | 0.2 ms |
| C. | 0.1 ns |
| D. | 0.2 ns |
| Answer» B. 0.2 ms | |
| 47. |
The different types of tables maintained by the operating system are ............. |
| A. | memory, logical , I/O file |
| B. | memory, I/O, file, physical |
| C. | memory, I/O, file, process |
| D. | memory, logical, I/O, physical |
| Answer» D. memory, logical, I/O, physical | |
| 48. |
Which of the following information not included in memory table ? |
| A. | The allocation of main memory to process |
| B. | The allocation of secondary memory to process |
| C. | Any information needed to manage virtual memory |
| D. | Any information about the existence of file |
| Answer» E. | |
| 49. |
…………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. |
| A. | Partition management |
| B. | Memory management |
| C. | Disk management |
| D. | All of the above |
| Answer» C. Disk management | |
| 50. |
The RAID continues to service workload requests while performing the reconstruction, is a |
| A. | Online reconstruction |
| B. | Offline reconstruction |
| C. | Online deconstruction |
| D. | Offline deconstruction |
| Answer» B. Offline reconstruction | |