All categories

3 years ago

Modern CPUs need only a few ___________ to execute an instruction when all operands are in its registers.

Computers and Technology

1 answer:

zysi [14]3 years ago

6 0

Answer:

Nanoseconds.

Explanation:

A scheduling computer system refers to an ability of the computer that typically allows one process to use the central processing unit (CPU) while another process is waiting for input-output (I/O), thus making a complete usage of any lost central processing unit (CPU) cycles in order to prevent redundancy.

Modern CPUs need only a few nanoseconds to execute an instruction when all operands are in its registers.

In terms of the scheduling metrics of a central processing unit (CPU), the time at which a job completes or is executed minus the time at which the job arrived in the system is known as turnaround time.

Generally, it is one of the scheduling metrics to select for optimum performance of the central processing unit (CPU).

You might be interested in

Which of the following is not true about network design?Group of answer choicesIn designing LAN networks, network designers tend

sergey [27]

Answer:

In designing LAN networks, network designers tend to design err on the side of providing for less capacity than what is currently necessary.

Explanation:

In designing LAN networks, network designers tend to design err on the side of providing for less capacity than what is currently necessary is not true about network design.

8 0

3 years ago

The number of pixels displayed on the screen is known as

puteri [66]

Answer: Resolution

Explanation: The total number of pixels that can be displayed on the screen at a time is called the resolution of the screen. This resolution is normally described in the pair of numbers, such as 2560 x 1440. This means, the computer screen is 2560 pixels wide and 1440 pixels tall.

4 0

3 years ago

write an algorithm that reads to values, determines the largest value and prints the largest value with an identifying message

REY [17]

Answer:

I'm unsure of what language you are referring to, but the explanation below is in Python.

Explanation:

a = int(input("Input your first number: "))

b = int(input("Input your second number: "))

c = int(input("Input your third number: "))

maximum = max(a, b, c)

print("The largest value: ", maximum)

6 0

3 years ago

Computer Networks - Queues

lyudmila [28]

Answer:

the average arrival rate \lambda in units of packets/second is 15.24 kbps

the average number of packets w waiting to be serviced in the buffer is 762 bits

Explanation:

Given that:

A single channel with a capacity of 64 kbps.

Average packet waiting time $T_w$ in the buffer = 0.05 second

Average number of packets in residence = 1 packet

Average packet length r = 1000 bits

What are the average arrival rate \lambda in units of packets/second and the average number of packets w waiting to be serviced in the buffer?

The Conservation of Time and Messages ;

E(R) = E(W) + ρ

r = w + ρ

Using Little law ;

r = λ × T_r

w = λ × T_w

r / λ = w / λ + ρ / λ

T_r =T_w + 1 / μ

T_r = T_w +T_s

where ;

ρ = utilisation fraction of time facility

r = mean number of item in the system waiting to be served

w = mean number of packet waiting to be served

λ = mean number of arrival per second

T_r =mean time an item spent in the system

T_w = mean waiting time

μ = traffic intensity

T_s = mean service time for each arrival

the average arrival rate \lambda in units of packets/second; we have the following.

First let's determine the serving time T_s

the serving time T_s $= \dfrac{1000}{64*1000}$

= 0.015625

now; the mean time an item spent in the system T_r = T_w +T_s

where;

T_w = 0.05 (i.e the average packet waiting time)

T_s = 0.015625

T_r = 0.05 + 0.015625

T_r = 0.065625

However; the mean number of arrival per second λ is;

r = λ × T_r

λ = r / T_r

λ = 1000 / 0.065625

λ = 15238.09524 bps

λ ≅ 15.24 kbps

Thus; the average arrival rate \lambda in units of packets/second is 15.24 kbps

b) Determine the average number of packets w waiting to be serviced in the buffer.

mean number of packets w waiting to be served is calculated using the formula

w = λ × T_w

where;

T_w = 0.05

w = 15238.09524 × 0.05

w = 761.904762

w ≅ 762 bits

Thus; the average number of packets w waiting to be serviced in the buffer is 762 bits

4 0

3 years ago

Which of the following code displays the area of a circle if the radius is positive? Question 4 options: if (radius <= 0) Sys

Marina CMI [18]

Answer:

(d) if (radius > 0) System.out.println(radius * radius * 3.14159);

Explanation:

Given

Code segment (a) to (d)

Required

Which is correct

Code segment (a): radius <=0

This means that radius is 0 or less, i.e. 0 or negative

Code segment (b): radius !=0

This means that radius is not equal to 0 i.e. it could be positive or negative but definitely not 0

Code segment (c): radius >=0

This means that radius is 0 or greater, i.e. 0 or positive

Code segment (d): radius >0

This means that radius is greater than 0 i.e. positive

<em>Hence, (d) is correct</em>

3 0

3 years ago