Register

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

• recategorized by
1,479 views

2 Answers

Best answer
1 votes
1 votes
Taking page size same as frame size

Physical address = frame offset + word offset

No of frames = 32 so needs 5 bits

Frame size = page size =1k words = 10 bits

So ans should be 5 + 10 = 15bits
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
0 answers
1
makhdoom ghaya asked Aug 19, 2016
2,720 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
3 votes
3 votes
3 answers
3
makhdoom ghaya asked Aug 17, 2016
881 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,903 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!