Could someone please help?

Assume that a large number of consecutive IP addresses are available starting at 198.16.0.0 and suppose that two organizations,

Fiesta28 [93]

Answer & Explanation:

An IP version 4 address is of the form w.x.y.z/s

where s = subnet mask

w = first 8 bit field, x = 2nd 8 bit field, y = 3rd 8 bit field, and z = 4th 8 bit field

each field has 256 decimal equivalent. that is

binary denary or decimal

11111111 = 2⁸ = 256

w.x.y.z represents

in binary

11111111.11111111.11111111.11111111

in denary

255.255.255.255

note that 255 = 2⁸ - 1 = no of valid hosts/addresses

there are classes of addresses, that is

class A = w.0.0.0 example 10.0.0.0

class B = w.x.0.0 example 172.16.0.0

class C = w.x.y.0 example 198.16.8.1

where w, x, y, z could take numbers from 1 to 255

Now in the question

we were given the ip address : 198.16.0.0 (class B)

address of quantity 4000, 2000, 8000 is possible with a subnet mask of type

255.255.0.0 (denary) or

11111111.11111111.00000000.00000000(binary) where /s = /16 That is no of 1s

In a VLSM (Variable Length Subnet Mask)

Step 1

we convert the number of host/addresses for company A to binary

4000 = 111110100000 = 12 bit

step 2 (subnet mask)

vary the fixed subnet mask to reserve zeros (0s) for the 12 bit above

fixed subnet mask: 11111111.11111111.00000000.00000000 /16

variable subnet mask: 11111111.11111111.11110000.000000 /20

now we have added 4 1s in the 3rd field to reserve 12 0s

subnet mask: 255.255.16.0 (where the 1s in each field represent a denary number as follows)

1st 1 = 128, 2nd 1 = 64 as follows

1 1 1  1  1 1 1 1

128 64 32 16 8 4 2 1

step 3

in the ip network address: 198.16.0.0/19 (subnet representation) we increment this using 16

that is 16 is added to the 3rd field as follows

That means the ist Valid Ip address starts from

Ist valid Ip add: 198.16.0.1 - 198.16.15.255(last valid IP address)

Company B starts+16: 198.16.16.0 - 198.16.31.255

+16: 198.16.32.0- 198.16.47.255 etc

we repeat the steps for other companies as follows

Company B

Step 1

we convert the number of host/addresses for company B to binary

2000 = 11111010000 = 11 bit

Step 2

vary the fixed subnet mask to reserve zeros (0s) for the 11 bit above

fixed subnet mask: 11111111.11111111.00000000.00000000 /16

variable subnet mask: 11111111.11111111.11111000.000000 /21

now we have added 5 1s in the third field to reserve 11 0s

subnet mask: 255.255.8.0 (where the 1s in each field represent a denary number as follows)

1st 1 = 128, 2nd 1 = 64 as follows

1 1 1 1 1  1 1 1

128 64 32 16 8  4 2 1

Step 3

Starting from after the last valid Ip address for company A

in the ip network address: 198.16.16.0/21 (subnet representation) we increment this using 8

That means the ist Valid Ip address starts from

Ist valid Ip add: 198.16.16.1 - 198.16.23.255(last valid IP address)

Company C starts +16: 198.16.24.0- 198.16.31.255

+16: 198.16.32.0- 198.16.112.255 etc

Company C

Step 1

we convert the number of host/addresses for company C to binary

4000 = 111110100000 = 12 bit

Step 2

vary the fixed subnet mask to reserve zeros (0s) for the 12 bit above

fixed subnet mask: 11111111.11111111.00000000.00000000 /16

variable subnet mask: 11111111.11111111.11110000.000000 /20

now we have added 4 1s in the 3rd field to reserve 12 0s

subnet mask: 255.255.16.0 (where the 1s in each field represent a denary number as follows)

1st 1 = 128, 2nd 1 = 64 as follows

1 1 1 1 1 1 1 1

128 64 32 16 8 4 2 1

Step 3

Starting from after the last valid ip address for company B

in the ip network address: 198.16.24.0/20 (subnet representation) we increment this using 16

That means the ist Valid Ip address starts from

Ist valid Ip add: 198.16.24.1 - 198.16.39.255(last valid IP address)

Company C starts +16: 198.16.40.0- 198.16.55.255

+16: 198.16.56.0- 198.16.71.255 etc

Company D

Step 1

we convert the number of host/addresses for company D to binary

8000 = 1111101000000 = 13 bit

Step 2

vary the fixed subnet mask to reserve zeros (0s) for the 13 bit above

fixed subnet mask: 11111111.11111111.00000000.00000000 /16

variable subnet mask: 11111111.11111111.11100000.000000 /19

now we have added 3 1s in the 3rd field to reserve 13 0s

subnet mask: 255.255.32.0 (where the 1s in each field represent a denary number as follows)

1st 1 = 128, 2nd 1 = 64 as follows

1 1  1  1 1 1 1 1

128 64 32  16 8 4 2 1

Step 3

Starting from after the last valid ip address for company C

in the ip network address: 198.16.40.0/20 (subnet representation) we increment this using 32

That means the ist Valid Ip address starts from

Ist valid Ip add: 198.16.40.1 - 198.16.71.255(last valid IP address)

Company C starts +16: 198.16.72.0- 198.16.103.255

+16: 198.16.104.0- 198.16.136.255 etc

5 0

3 years ago

Jessie will make and sell the trending Baked California Maki. Her Peso mark up is 5.00. Selling price PHP 15.000. How much will

Levart [38]

Answer:

50%

Explanation:

The markup is the difference between the selling price and the cost price. If the mark up is greater than zero, it means there is a profit, if the markup is less than 0, it means there is a loss and if the markup is equal to 0, it means there is breakeven.

Percentage markup = (markup/cost price) * 100%

Selling price - cost price = markup

15 - cost price = 5

cost price = 10

Percentage markup = (markup/cost price) * 100% = (5/10) * 100% = 50%

7 0

3 years ago

Professor Midas drives an automobile from Newark to Reno along Interstate 80. His carâ€™s gas tank, when full, holds enough gas

zmey [24]

Answer:

The GREEDY Algorithm

Explanation:

Based on the situation given in question, the Greedy algorithm shall give the optimal solution to professor

Suppose that the cities are at locations0 =x0< x1< . . . < x

We shall use the induction method to prove that G is the optimal solution valid for numbers less than n

We assume another solution Z which we initially consider to be optimum as well, based on that when Z fills the tank, it fills it to full level

Let us state the values in case of n intervals. Given below, we say that g1 is the first stop and z1 is also the first stop.

This can be written as ;

G=g1, g2, . . . , gk

Z=z1, z2, . . . , zk’

Here k’ <= k and k < n

Let I be an idex where for the first time gi is not equal to zi

Considering t= maxi Zi

Z′=g1, z2, z3, . . . , zk′

Now since z2, z3, . . . , zk′ should be an optimal stopping pattern for the problem otherwise we have chosen Z, with smaller gas filling (not feasible)

Using induction hypothesis we conclude thatg2, . . . , gk is an optimal stopping pattern, which is based on greedy algorithm

7 0

3 years ago

What are the preset formulas in a spreadsheet called?

Oksanka [162]

They are called functions on a spreadsheet.

5 0

3 years ago

Read 2 more answers

Why do computers need system software?

Marina86 [1]

Computers don't need system software. System software is used to automate many tasks so the user can achieve more. Actually, one of the ideas of computer programming is to avoid needless repetition. The system software will prepare the computer for the user.

5 0

3 years ago

Could someone please help?​

Could someone please help?