1
GATE CSE 2019
Numerical
+2
-0
The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB , and the disk block address is 32 -bits long. The maximum possible file size is (rounded off to 1 decimal place) ___________ GB.
Your input ____
2
GATE CSE 2018
Numerical
+2
-0
Consider a storage disk with $$4$$ platters (numbered as $$0, 1, 2$$ and $$3$$), $$200$$ cylinders (numbered as $$0, 1,$$ … , $$199$$), and $$256$$ sectors per track (numbered as $$0, 1, … , 255$$). The following $$6$$ disk requests of the form [sector number, cylinder number, platter number] are received by the disk controller at the same time: $$[120, 72, 2] , [180, 134, 1] , [60, 20, 0] , [212, 86, 3] , [56, 116, 2] , [118, 16, 1]$$
Currently the head is positioned at sector number $$100$$ of cylinder $$80,$$ and is moving towards higher cylinder numbers. The average power dissipation in moving the head over $$100$$ cylinders is $$20$$ milliwatts and for reversing the direction of the head movement once is $$15$$ milliwatts. Power dissipation associated with rotational latency and switching of head between different platters is negligible.
The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _______.
Your input ____
3
GATE CSE 2016 Set 1
Numerical
+2
-0
Consider a disk queue with requests for $${\rm I}/O$$ to blocks on cylinders $$47, 38, 121, 191,$$ $$87, 11, 92, 10.$$ The $$C$$-$$LOOK$$ scheduling algorithm is used. The head is initially at cylinder number $$63,$$ moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from $$0$$ to $$199.$$ The total head movement (in number of cylinders) incurred while servicing these requests is _________________ .
Your input ____
4
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First In First Out (FIFO) and Least Recently Used (LRU)?
Questions Asked from File System IO and Protection (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2020 (1)
GATE CSE 2019 (1)
GATE CSE 2018 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 1 (2)
GATE CSE 2014 Set 3 (1)
GATE CSE 2012 (1)
GATE CSE 2011 (1)
GATE CSE 2009 (1)
GATE CSE 2008 (1)
GATE CSE 2005 (1)
GATE CSE 2002 (1)
GATE CSE 1998 (1)
GATE CSE 1995 (1)
GATE CSE 1993 (2)
GATE CSE 1990 (1)
GATE CSE 1989 (1)
GATE CSE 1987 (1)
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