Answer:
insert (array[] , value , currentsize , maxsize )
{
if maxsize <=currentsize
{
return -1
}
index = currentsize-1
while (i>=0 && array[index] > value)
{
array[index+1]=array[index]
i=i-1
}
array[i+1]=value
return 0
}
Explanation:
1: Check if array is already full, if it's full then no component may be inserted.
2: if array isn't full:
- Check parts of the array ranging from last position of range towards initial range and determine position of that initial range that is smaller than the worth to be inserted.
- Right shift every component of the array once ranging from last position up to the position larger than the position at that smaller range was known.
- assign new worth to the position that is next to the known position of initial smaller component.
Answer:
Answer D
Explanation:
They need to be checked monthly
Answer:
0.2 m/s
Explanation:
The velocity of a point on the edge of a disk rotating disk can be calculated as:
Where 
is the angular velocity and r the radius of the disk. This leads to:
Answer: A
Explanation:
Microchips are made out of silicone witch is a polymer.
Answer:
The number of threads in a worm is the number of teeth in a worm. The speed transmission ratio of a worm and worm gear set is obtained by dividing the number of teeth of the worm gear by the number of threads of the worm.
