In the ______ algorithm, the disk arm goes as far as the final request in each direction, then reverses direction immediately without going to the end of the disk.

  1. Home

Question:
In the ______ algorithm, the disk arm goes as far as the final request in each direction, then reverses direction immediately without going to the end of the disk.

1.LOOK

2.SCAN

3.C-SCAN

4.C-LOOK

Posted Date:-2022-03-30 06:47:51

More MCQS Questions and answers

  1. A floppy disk is designed to rotate ___________ as compared to a hard disk drive.
  2. A performance problem with _________ is the expense of computing and writing parity.
  3. A write of a block has to access ________
  4. Defective sectors on disks are often known as ______
  5. In SCSI disks used in high end PCs, the controller maintains a list of _________ on the disk. The disk is initialized during ________ which sets aside spare sectors not visible to the operating system.
  6. RAID level 3 supports a lower number of I/Os per second, because _______
  7. The data structure for a sector typically contains _______
  8. _____ controller sends the command placed into it, via messages to the _____ controller.
  9. A disk that has a boot partition is called a _________
  10. A large number of disks in a system improves the rate at which data can be read or written if ______
  11. A single swap space ______ reside in two places.
  12. An unrecoverable error is known as ______
  13. Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67 Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is?
  14. Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67 Considering SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk head is initially at 53 is?
  15. For most computers, the bootstrap is stored in ________
  16. For swap space created in a separate disk partition where no file system or directory structure is placed, _____________ used to allocate and deallocate the blocks.
  17. If a disk fails in RAID level ___________ rebuilding lost data is easiest.
  18. If a process needs I/O to or from a disk, and if the drive or controller is busy then ________
  19. If the mean time to failure of a single disk is 100,000 hours, then the mean time to failure of some disk in an array of 100 disks will be _________
  20. If the swap space is simply a large file, within the file system, ____ used to create it, name it and allocate its space.
  21. In RAID level 4, one block read, accesses _____
  22. In SCSI disks used in high end PCs, the controller maintains a list of bad blocks on the disk. The disk is initialized during low-level formatting which sets aside spare sectors not visible to the operating system. The scheme used is known as _______ or _______
  23. In the ______ algorithm, the disk arm goes as far as the final request in each direction, then reverses direction immediately without going to the end of the disk.
  24. In the ______ algorithm, the disk arm starts at one end of the disk and moves toward the other end, servicing requests till the other end of the disk. At the other end, the direction is reversed and servicing continues.
  25. In the _______ algorithm, the disk head moves from one end to the other, servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.
  26. In UNIX, two per process ________ are used by the kernel to track swap space use.
  27. It is __________ to reread a page from the file system than to write it to swap space and then to reread it from there.
  28. Linux __________ the use of multiple swap spaces.
  29. Magnetic tape drives can write data at a speed ________ disk drives.
  30. On media that use constant linear velocity (CLV), the _____________ is uniform.
  31. RAID level ____ spreads parity and data among all N+1 disks rather than storing data in N disks and parity in 1.
  32. RAID level _____ is also known as block interleaved parity organisation and uses block level striping and keeps a parity block on a separate disk.
  33. RAID level 0+1 is used because, RAID level 0 provides ______ whereas RAID level 1 provides ________
  34. RAID level 5 is also known as _______
  35. RAID stands for _______
  36. Random access in magnetic tapes is _________ compared to magnetic disks.
  37. SSTF algorithm, like SJF __________ of some requests.
  38. The header and trailer of a sector contain information used by the disk controller such as _________ and ____
  39. The overall I/O rate in RAID level 4 is _______
  40. The potential overuse of a single parity disk is avoided in RAID level _______
  41. The process of dividing a disk into sectors that the disk controller can read and write, before a disk can store data is known as ________
  42. The solution to the problem of reliability is the introduction of _______
  43. The technique of duplicating every disk is known as _____
  44. Using swap space significantly _________ system performance.
  45. Virtual memory uses disk space as an extension of _____
  46. What is the disk bandwidth?
  47. What is the host controller?
  48. When a fixed amount of swap space is created during disk partitioning, more swap space can be added only by? I) repartitioning of the disk II) adding another swap space elsewhere
  49. When the head damages the magnetic surface, it is known as ________
  50. Where performance and reliability are both important, RAID level ____ is used.
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!