Explanation:
Array is collection of similar data types it is a linear data structure.Array stores elements in a contiguous memory location.
We have an array arr[5] of size 5 and it is of integer type.Suppose the starting address of the array is 2000 and each memory location is one byte long.As we know that the size of integer is 2 or 4 bytes we take it 2 bytes.
If the starting address is 2000 that is of index 0 then the address of index 1 is 2000+2=2002.
address of index 2=2004.
address of index 3=2006.
address of index 4=2008.
Since size of int is 2 bytes hence we add two memory location.
I think it’s false ............
Answer:
In ADT graph the efficiency of addVertex has efficiency O(logn).
Explanation:
The time complexity of the method addvertex in ADT graph is O(logn). addVertex method has time complexity of O(logn) because it has to divide the list in half and add the vertex according to the place where the needs to be added.
hence we conclude that the answer is O(logn).
<span>A. True. hope this is what u are looking for</span>
I have no clue what you are talking about I am so sorry