1
GATE CSE 1995
Subjective
+5
-0
A computer installation has 1000K of main memory. The jobs arrive and finish in the following sequence.
Job 1 requiring 200k arrives
Job 2 requiring 350k arrives
Job 3 requiring 300k arrives
Job 1 finishes
Job 4 requiring 120k arrives
Job 5 requiring 150k arrives
Job 6 requiring 80k arrives

(a) Draw the memory allocation table using Best Fit and First fit algorithm.
(b) Which algorithm performs better for this sequence?

2
GATE CSE 1995
MCQ (Single Correct Answer)
+2
-0.6
The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of $$4K\,\, \times \,\,16?$$
A
$$10$$ address, $$16$$ data lines
B
$$11$$ address, $$8$$ data lines
C
$$12$$ address, $$16$$ data lines
D
$$12$$ address, $$12$$ data lines
3
GATE CSE 1995
Subjective
+2
-0
If the disk in (a) is rotating at $$3600$$ rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second between disk and memory.
4
GATE CSE 1995
Subjective
+5
-0
If the overhead for formatting a disk is $$96$$ bytes for $$40000$$ bytes sector, Compute the unformatted capacity of the disk of the following parameters:
Number of surface: $$8$$
Outer diameter of the disk : $$12cm$$
Inner diameter of the disk: $$4cm$$
Inter track space: $$0.1mm$$
Number of sectors per track: $$20$$
GATE CSE Papers
2023
2022
2020
2019
2018
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12