100 miles i assume since the avarge antanna cover 5-50 miles
The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
<h3>What is time complexity of data structures?</h3>
Time Complexity of an algorithm is known to be the depiction of the amount of time needed by the algorithm to carry out to completion.
Note that The statements that correctly describe the time complexity of data structures with N data are:
- The average time complexity of the data lookup in a hash table is O(N).
- The average time complexity of inserting data into a heap is O(logN)
Learn more about data from
brainly.com/question/17350816
#SPJ1
Answer:
Correctly position the platen of the printer to hold the paper in place.
Explanation:
Since the dot matrix printer is printing dark and clear on the left of the paper but very light on the right side of the paper, it is possible that the paper is not being held properly. So adjusting the platen will hold the paper properly and hence uniform prints on the paper.
Note: Dot matrix printers are printers that print closely related dots to form require texts (shapes) by striking some pins against an ink ribbon.
Some of the parts of these printers are; power supply, carriage assembly, Paper sensor, ribbon, platen and pins.
