1
GATE CSE 1995
Subjective
+5
-0
The head of a moving head disk with $$100$$ tracks numbered $$0$$ to $$99$$ is currently serving a request at tract $$55.$$ If the queue of requests kept in $$FIFO$$ order is $$10, 70, 75, 23, 65$$ Which of the two disk scheduling algorithms $$FCFS$$ (First Come First Served) and $$SSTF$$ (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
2
GATE CSE 1990
Subjective
+5
-0
A certain moving arm disk-storage device has the following specifications:
Number of tracks per surface $$=4004$$
Track storage capacity $$=130030$$ bytes
Disk speed $$=3600$$ rpm
Average seek time $$=30$$ m secs.
Estimate the average latency the disk storage capacity and the data transfer rate.
Number of tracks per surface $$=4004$$
Track storage capacity $$=130030$$ bytes
Disk speed $$=3600$$ rpm
Average seek time $$=30$$ m secs.
Estimate the average latency the disk storage capacity and the data transfer rate.
3
GATE CSE 1990
Subjective
+5
-0
Assuming the current disk cylinder to be $$50$$ and the sequence for the cylinders to be
$$1, 36, 49, 65, 53, 1, 2, 3, 20, 55, 16, 65$$ and $$78$$ find the sequences of servicing using
(i) shortest-seek time first $$(SSTF)$$
(ii) elevator disk scheduling polices.
$$1, 36, 49, 65, 53, 1, 2, 3, 20, 55, 16, 65$$ and $$78$$ find the sequences of servicing using
(i) shortest-seek time first $$(SSTF)$$
(ii) elevator disk scheduling polices.
Questions Asked from File System IO and Protection (Marks 5)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages