Answer:
//Code is created using java
import java.util.*;
// returns the sum
public int sum(int N)
{
if(N==1)
return (1);
else
return N+sum(N-1);
}
// code to return the Bipower ouput
public int BiPower(int N)
{
if(N==1)
return (2);
else
return 2*BiPower(N-1);
}
// Code to return TimesFive output
public int TimesFive(int N)
{
if(N==1)
return 5;
else
return 5 + timesFive(N-1);
}
public static void main(String args[])
{
//Prompts the user to enter a nonnegative integer
int N = Integer.parseInt.(console.readLine("Enter a nonnegative integer: "));
//Outputs the sum, Bipower and TimesFive
System.out.println(sum(n));
System.out.println(BiPower(n));
System.out.println(TimesFive(n));
}
}
Answer:
The answer to this question can be described as follows:
a) True
b) False
c) False
d) False
e) False
f) True
Explanation:
In option a, PATA device is used to connect the hard drives into systems. Its title suggests, depends on parallel transmitting technology, contrasted to the compulsive-signaling tools.
In option b, SATA1 is a first-generation device, and SATA3 third generation, that's why it is wrong.
In option c and option d, both were wrong because RAID 0 and RAID 5 are Cloud computing software for storing data.
In option e, An internal SATA data cable with an eSATA port can not be used as an additional connection is provided by the eSATA port.
In option f, It is true because there are 7 pins in internal SATA.
Answer: VSAT(Very Small Aperture Terminal)
Explanation:
The computer system could be connected to the transceiver via an antenna and can send and receive data.
Using satellite communication the data could be send to the end user.
Answer:
The number of subproblems are given as 
while the value of T(n) to be less than S(n) is for 342.
Explanation:
The number of subproblems are given as
Asymptotic running time for Strassen’s algorithm is 
Now, when a increases, number of subproblems determines the asymptotic running time of the problem and case 1 of master theorem applies. So, in worst case, asymptotic running time of the algorithm will be
Now, for T(n) to be smaller than S(n)
So,
So,
a=342
