Register

galvin os

• retagged by
1,405 views
0 0 votes

explain answer c and e.

1 Answer

0 0 votes

Segment table consists of 2 parts:-

  1. Base
  2. Limit

And Logical Address of Segmentation is 

  1. Sno(Segment number)
  2. Segment Offset

with the help of Sno map with Base of segment table and Segment offset Should be less than limit. Now Sno+offset= Our word in main memory

Voting & Accepting an answer helps improve the community
← Previous · relational operatorNext → · galvin os
← Previous in category · operating systemNext in category → · galvin os
Position:
Show:

Related questions

0 0 votes
0 0 answers
562
562 views
admin asked Oct 26, 2019
562 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 46 (Page No. 259)
When segmentation and paging are both being used, as in $MULTICS,$ first the segment descriptor must be looked up, then the page descriptor. Does the $TLB$ also work this...
0 0 votes
2 2 answers
1.5k
1.5k views
admin asked Oct 26, 2019
1,545 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 45 (Page No. 259)
Explain the difference between internal fragmentation and external fragmentation. Which one occurs in paging systems? Which one occurs in systems using pure segmentation?
1 1 vote
1 1 answer
1.3k
1.3k views
vamp_vaibhav asked Sep 1, 2017
1,268 views
dynamic partitioning scheme :OS
Consider a dynamic partitioning scheme.Show that on an avg. memory contains half as many holes as segments??i am not able to understand the concept of relation bw holes a...
1 1 vote
1 1 answer
1.2k
1.2k views
iarnav asked Apr 29, 2017
1,229 views
galvin
when and why are segmentation and paging sometimes combined into one scheme?