Moore's Law states that the number of transistors on an integrated circuit? increases by 20% every year

You work for a large company. You need to implement a backup solution for your company that will allow you to perform multiple b

Scrat [10]

Answer:

A Tape Library

Explanation:

A tape library, sometimes called a tape silo, tape robot or tape jukebox, is a storage device that contains one or more tape drives, a number of slots to hold tape cartridges, a barcode reader to identify tape cartridges and an automated method for loading tapes. It Enables faster data migrations, reduce the complexity of and increase the frequency of backups, and streamline governance in a secure and cost-effective way.

6 0

3 years ago

In python please!! Write the definition of a function named countPos that needs integer values from standard input until there a

jek_recluse [69]

Answer:

Explanation:

The following code is written in Python it doesn't use any loops, instead it uses a recursive function in order to continue asking the user for the inputs and count the number of positive values. If anything other than a number is passed it automatically ends the program.

def countPos(number=input("Enter number: "), counter=0):

try:

number = int(number)

if number > 0:

counter += 1

newNumber = input("Enter number: ")

return countPos(newNumber, counter)

else:

newNumber = input("Enter number: ")

return countPos(newNumber, counter)

except:

print(counter)

print("Program Finished")

countPos()

8 0

3 years ago

[c++] Write a recursive function takes a word string as input argument and reverse the word. Print out the results of recursive

Aleks04 [339]

I will try to give you the best answer I can possibly come up with.
The easy way to get it is to store it into an array of strings and print the array of string backwards. You can do that by starting at the last part of the array down to the first letter.

3 0

3 years ago

Recursively computing the sum of the first n positive odd integers, cont. About (a) Use induction to prove that your algorithm t

julia-pushkina [17]

The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.

int recursiveOddSum(int n) {

if(2n-1==1) return 1;

return (2n-1) + recursiveOddSum(n-1);

}

To prove the correctness of this algorithm by induction, we start from the base case as usual:

$f(1)=1$

by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).

Now we can assume that $f(n-1)$ returns indeed the sum of the first n-1 odd numbers, and we have to proof that $f(n)$ returns the sum of the first n odd numbers. By the recursive logic, we have

$f(n)=f(n-1)+2n-1$

and by induction, $f(n-1)$ is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, $f(n)$ is the sum of the first n odd numbers, as required:

$f(n)=\underbrace{\underbrace{f(n-1)}_{\text{sum of the first n-1 odds}}+\underbrace{2n-1}_{\text{n-th odd}}}_{\text{sum of the first n odds.}}$

6 0

3 years ago

Why do we use Boolean Logic operators when searching a topic?

gizmo_the_mogwai [7]

We use Boolean Logic operators because it saves more time when searching a topic. This connects pieces of information in a search allowing you to find exactly what you are looking for.

6 0

3 years ago