menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Recent questions tagged disks

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged disks

0 votes
0 answers
1
UGCNET-Oct2020-II: 17
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an $i-$node contains the disk addresses of the first $12$ direct blocks of file, a single indirect block and a double indirect block. Approximately, what is the largest file that can be represented by an $i-$node? $513$ Kbytes $513$ MBytes $537$ Mbytes $537$ KBytes
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an $i-$node contains the disk addresses of the first $12$ direct blocks of file, a single indirect block and a double indirect block. Approximately, what is the largest file that can be represented by an $i-$node? $513$ Kbytes $513$ MBytes $537$ Mbytes $537$ KBytes
asked Nov 20, 2020 in Operating System jothee 61 views
0 votes
1 answer
2
UGCNET-Oct2020-II: 91
Comprehension: For the question given below: 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 ... $(50 K, 50000 K)$ $(25 K, 25000 K)$ $(25 K, 50000 K)$ $(40 K, 36000 K)$
Comprehension: For the question given below: 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 ... $(T,S)=$ _______ $(50 K, 50000 K)$ $(25 K, 25000 K)$ $(25 K, 50000 K)$ $(40 K, 36000 K)$
asked Nov 20, 2020 in Operating System jothee 40 views
0 votes
1 answer
3
UGCNET-Oct2020-II: 92
Comprehension: For the question given below: 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? $25,000 K$ $500,000 K$ $250,000 K$ $50,000 K$
Comprehension: For the question given below: 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? $25,000 K$ $500,000 K$ $250,000 K$ $50,000 K$
asked Nov 20, 2020 in Operating System jothee 34 views
0 votes
1 answer
4
UGCNET-Oct2020-II: 93
Comprehension: For the question given below: 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: ... are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true
Comprehension: For the question given below: 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 ... $II$ are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true
asked Nov 20, 2020 in Operating System jothee 29 views
0 votes
1 answer
5
UGCNET-Oct2020-II: 94
Comprehension: For the question given below, 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$ ... , then approximately what is the maximum rotational delay? $0.011$ seconds $0.11$ seconds $0.0011$ seconds $1.1$ seconds
Comprehension: For the question given below, 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 ( ... minute), then approximately what is the maximum rotational delay? $0.011$ seconds $0.11$ seconds $0.0011$ seconds $1.1$ seconds
asked Nov 20, 2020 in Operating System jothee 29 views
0 votes
1 answer
6
UGCNET-Oct2020-II: 95
For the question given below, 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, ... is the data transfer rate? $2,850$ KBytes/second $4,500$ KBytes/second $5,700$ KBytes/second $2,250$ KBytes/second
For the question given below, 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? $2,850$ KBytes/second $4,500$ KBytes/second $5,700$ KBytes/second $2,250$ KBytes/second
asked Nov 20, 2020 in Operating System jothee 26 views
0 votes
1 answer
7
NTA NET 2020 (DIsk)
asked Nov 17, 2020 in CBSE/UGC NET Sanjay Sharma 38 views
0 votes
1 answer
8
NTANET 2020(Disk)
asked Nov 17, 2020 in CBSE/UGC NET Sanjay Sharma 33 views
1 vote
2 answers
9
NIELIT 2016 MAR Scientist C - Section C: 26
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately) $62$ ms $60$ ms $50$ ms $47$ ms
The seek time of a disk is $30$ ms. It rotates at the rate of $30$ rotations/second. The capacity of each track is $300$ words. The access time is (approximately) $62$ ms $60$ ms $50$ ms $47$ ms
asked Apr 2, 2020 in Operating System Lakshman Patel RJIT 226 views
0 votes
1 answer
10
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 26
Which level of RAID refers to disk mirroring with block striping? RAID level $1$ RAID level $2$ RAID level $0$ RAID level $3$
Which level of RAID refers to disk mirroring with block striping? RAID level $1$ RAID level $2$ RAID level $0$ RAID level $3$
asked Apr 1, 2020 in CO and Architecture Lakshman Patel RJIT 147 views
0 votes
2 answers
11
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 1
Which level of RAID refers to disk mirroring with block striping? RAID level $1$ RAID level $2$ RAID level $0$ RAID level $3$
Which level of RAID refers to disk mirroring with block striping? RAID level $1$ RAID level $2$ RAID level $0$ RAID level $3$
asked Apr 1, 2020 in CO and Architecture Lakshman Patel RJIT 192 views
1 vote
2 answers
12
NIELIT 2017 DEC Scientific Assistant A - Section B: 23
A $3.5$ inch micro floppy high density disk contains the data _________ . $720 \: MB$ $1.44 \: MB$ $720 \: KB$ $1.44 \: KB$
A $3.5$ inch micro floppy high density disk contains the data _________ . $720 \: MB$ $1.44 \: MB$ $720 \: KB$ $1.44 \: KB$
asked Mar 31, 2020 in CO and Architecture Lakshman Patel RJIT 358 views
1 vote
2 answers
13
NIELIT 2016 MAR Scientist B - Section C: 8
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases. decreases. remains the same. either remains constant or decreases.
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases. decreases. remains the same. either remains constant or decreases.
asked Mar 31, 2020 in Operating System Lakshman Patel RJIT 311 views
0 votes
0 answers
14
NIELIT 2016 MAR Scientist B - Section C: 36
What is the elapsed time of $P$ if records of $F$ are organized using a blocking factor of $2$(i.e. each block on $D$ contains two records of $F$) and $P$ uses one buffer? $12$ sec. $14$ sec. $17$ sec. $21$ sec.
What is the elapsed time of $P$ if records of $F$ are organized using a blocking factor of $2$(i.e. each block on $D$ contains two records of $F$) and $P$ uses one buffer? $12$ sec. $14$ sec. $17$ sec. $21$ sec.
asked Mar 31, 2020 in Operating System Lakshman Patel RJIT 292 views
0 votes
1 answer
16
NIELIT 2017 July Scientist B (CS) - Section B: 22
What is the average Access Time for a drum rotating at $4000$ revolutions per minute? $2.5$ milliseconds $5.0$ milliseconds $7.5$ milliseconds $4.0$ milliseconds
What is the average Access Time for a drum rotating at $4000$ revolutions per minute? $2.5$ milliseconds $5.0$ milliseconds $7.5$ milliseconds $4.0$ milliseconds
asked Mar 30, 2020 in CO and Architecture Lakshman Patel RJIT 241 views
1 vote
3 answers
17
NIELIT 2017 July Scientist B (CS) - Section B: 25
Which access method is used for obtaining a record from cassette tape? Direct Sequential Random Parallel
Which access method is used for obtaining a record from cassette tape? Direct Sequential Random Parallel
asked Mar 30, 2020 in Operating System Lakshman Patel RJIT 209 views
2 votes
2 answers
18
ISRO2020-46
A magnetic disk has $100$ cylinders, each with $10$ tracks of $10$ sectors. If each sector contains $128$ bytes, what is the maximum capacity of the disk in kilobytes? $1,280,000$ $1280$ $1250$ $128,000$
A magnetic disk has $100$ cylinders, each with $10$ tracks of $10$ sectors. If each sector contains $128$ bytes, what is the maximum capacity of the disk in kilobytes? $1,280,000$ $1280$ $1250$ $128,000$
asked Jan 13, 2020 in CO and Architecture Satbir 1k views
0 votes
1 answer
19
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 41 (Page No. 433)
A bitmap terminal contains $1600$ by $1200$ pixels. To scroll a window, the CPU (or controller) must move all the lines of text upward by copying their bits from one part of the video RAM to another. If a particular ... ? Putting a character on the screen takes $5\: \mu sec.$ How many lines per second can be displayed?
A bitmap terminal contains $1600$ by $1200$ pixels. To scroll a window, the CPU (or controller) must move all the lines of text upward by copying their bits from one part of the video RAM to another. If a particular window is $80$ lines high by $80$ characters ... baud rate of the terminal? Putting a character on the screen takes $5\: \mu sec.$ How many lines per second can be displayed?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 96 views
0 votes
1 answer
20
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 40 (Page No. 433)
Many versions of UNIX use an unsigned $32$-bit integer to keep track of the time as the number of seconds since the origin of time. When will these systems wrap around (year and month)? Do you expect this to actually happen?
Many versions of UNIX use an unsigned $32$-bit integer to keep track of the time as the number of seconds since the origin of time. When will these systems wrap around (year and month)? Do you expect this to actually happen?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 95 views
0 votes
1 answer
21
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 39 (Page No. 433)
A system simulates multiple clocks by chaining all pending clock requests together as shown in Fig. 5-30. Suppose the current time is $5000$ and there are pending clock requests for time $5008, 5012, 5015, 5029,4$ ... $5017$ for $5033.$ Show the values of Clock header, Current time and Next signal at time $5023.$
A system simulates multiple clocks by chaining all pending clock requests together as shown in Fig. 5-30. Suppose the current time is $5000$ and there are pending clock requests for time $5008, 5012, 5015, 5029,4$ and $5037.$ Show the values of Clock header, Current ... pending) signal arrives at time $5017$ for $5033.$ Show the values of Clock header, Current time and Next signal at time $5023.$
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 117 views
0 votes
1 answer
22
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 38 (Page No. 432)
A computer uses a programmable clock in square-wave mode. If a $500\:MHz$ crystal is used, what should be the value of the holding register to achieve a clock resolution of a millisecond (a clock tick once every millisecond)? $100$ microseconds?
A computer uses a programmable clock in square-wave mode. If a $500\:MHz$ crystal is used, what should be the value of the holding register to achieve a clock resolution of a millisecond (a clock tick once every millisecond)? $100$ microseconds?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 232 views
0 votes
0 answers
23
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 36 (Page No. 432)
In the discussion on stable storage, a key assumption is that a CPU crash that corrupts a sector leads to an incorrect ECC. What problems might arise in the five crash-recovery scenarios shown in Figure 5-27 if this assumption does not hold?
In the discussion on stable storage, a key assumption is that a CPU crash that corrupts a sector leads to an incorrect ECC. What problems might arise in the five crash-recovery scenarios shown in Figure 5-27 if this assumption does not hold?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 49 views
0 votes
0 answers
24
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 35 (Page No. 432)
In the discussion on stable storage, it was shown that the disk can be recovered to a consistent state (a write either completes or does not take place at all) if a CPU crash occurs during a write. Does this property hold if the CPU crashes again during a recovery procedure. Explain your answer.
In the discussion on stable storage, it was shown that the disk can be recovered to a consistent state (a write either completes or does not take place at all) if a CPU crash occurs during a write. Does this property hold if the CPU crashes again during a recovery procedure. Explain your answer.
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 63 views
0 votes
0 answers
25
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 34 (Page No. 432)
In the discussion of stable storage using nonvolatile RAM, the following point was glossed over. What happens if the stable write completes but a crash occurs before the operating system can write an invalid block ... in the nonvolatile RAM? Does this race condition ruin the abstraction of stable storage? Explain your answer.
In the discussion of stable storage using nonvolatile RAM, the following point was glossed over. What happens if the stable write completes but a crash occurs before the operating system can write an invalid block number in the nonvolatile RAM? Does this race condition ruin the abstraction of stable storage? Explain your answer.
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 24 views
0 votes
0 answers
26
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 33 (Page No. 432)
A personal computer salesman visiting a university in South-West Amsterdam remarked during his sales pitch that his company had devoted substantial effort to making their version of UNIX very fast. As an example, he ... measured was identical to what would be expected from first-come, first-served. Was the salesman lying?
A personal computer salesman visiting a university in South-West Amsterdam remarked during his sales pitch that his company had devoted substantial effort to making their version of UNIX very fast. As an example, he noted that their disk driver used the elevator ... the performance that he measured was identical to what would be expected from first-come, first-served. Was the salesman lying?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 75 views
0 votes
1 answer
27
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 31 (Page No. 432)
Disk requests come in to the disk driver for cylinders $10, 22, 20, 2, 40, 6,$ and $38,$ in that order. A seek takes $6\: msec$ per cylinder. How much seek time is needed for First-come, first served. Closest cylinder next. Elevator algorithm (initially moving upward). In all cases, the arm is initially at cylinder 20.
Disk requests come in to the disk driver for cylinders $10, 22, 20, 2, 40, 6,$ and $38,$ in that order. A seek takes $6\: msec$ per cylinder. How much seek time is needed for First-come, first served. Closest cylinder next. Elevator algorithm (initially moving upward). In all cases, the arm is initially at cylinder 20.
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 145 views
0 votes
0 answers
28
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 30 (Page No. 432)
A computer manufacturer decides to redesign the partition table of a Pentium hard disk to provide more than four partitions. What are some consequences of this change?
A computer manufacturer decides to redesign the partition table of a Pentium hard disk to provide more than four partitions. What are some consequences of this change?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 61 views
0 votes
0 answers
29
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 29 (Page No. 432)
A disk manufacturer has two $5.25$-inch disks that each have $10,000$ cylinders. The newer one has double the linear recording density of the older one. Which disk properties are better on the newer drive and which are the same? Are any worse on the newer one?
A disk manufacturer has two $5.25$-inch disks that each have $10,000$ cylinders. The newer one has double the linear recording density of the older one. Which disk properties are better on the newer drive and which are the same? Are any worse on the newer one?
asked Oct 28, 2019 in Operating System Lakshman Patel RJIT 46 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...