Drip irrigation
Drip irrigation is one of the most efficient types of irrigation systems. The efficiency of applied and lost water as well as meeting the crop water need ranges from 80% to 90%
Answer:
LAOD = 6669.86 N
Explanation:
Given data:
width
thickness 
crack length 2c = 0.5 mm at centre of specimen
stress intensity factor = k will be
we know that
[c =0.5/2 = 2.5*10^{-4}]
K = 0.1724 Mpa m^{1/2} for 1000 load
if
then load will be
LAOD = 6669.86 N
Answer:
B
Explanation:
allow battery to become fully discharged and retest
Answer:
938.7 milliseconds
Explanation:
Since the transmission rate is in bits, we will need to convert the packet size to Bits.
1 bytes = 8 bits
1 MiB = 2^20 bytes = 8 × 2^20 bits
5 MiB = 5 × 8 × 2^20 bits.
The formula for queueing delay of <em>n-th</em> packet is : (n - 1) × L/R
where L : packet size = 5 × 8 × 2^20 bits, n: packet number = 48 and R : transmission rate = 2.1 Gbps = 2.1 × 10^9 bits per second.
Therefore queueing delay for 48th packet = ( (48-1) ×5 × 8 × 2^20)/2.1 × 10^9
queueing delay for 48th packet = (47 ×40× 2^20)/2.1 × 10^9
queueing delay for 48th packet = 0.938725181 seconds
queueing delay for 48th packet = 938.725181 milliseconds = 938.7 milliseconds
Answer:
Program that removes all spaces from the given input
Explanation:
// An efficient Java program to remove all spaces
// from a string
class GFG
{
// Function to remove all spaces
// from a given string
static int removeSpaces(char []str)
{
// To keep track of non-space character count
int count = 0;
// Traverse the given string.
// If current character
// is not space, then place
// it at index 'count++'
for (int i = 0; i<str.length; i++)
if (str[i] != ' ')
str[count++] = str[i]; // here count is
// incremented
return count;
}
// Driver code
public static void main(String[] args)
{
char str[] = "g eeks for ge eeks ".toCharArray();
int i = removeSpaces(str);
System.out.println(String.valueOf(str).subSequence(0, i));
}
}
