Disk Scheduling Algorithms and RAID
Curriculum and historical examination lineage for Disk Scheduling Algorithms and RAID under Unit 4 (Memory Management and Storage) of Operating Systems (21CSC202J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
Suppose requests have recently arrived for data on cylinders 25, 46, 12 and 3 in order. The read-write head in currently at cylinder 20. If SSTF scheduling is used, then the...
State and explain FCFS, SSTF and SCAN disk scheduling with example. [12]
The time taken to move the disk arm to the desired cylinder is called the ________ (A) Rotational Latency (B) Seek Time (C) Random Access Time (D) Positioning Time [1]
Describe the following in detail with respect to disk: [8] i. Seek time ii. Latency iii. Access time iv. Transfer time
Consider that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving request at cylinder 143, and the previous request was at cylinder 125. The queue...
Examinations where questions for Disk Scheduling Algorithms and RAID have appeared.
Master Disk Scheduling Algorithms and RAID in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.