All categories

3 years ago

Please help me with this! I’m using Python 3

Computers and Technology

1 answer:

IgorLugansk [536]3 years ago

3 0

Something like this?

h1 = int(input())

m1 = int(input())

s1 = int(input())

h2 = int(input())

m2 = int(input())

s2 = int(input())

s = h2*3600 + m2*60 + s2 - (h1*3600 + m1*60 + s1)

print(s)

You might be interested in

Write down the difference between Application Software and

Tems11 [23]

Without system software, system can not run on the other hand without application software, system always runs

5 0

3 years ago

A computing company is running a set of processes every day. Each process has its own start time and finish time, during which i

Helga [31]

Answer:

Above all else, let us show that this issue has the greedy choice property.

This implies that worldwide ideal arrangement can be gotten by choosing local ideal arrangements. Presently notice the following:

The global optimal solution of the issue requests us to track down the minimum number of times process_check module should be run.

It is likewise referenced that during each running interaction, process_check module should be called atleast once. Along these lines, the minimum possible number of process_check calls happens when process_check is made close to the quantity of the processes that are run.

Along these lines, we see that the global optimal solution is shaped by choosing optimal answer for the nearby advances.

Along these lines, the issue shows greedy choice property. Thus, we can utilize a greedy algorithm for this issue.

The greedy step in this calculation is to postpone the process_check as far as might be feasible. Thus, it should be run towards the finish of each interaction. So the following algorithm can be utilized:

Sort the cycles by utilizing the completion times.

Towards the finish of the 1st process in the arranged list, run the process_check module. Right now any process that is now running is removed the arranged rundown. The main interaction is additionally removed from the sorted list.

Now repeat stage 2, till all processes are finished.

In the above mentioned algorithm, the costliest advance is the step of sorting. By utilizing the optimal sorting algorithm, for example, merge sort, we can achieve it in O(n log n) asymptotic time.

Along these lines, this greedy algorithm additionally takes O(n log n) asymptotic time complexity.

5 0

3 years ago

You plug a new scanner into a USB port on your Windows system. When you first turn on the scanner, what should you expect to see

Paul [167]

Answer:

A window notifying that: Found New Hardware Wizard

Explanation:

As soon as any device is plugged into the USB port, the default settings will display a window onto the screen which will notify about the addition of a new hardware to the system. This window can further be used to know the properties of the hardware or for configuration settings.

This process is same like the software part, that whenever a new application is installed onto the system a pop up notification alerts about its presence.

So when the scanner will be attached through USB port a window will be appeared notifying about the discovery of new hardware.

3 0

3 years ago

8.6 Lesson Practice edhesive

scoundrel [369]

Incomplete question. I could only infer you are possibly referring to edhesive unit 8 questions. Here are a few sample questions;

1. Where does Python start?

2. To create the body of a function, we ____________ the code.

Answer:

1. Main Section

2. Indent

Explanation:

1. It is a common rule in Python programming language when coding for for it to begin at the first part of the Main Section.

2. Indenting a code involves creating space or jumping a line away from the margin of the text dialogue box, thus the code written there becomes the body of the function.

8 0

3 years ago

A byte in memory is identified by a unique number called its

Murrr4er [49]

It is identified by its address number.

4 0

4 years ago