Answer:
Boundary folding method is basically used in the java algorithm and in the hash table. In the hash function, the left and the right value are basically folded in the fixed boundary between the given center values by using the boundary folding methods.
There are basically two types of folding method in the hashing that are:
- Folding shift
- Folding boundary
In the folding boundary method the outside value are get reversed and the alternate values are get flipped at the boundary folding method.
Answer:
int count =0;
for(int i=0;i<10;i++)
{
if(myArray[i]>=0)
{
count++;
}
}
cout<<"Number of positive integers is "<<count<<endl;
Explanation:
The above written loop is for counting positive integers in the myArray[].
For counting we have taken a count integer initialized with 0.On iterating over the array if the element is greater than or equal to 0 we consider it as positive and increasing the count.At the end printing the count.
Answer:
B) the time it takes for the required sector to position itself under the read/write head.
Explanation:
In Computer science, Access time is the time it takes for the required sector to position itself under the read/write head. It is usually measured in milliseconds.
It is the speed of the storage device.
Answer:
The formula and value to this question is "=A1+A3+A4+A5 with value 100"
Explanation:
The explanation of the given question as follows:
- In question, it is defined that four cells that are "A1, A2, A3, and A4" contains value that are "10, 20, 30, and 40".
- To add these values we use addition formula that is "=A1+A2+A3+A4". it will give value 100.
- If the user inserts a new row that is "A2" and assigns a value in the cell that is "50" so, we use the above formula that adds values with these values we also use the value "100".
