Dark Mode

Recent questions tagged disk

1 vote

2 answers

31

UGC NET CSE | October 2020 | Part 2 | Question: 95
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 ... data transfer rate? $2,850$ KBytes/second $4,500$ KBytes/second $5,700$ KBytes/second $2,250$ KBytes/second

go_editor asked in Operating System Nov 20, 2020

2.2k views

0 votes

1 answer

32

NTANET 2020(Disk)

Sanjay Sharma asked in CBSE/UGC NET Nov 16, 2020

by Sanjay Sharma

389 views

1 vote

2 answers

33

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

admin asked in Operating System Apr 2, 2020

by admin

1.0k views

0 votes

1 answer

34

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$

admin asked in CO and Architecture Apr 1, 2020

by admin

854 views

0 votes

1 answer

35

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$

admin asked in CO and Architecture Apr 1, 2020

by admin

819 views

1 vote

2 answers

36

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$

admin asked in CO and Architecture Mar 31, 2020

by admin

1.4k views

2 votes

2 answers

37

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.

admin asked in Operating System Mar 31, 2020

by admin

1.6k views

0 votes

0 answers

38

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.

admin asked in Operating System Mar 31, 2020

by admin

1.0k views

0 votes

4 answers

39

NIELIT 2016 DEC Scientist B (CS) - Section B: 50
Where does the swap reside? RAM ROM DISK On-chip cache

admin asked in CO and Architecture Mar 31, 2020

by admin

864 views

1 vote

1 answer

40

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

admin asked in CO and Architecture Mar 30, 2020

by admin

912 views

1 vote

3 answers

41

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

admin asked in Operating System Mar 30, 2020

by admin

924 views

6 votes

3 answers

42

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$

Satbir asked in CO and Architecture Jan 13, 2020

by Satbir

3.9k views

0 votes

1 answer

43

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?

admin asked in Operating System Oct 28, 2019

by admin

375 views

0 votes

1 answer

44

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?

admin asked in Operating System Oct 28, 2019

by admin

578 views

0 votes

1 answer

45

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.$

admin asked in Operating System Oct 28, 2019

by admin

894 views

0 votes

1 answer

46

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?

admin asked in Operating System Oct 28, 2019

by admin

2.0k views

0 votes

0 answers

47

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?

admin asked in Operating System Oct 28, 2019

by admin

283 views

0 votes

0 answers

48

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.

admin asked in Operating System Oct 28, 2019

by admin

299 views

0 votes

0 answers

49

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.

admin asked in Operating System Oct 28, 2019

by admin

179 views

0 votes

0 answers

50

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?

admin asked in Operating System Oct 28, 2019

by admin

509 views

1 vote

1 answer

51

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.

admin asked in Operating System Oct 28, 2019

by admin

1.9k views

0 votes

0 answers

52

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?

admin asked in Operating System Oct 28, 2019

by admin

333 views

0 votes

0 answers

53

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?

admin asked in Operating System Oct 28, 2019

by admin

207 views

0 votes

1 answer

54

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 28 (Page No. 431)
Consider a magnetic disk consisting of $16$ heads and $400$ cylinders. This disk has four $100$-cylinder zones with the cylinders in different zones containing $160, 200, 240.$ and $280$ sectors, respectively. ... disk rotates at $7200$ RPM. Calculate the disk capacity, optimal track skew, and maximum data transfer rate.

admin asked in Operating System Oct 28, 2019

by admin

2.9k views

0 votes

1 answer

55

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 27 (Page No. 431)
If a disk has double interleaving, does it also need cylinder skew in order to avoid missing data when making a track-to-track seek? Discuss your answer.

admin asked in Operating System Oct 28, 2019

by admin

719 views

0 votes

0 answers

56

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 25 (Page No. 431)
What are the advantages and disadvantages of optical disks versus magnetic disks?

admin asked in Operating System Oct 28, 2019

by admin

342 views

0 votes

0 answers

57

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 24 (Page No. 431)
Why are optical storage devices inherently capable of higher data density than magnetic storage devices? Note: This problem requires some knowledge of high-school physics and how magnetic fields are generated.

admin asked in Operating System Oct 28, 2019

by admin

210 views

0 votes

0 answers

58

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 22 (Page No. 431)
Compare RAID level $0$ through $5$ with respect to read performance, write performance, space overhead, and reliability.

admin asked in Operating System Oct 28, 2019

by admin

302 views

0 votes

1 answer

59

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 21 (Page No. 431)
A RAID can fail if two or more of its drives crash within a short time interval. Suppose that the probability of one drive crashing in a given hour is $p.$ What is the probability of a $k$-drive RAID failing in a given hour?

admin asked in Operating System Oct 28, 2019

by admin

1.1k views

0 votes

0 answers

60

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 20 (Page No. 431)
RAID level $3$ is able to correct single-bit errors using only one parity drive. What is the point of RAID level $2$? After all, it also can only correct one error and takes more drives to do so.

admin asked in Operating System Oct 28, 2019

by admin

257 views

Page:

« prev
1
2
3
4
5
6
7
8
next »

Recent questions tagged disk