in classless addressing, what is the value of the prefix length(n) if the size of the...

Question

Question

in classless addressing, what is the value of the prefix length(n) if the size of the block(N) is one of the following?
a) N=1
b) N=1024
c) N=2^32

engineering Electrical-Engineering

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

Implement the following in Classless IP Addressing in C programming (b) Implement Subnetting Concepts

Implement the following in Classless IP Addressing in C programming (b) Implement Subnetting Concepts
a drive has 512 sectors per track a block size of 512 bytes and spins at...

a drive has 512 sectors per track a block size of 512 bytes and spins at 12000 rpm. (a)what is the max file size in terms of blocks for a unix file system with 1024 byte blocks and 32 bit bloack addresses if every i-node has 10 direct block addresses, 1 indirect block address, 1 double indirect block address and 1 triple indirect block address. (B) consider the prefix code : b: 1111 a:1110 i:1101 j:1100 s:101 t:100 1:01 3:00...
Classless Inter-Domain Routing (CIDR) is a method for allocating IP addresses and routing Internet Protocol packets....

Classless Inter-Domain Routing (CIDR) is a method for allocating IP addresses and routing Internet Protocol packets. Classless Inter-Domain Routing allocates address space to Internet service providers and end users on any address bit boundary, instead of on 8-bit segments. CIDR notation is a syntax of specifying IP addresses and their associated routing prefix. It appends a slash character to the address and the decimal number of leading bits of the routing prefix. 192.168.100.0/24 represents the given IPv4 address and its...

What is the length of the LINE and WORD fields if virtual addressing on a 32-bit...

What is the length of the LINE and WORD fields if virtual addressing on a 32-bit machine with 64 KB of cache and cache lines of 32 bytes each are used? +(Please explain about how to get WORD)
Assume an FFS-style file system with an 8 KB block size, 4 byte block numbers, and...

Assume an FFS-style file system with an 8 KB block size, 4 byte block numbers, and an inode that contains pointers to the first 10 block numbers, one indirect block, and one double indirect block. Remember that 1 KB = 1024 B, 1 MB = 1024 KB, and 1 GB = 1024 MB. How large in KB can a file be without needing to use the indirect block? How many block numbers can be stored in a single indirect block?...
page addressing (a) The following are virtual 16 Considered bit-addresses, with the upper 8th Bit the...

page addressing (a) The following are virtual 16 Considered bit-addresses, with the upper 8th Bit the number of the page and the lower one 8th Bit represent the offset. The physical memory included in this example 256 Page frames ( frames ) to each 256 Bytes per page, ie physical addresses from 0x0000 to 0xFFFF, where frame 0 at 0x0000 starts. Given the following page table for a process that 10 Pages (page numbers 0 - 9), some of which...

1.Suppose 98.10.72.181 is on a network with a /24 subnet prefix and a subnet field just...

1.Suppose 98.10.72.181 is on a network with a /24 subnet prefix and a subnet field just large enough to support 128 subnets. What is the corresponding network prefix, with the mask in slash length (CIDR) format? 2.One of Facebook's IPv4 blocks is a 31.13.64.0/18. How many IP addresses does this block of addresses have? 3.For each of the following destination addresses, provide the address of the subnet within the above Facebook /18 block that it will be forwarded to. Each...
A direct- mapped cache holds 1024 (or 2^10) blocks where each block is 1 word. What...

A direct- mapped cache holds 1024 (or 2^10) blocks where each block is 1 word. What is the actual size of one entry in the cache in bits? Assume the address is 32 bits. Include the valid bit and dirty bits in the calculation. 32 54 52 22
Question 8: (a) We create a Hash Table of size 7, using open addressing and linear...

Question 8: (a) We create a Hash Table of size 7, using open addressing and linear probing with the hash function h(n)=n%7. Write the content of the array after inserting the following values in sequence: 11, 28,46, 7,67, 88,0. (3 marks) . loj [1] [2] [3] [41-5] 问 (b) Explain the issue linear probing has and how it can be addressed. (3 marks)

10.a. Consider a file F which contains a sequence of variable-length records, with record's length (n)...

10.a. Consider a file F which contains a sequence of variable-length records, with record's length (n) as following: RI n-4 R6 R2 n=5 R3 n=2 R4 n=4 R5 n=2 n=7 Assume there is a disk X with 3 equal blocks, each block with length 10. By maintaining the order of records' sequence, show how the set of records of file F can be arranged in the blocks in X based on the following blocking methods: Answer: Variable Blocking Spanned Disk...