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
The real-valued function whose value is to be either minimized or maximized subject to the constraints defined on the given LPP over the set of feasible solutions. The objective function of a LPP is a linear function of the form z = ax + by.
Answer:
D. Wide angle
Explanation:
Wide angle camera is specifcally designed to shrinks the image using the lens with smaller focal length compared to average camera.This type of camera is commonly used to capture wider area of scenery. Or to give an impression that the objects that near the camera seems larger than they actually are.
Answer:
public static boolean isReverse(int [ ]a, int [ ]b ){
for (int i=0;i<a.length;i++)
{
if(!(a[i] == b[a.length-i-1]))
return false;
}
return true;
}
Explanation:
Using a for loop, we go through the elements of the first array. The if comapres and checks if any of the values are not the same as the appropriate value on the other array, if it is so, then it is not a reverse, and we return false. else we return true.
