Register

UGC NET CSE | December 2011 | Part 2 | Question: 29

• recategorized by
2,710 views
3 votes
3 votes

The maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads)

  1. A plate of data
  2. A cylinder of data
  3. A track of data
  4. A block of data
• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
makhdoom ghaya asked Aug 19, 2016
1,474 views
UGC NET CSE | December 2011 | Part 2 | Question: 30
Consider a logical address space of $8$ pages of $1024$ words mapped with memory of $32$ frames. How many bits are there in the physical address ? $9$ bits $11$ bits $13$ bits $15$ bits
Consider a logical address space of $8$ pages of $1024$ words mapped with memory of $32$ frames. How many bits are there in the physical address ?$9$ bits$11$ bits$13$ bi...
User Avatar
3 votes
3 votes
3 answers
3
makhdoom ghaya asked Aug 17, 2016
873 views
UGC NET CSE | December 2011 | Part 2 | Question: 26
Dijikstra banking algorithm in an operating system, solves the problem of Deadlock avoidance Deadlock recovery Mutual exclusion Context switching
Dijikstra banking algorithm in an operating system, solves the problem ofDeadlock avoidanceDeadlock recoveryMutual exclusionContext switching
User Avatar
1 votes
1 votes
2 answers
4
makhdoom ghaya asked Aug 21, 2016
2,881 views
UGC NET CSE | December 2011 | Part 2 | Question: 50
The number of nodes in a complete binary tree of height $h$ (with roots at level $0$) is equal to $2^{0} + 2^{1} + ….. 2^{h}$ $2^{0} + 2^{1} + ….. 2^{h-1}$ $2^{0} + 2^{1} + ….. 2^{h+1}$ $2^{1} + ….. 2^{h+1}$
The number of nodes in a complete binary tree of height $h$ (with roots at level $0$) is equal to$2^{0} + 2^{1} + ….. 2^{h}$$2^{0} + 2^{1} + ….. 2^{h-1}$ $2^{0} + 2^{...
User Avatar
Link Copied!