All categories

3 years ago

Neymar machine that Run on electricity

Computers and Technology

1 answer:

hichkok12 [17]3 years ago

8 0

"Neymar" = "name a"?

if so, well, there are many, like the little glowing box you use the type questions to the brainliest community, let it be a phone, a pc, or a molded Nintendo

if you meant Neymar indeed, I'm not sure if he runs on electricity, unless he is a soccer playing android somehow.

You might be interested in

What is an border in html

kompoz [17]

Borders can be applied to most HTML elements within the body. To make a border around an element, all you need is border-style . The values can be solid , dotted , dashed , double , groove , ridge , inset and outset . border-width sets the width of the border, most commonly using pixels as a value.

8 0

3 years ago

What are organization tools?

Nonamiya [84]

An app or software created to optimize your daily task performance

4 0

3 years ago

New friends??? if you want to be my new friend go follow my gram

lord [1]

Answer:

what you need

only friends

4 0

3 years ago

Read 2 more answers

What is the number system that uses only the numbers 0 and 1?

Bingel [31]

It is c because its C

4 0

3 years ago

Draw a timeline for each of the following scheduling algorithms. (It may be helpful to first compute a start and finish time for

12345 [234]

Answer:

See explanation below

Explanation:

Previos concepts

First Come First Serve (FCFS) "is an operating system scheduling algorithm that automatically executes queued requests and processes in order of their arrival".

Shortest job next (SJN), or the shortest job first (SJF) or shortest "is a scheduling policy that selects for execution the waiting process with the smallest execution time".

Shortest remaining time (SRF) "is a scheduling method that is a preemptive version of shortest job next scheduling'".

Round robin (RR) is an algorithm where the time parts "are assigned to each process in equal portions and in circular order, handling all processes without priority"

Solution for the problem

Assuming the dataset given on the plot attached.

Part a

For this algorithm the result would be:

Job A 0-6

Job B 6-(6+3) = 6-9

Job C 9-(9+1) = 9-10

Job D 10-(10+4) = 10-14

Part b

For this algorithm the result would be:

Job A 0-6

Job C 6-(6+1) = 6-7

Job B 7-(7+3) = 7-10

Job D 10-(10+4) = 10-14

Part c

For this algorithm the result would be:

Job A 0-1 until 14

Job B 2-(2+3) = 2-5

Job C 3-(3+2) = 3-5

Job D 9-(9+5) = 9-14

Part d

For this algorithm the result would be:

Job A 0-2 , 7-9, 12-14

Job B 2-4, 9-10

Job C 4-(4+1) = 4-5

Job D 5-7, 10-12

8 0

3 years ago