Answer:
The smaller gear will rotate faster.
Explanation:
If a larger gear is driven by a smaller gear, the large gear will rotate slower than the smaller gear but will have a greater moment. For example, a low gear on a bike or car. If a smaller gear is driven by a larger gear, the smaller gear will rotate quicker than the larger gear but will have a smaller moment.
I hope this helps! :)
Answer:
a. 1.91 b. -8.13 mm
Explanation:
Modulus =stress/strain; calculating stress =F/A, hence determine the strain
Poisson's ratio =(change in diameter/diameter)/strain
Answer:
» Microsoft word ( word processing )
» Microsoft powerpoint ( presentation )
» Microsoft access ( database mamagement )
» Microsoft excel ( spread sheets )
Explanation:
Answer:
Explanation:
You can utilize barbed clusters to store inadequate grids. On the off chance that there are a great many lines yet each line has just 4 or 5 associations with different segments, at that point as opposed to utilizing a 1000x1000 cluster you can utilize a 1000 line rough exhibit while you simply store the components that the present section has association with another segment. Other utilization can be done on account of query tables. Query tables will be tables which have different qualities concerning a solitary key where the quantity of qualities isn't fixed. Aside from this, barbed clusters have an exceptionally set number of utilization cases. Multidimensional exhibits then again have plenty of utilizations. It is utilized to store a great deal of information reliably on the grounds that the greater part of the information is put away is steady concerning which section compares to what information. Aside from that it very well may be utilized to make thick diagrams or sparse(not effective), plotting information. Another utilization case would be used as an impermanent stockpiling for the figurings that need to tail them and utilize the past information like in powerful programming.
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.
