Here, on Answers [dot] com, we try our best to help you. We don't mean to do your homework for you, though.
The largest number is 11111111111111 which is 215 - 1. In decimal, that is 32767.
Pointers to far objects are stored using four bytes (32 bits). The bytes are stored little endian or low to high order. The first word contains the 14-bit memory offset (bits 14 and 15 are always 0). The second word contains the page number (or segment number for function pointers). The memory address is calculated as follows: Variable Address = (Page * 0x4000L) + OffsetFunction Address = (Segment * 0x10000L) + Offset
If the page size is 8kb, then 14 bits of the virtual address are used for the final offset. That leaves (48-14) or 34 bits to select the page table entry. That is 17,179,869,184 entries in a maximally filled page table. The physical address size has no bearing to this particular question, because you asked how many entries, not how large the page table would be.
14
If no cut intersects any previous cuts, then you can just slice it into 14 pieces.
14
14 days
Instead of asking by page and problem number, write out the problem. You will get a lot more response.
Little Bits - 2010 Guided Meditation 1-14 was released on: USA: 27 April 2010
Using n bits, you can count to 2n - 1. This is for unsigned integers. So 10 bits = 210 - 1 = 1023 14 bits = 214 - 1 = 16383 To count to 511 you need log2(511+1) = log2(512) = 9 bits. To count to 63 you need log2(63+1) = log2(64) = 6 bits.
16384
14 days