00:01
Hello, here we need to find two number of solutions.
00:05
First we start from the first solution that is here.
00:10
Number of segments are given as 8.
00:19
Now, number of bits required to represent 8 segments will be n.
00:29
Now, 2n will be 8 because here n will be 3.
00:41
Now, number of pages.
00:54
To find the number of pages, we know that virtual address space size of each segment, each segment whole divided by each page size and that is 2 to the power of 29 divided by 256.
01:43
That is 2 to the power of 21.
01:48
Now, number of bits will be required.
01:52
That is number of bits that is n1 implies 2n1 that is 2 to the power of 21.
02:13
And hence n1 will be 21 because here it is n is 21...