Disk scheduling algorithms in operating systems consider only seek distances, because Select one: a. modern disks do not disclos

Answer:

Refer to the explanation

Explanation:

Number of Mobiles=x1

Number of Workstations=x2

Constraints:

50x1 + 70x2 <= 1,60,000

250x1 + 700x2 <= 12,000,000

x1 >= 0 x2 >= 0

Objective function N(x1, x2) = 7800000000 x1 + 7200000000 x2

Excel formulae:

G17 = D9 * E7 + F9 * G7

G18= D10 * E7 * F10 * G7

G19= E7

G20= G7

G21= I17 * E7 + I18 * G7 (This will yield the Maximum)

And E7 and G7 will be the solution.

Set up your sheet as shown in the diagram and apply the formulas.

Access the tool and select solver. Upon opening the Solver dialog, confirm ‘Assume Linear model’ and ‘assume non-negative’. Click to solve the model and keep the solution.

Answer:

First I/O instruction format -> 256 ports

Second I/O instruction format -> 65536 ports

Explanation:

• The initial instruction format can address 256 ports, computed from eight bits for port addressing as 2^8 = 256 ports.

• The second instruction format allows for 65536 ports, which can be calculated using sixteen bits for addressing as 2^16 = 65536 ports.

Changing the opcode facilitates the selection between the first and second instruction format, allowing one input or output operation at a given moment.