Qus : 2
UGC NET Computer Science PYQ
2
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to:
1
Non-uniform distribution of requests 2
Arm starting or stopping inertia 3
Higher capacity of tracks on the periphery of the platter 4
More than one of the above Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science June 2019 (Paper II) PYQ
Solution Seek latency is the time taken by the disk arm to move the read/write head to the required track.
The arm does not move with uniform speed throughout the seek operation.
It takes time to start moving and also takes time to stop at the required track due to inertia.
Because of this starting and stopping inertia, seek latency is not linearly proportional to the seek distance.
Qus : 3
UGC NET Computer Science PYQ
3
concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If $T$ is the capacity of a track in bytes, and $S$ is the capacity of each surface in bytes, then $(T,S)=$ _____
1
$(50K,500000K)$ 2
$(25K,25000K)$ 3
$(25K,50000K)$ 4
$(40K,36000K)$ Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science Nov 2020 (Paper II) PYQ
Solution Sector size $=512$ bytes Number of sectors per track $=50$ So, capacity of one track is: $T=512\times 50$ $T=25600$ bytes Since, $1K=1024$ bytes So, $T=\frac{25600}{1024}=25K$ Now, each surface has $2000$ tracks. Capacity of each surface is: $S=25K\times 2000$ $S=50000K$ Therefore, $(T,S)=(25K,50000K)$
Qus : 4
UGC NET Computer Science PYQ
2
concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. What is the capacity of the disk, in bytes?
1
$25,000K$ 2
$500,000K$ 3
$250,000K$ 4
$50,000K$ Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science Nov 2020 (Paper II) PYQ
Solution Given, Sector size $=512$ bytes Sectors per track $=50$ Tracks per surface $=2000$ Number of double-sided platters $=5$ So, number of surfaces: $5\times 2=10$ Capacity of one track: $512\times 50=25600$ bytes Since, $1K=1024$ bytes So, $\frac{25600}{1024}=25K$ Capacity of one surface: $25K\times 2000=50000K$ Capacity of total disk: $50000K\times 10=500000K$
Qus : 5
UGC NET Computer Science PYQ
3
concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. Given below are two statements: Statement I: The disk has a total number of $2000$ cylinders. Statement II: $51200$ bytes is not a valid block size for the disk. In the light of the above statements, choose the correct answer from the options given below:
1
Both Statement I and Statement II are true 2
Both Statement I and Statement II are false 3
Statement I is correct but Statement II is false 4
Statement I is incorrect but Statement II is true Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science Nov 2020 (Paper II) PYQ
Solution Statement I is true. Number of cylinders is equal to the number of tracks per surface. Given, Tracks per surface $=2000$ So, total number of cylinders $=2000$. Therefore, Statement I is true. Statement II is false. Given sector size is: $512$ bytes A valid block size should be a multiple of sector size. Now, $51200=512\times 100$ So, $51200$ bytes is a valid block size. But Statement II says that $51200$ bytes is not a valid block size. Therefore, Statement II is false.
Qus : 6
UGC NET Computer Science PYQ
1
concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If the disk platters rotate at $5400$ rpm, then approximately what is the maximum rotational delay?
1
$0.011$ seconds 2
$0.11$ seconds 3
$0.0011$ seconds 4
$1.1$ seconds Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science Nov 2020 (Paper II) PYQ
Solution Given, Rotational speed $=5400$ rpm It means: $5400$ revolutions in $60$ seconds So, revolutions per second: $\frac{5400}{60}=90$ Time taken for one revolution: $\frac{1}{90}$ seconds $=0.0111$ seconds Maximum rotational delay is equal to time for one full revolution. So, maximum rotational delay is approximately: $0.011$ seconds
Qus : 7
UGC NET Computer Science PYQ
4
concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If one track of data can be transferred per revolution, then what is the data transfer rate?
1
$2,850$ KBytes/second 2
$4,500$ KBytes/second 3
$5,700$ KBytes/second 4
$2,250$ KBytes/second Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science Nov 2020 (Paper II) PYQ
Solution From previous calculation, capacity of one track is: $25K$ bytes Given rotational speed: $5400$ rpm Revolutions per second: $\frac{5400}{60}=90$ If one track of data is transferred per revolution, then data transferred per second is: $25K\times 90$ $=2250K$ bytes/second So, data transfer rate is: $2250$ KBytes/second
Qus : 9
UGC NET Computer Science PYQ
1
A magnetic tape drive has a transport speed of $200$ inches per second and a recording density of $1600$ bytes per inch. The time required to write $600000$ of data grouped in $100$ characters records with a blocking factor of $10$ is
1
$1.875$ sec 2
$2.6251$ sec 3
$2.0062$ sec 4
$2.6150$ sec Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science Sep 2022 (Paper II) PYQ
Solution Given, Tape transport speed $=200$ inches/second Recording density $=1600$ bytes/inch Total data $=600000$ bytes First, find the data transfer rate. Data transfer rate $=$ Transport speed $\times$ Recording density Data transfer rate $=200\times1600$ Data transfer rate $=320000$ bytes/second Now, time required to write data is: $Time=\frac{\text{Total data}}{\text{Data transfer rate}}$ $Time=\frac{600000}{320000}$ $Time=1.875$ seconds The records are grouped in $100$ characters with blocking factor $10$, so one block has: $100\times10=1000$ characters This grouping affects blocking arrangement, but the total amount of data to be written remains $600000$ bytes. Therefore, required time is: $1.875$ sec
Qus : 11
UGC NET Computer Science PYQ
1
Which of the following is/are true for Dynamic RAM $DRAM$?
It is slower than static RAM $SRAM$
Packing Density is higher than Static RAM $SRAM$
It is faster than static RAM $SRAM$
It requires data refreshing
Choose the correct answer from the options given below:
1
1, 2, and 4 Only 2
1, 2, and 3 Only 3
3 and 4 Only 4
2 and 4 Only Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science Dec 2022 Shift II (Paper II) PYQ
Solution DRAM stores data using capacitors.
Capacitors lose charge with time, so DRAM requires refreshing.
Statement 1:
DRAM is slower than SRAM.
So, statement 1 is true.
Statement 2:
DRAM uses fewer components per bit, so its packing density is higher than SRAM.
So, statement 2 is true.
Statement 3:
DRAM is not faster than SRAM.
So, statement 3 is false.
Statement 4:
DRAM requires data refreshing.
So, statement 4 is true.
Therefore, correct statements are:
$1,2,4$
Qus : 12
UGC NET Computer Science PYQ
2
Match List I with List II
LIST I
LIST II
A. RAID level 2
I. Bit interleaved parity
B. RAID level 4
II. Block interleaved distributed parity
C. RAID level 5
III. Error correcting parity
D. RAID level 3
IV. Block interleaved parity
Choose the correct answer from the options given below:
1
A – IV, B – III, C – I, D – II 2
A – III, B – IV, C – II, D – I 3
A – III, B – I, C – II, D – IV 4
A – I, B – III, C – IV, D – II Go to Discussion
UGC NET Computer Science UGC NET PYQ
UGC NET Computer Science UGC NET Computer Science June 2023 (Paper II) PYQ
Solution RAID level 2 uses error correcting parity.
RAID level 4 uses block interleaved parity.
RAID level 5 uses block interleaved distributed parity.
RAID level 3 uses bit interleaved parity.
So,
A – III, B – IV, C – II, D – I
[{"qus_id":"18427","year":"2023"},{"qus_id":"18513","year":"2022"},{"qus_id":"18642","year":"2022"},{"qus_id":"18718","year":"2022"},{"qus_id":"18774","year":"2022"},{"qus_id":"19001","year":"2020"},{"qus_id":"19002","year":"2020"},{"qus_id":"19003","year":"2020"},{"qus_id":"19004","year":"2020"},{"qus_id":"19005","year":"2020"},{"qus_id":"19234","year":"2019"},{"qus_id":"19336","year":"2018"}]