1
GATE CSE 2014 Set 3
Numerical
+2
-0
A system contains three programs and each requires three tape units for its operation. The Minimum number of tape units which the system must have such that deadlocks never arise is _________.
2
GATE CSE 2012
+2
-0.6
A file system with 300 G Byte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system is
A
3 K Bytes
B
35 K Bytes
C
280 K Bytes
D
dependent on the size of the disk
3
GATE CSE 2011
+2
-0.6
An application loads $$100$$ libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to random location is given as $$10$$ $$ms$$. Rotational speed of disk is $$6000$$ $$rpm.$$ If all $$100$$ libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected).
A
$$0.50s$$
B
$$1.50s$$
C
$$1.25s$$
D
$$1.00s$$
4
GATE CSE 2009
+2
-0.6
Consider a disk system with $$100$$ cylinders. The requests to access the cylinders occur in following sequence:
$$4, 34, 10, 7, 19, 73, 2, 15, 6, 20$$
Assuming that the head is currently at cylinder $$50,$$ what is the time taken to satisfy all requests if it takes $$1$$ $$ms$$ to move from one cylinder to adjacent one and shortest seek time first policy is used?
A
$$95\,\,ms$$
B
$$119\,\,ms$$
C
$$233\,\,ms$$
D
$$276\,\,ms$$
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization
EXAM MAP
Joint Entrance Examination