Register

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

• recategorized by
878 views

3 Answers

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,475 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
0 answers
2
makhdoom ghaya asked Aug 19, 2016
2,718 views
UGC NET CSE | December 2011 | Part 2 | Question: 29
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) A plate of data A cylinder of data A track of data A block of data
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...
User Avatar
1 votes
1 votes
2 answers
4
makhdoom ghaya asked Aug 21, 2016
2,897 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!