URGENT HELP PLEASE

Who would use a magnetic hard drive? Give a scenario and include examples as well as detail.

dybincka [34]

A magnetic hard drive well all hardrives have a magnet n them id say if it was to withstand heat so it whould stay on the magnet therefore not compromising the data

3 0

4 years ago

Identify what a computer needs to

sergejj [24]

Digital sound because you want be able to hear

6 0

3 years ago

A file named numbers.txt contains an unknown number of lines, each consisting of a single positive integer. Write some code that

prisoha [69]

In Python, assume that a file containing a series of integers is named numbers.txt and exist on the computer's disk. Write a program that reads the entire numbers store in the file and calculates their total.

Here is what I have written but it does not run:

def. main():

out file=open('numbers.txt','r')

temp=outfile.readline()

total=0

while temp!='':

t=int(temp)

total=total+i

temp=outfile.readline()

outfile.close()

print('Total sum is:',total)

main()

Text file is a file named numbers.txt with the numbers 1-50 in it

Learn more:

The sum of three consecutive integers is 186. what are the integers

brainly.com/question/1768254

Keywords: python, integers, computer, numbers, program

6 0

3 years ago

Read 2 more answers

It takes 2 seconds to read or write one block from/to disk and it also takes 1 second of CPU time to merge one block of records.

Alexxx [7]

Answer:

Part a: For optimal 4-way merging, initiate with one dummy run of size 0 and merge this with the 3 smallest runs. Than merge the result to the remaining 3 runs to get a merged run of length 6000 records.

Part b: The optimal 4-way merging takes about 249 seconds.

Explanation:

The complete question is missing while searching for the question online, a similar question is found which is solved as below:

Part a

For optimal 4-way merging, we need one dummy run with size 0.

Merge 4 runs with size 0, 500, 800, and 1000 to produce a run with a run length of 2300. The new run length is calculated as follows $L_{mrg}=L_0+L_1+L_2+L_3=0+500+800+1000=2300$
Merge the run as made in step 1 with the remaining 3 runs bearing length 1000, 1200, 1500. The merged run length is 6000 and is calculated as follows

$L_{merged}=L_{mrg}+L_4+L_5+L_6=2300+1000+1200+1500=6000$

The resulting run has length 6000 records.

Part b

For step 1

Input Output Time

Input Output Time is given as

$T_{I.O}=\frac{L_{run}}{Size_{block}} \times Time_{I/O \, per\, block}$

Here

L_run is 2300 for step 01
Size_block is 100 as given
Time_{I/O per block} is 2 sec

So

$T_{I.O}=\frac{L_{run}}{Size_{block}} \times Time_{I/O \, per\, block}\\T_{I.O}=\frac{2300}{100} \times 2 sec\\T_{I.O}=46 sec$

So the input/output time is 46 seconds for step 01.

CPU Time

CPU Time is given as

$T_{CPU}=\frac{L_{run}}{Size_{block}} \times Time_{CPU \, per\, block}$

Here

L_run is 2300 for step 01
Size_block is 100 as given
Time_{CPU per block} is 1 sec

So

$T_{CPU}=\frac{L_{run}}{Size_{block}} \times Time_{CPU \, per\, block}\\T_{CPU}=\frac{2300}{100} \times 1 sec\\T_{CPU}=23 sec$

So the CPU time is 23 seconds for step 01.

Total time in step 01

$T_{step-01}=T_{I.O}+T_{CPU}\\T_{step-01}=46+23\\T_{step-01}=69 sec\\$

Total time in step 01 is 69 seconds.

For step 2

Input Output Time

Input Output Time is given as

$T_{I.O}=\frac{L_{run}}{Size_{block}} \times Time_{I/O \, per\, block}$

Here

L_run is 6000 for step 02
Size_block is 100 as given
Time_{I/O per block} is 2 sec

So

$T_{I.O}=\frac{L_{run}}{Size_{block}} \times Time_{I/O \, per\, block}\\T_{I.O}=\frac{6000}{100} \times 2 sec\\T_{I.O}=120 sec$

So the input/output time is 120 seconds for step 02.

CPU Time

CPU Time is given as

$T_{CPU}=\frac{L_{run}}{Size_{block}} \times Time_{CPU \, per\, block}$

Here

L_run is 6000 for step 02
Size_block is 100 as given
Time_{CPU per block} is 1 sec

So

$T_{CPU}=\frac{L_{run}}{Size_{block}} \times Time_{CPU \, per\, block}\\T_{CPU}=\frac{6000}{100} \times 1 sec\\T_{CPU}=60 sec$

So the CPU time is 60 seconds for step 02.

Total time in step 02

$T_{step-02}=T_{I.O}+T_{CPU}\\T_{step-02}=120+60\\T_{step-02}=180 sec\\$

Total time in step 02 is 180 seconds

Merging Time (Total)

Now the total time for merging is given as

$T_{merge}=T_{step-01}+T_{step-02}\\T_{merge}=69+180\\T_{merge}=249 sec\\$

Total time in merging is 249 seconds seconds

5 0

3 years ago

Refer to the method f:

Goshia [24]

<h2>This function will land up in infinite function call</h2>

Explanation:

first time when the function gets invoked,

f(6,8), so k=6 & n=8, inside the function it checks k==n, ie. 6==8, returns false, then one more if is available, so 6>8 is check for , once again it is false and else loop is executed, the function is called recursively using f(k-n,n), that is f(6-8,8), it means f(-2,8) is passed.

Second time,

if(-2==8) is false, so if(-2>8) is again false and function f(-10, 8) is called

if(-10==8) is false, so if(-10>8) is again false and function f(-18,8) is called

if(-18==8) is false, so if(-18>8) is again false and function f(-26,8) is called

So this goes recursively and ends in an infinite function call.

5 0

4 years ago