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).
<h3>Sorting</h3>
The term “sorting” is used to refer to the process of arranging the data in <u>ascending or descending order</u>.
Example: Statistical data collected can be sorted alphabetically or numerically based on the value of the data.
<h3>Filtering</h3>
The process of data filtering involves selecting a <u>smaller part of your data set to view or analyze</u>. This is done by using that subset to view or analyze your data set as a whole.
Example: A complete set of data is kept, but only a portion of that set is used in the calculation, so the whole set is not used.
<em>Hope this helps :)</em>
Your answer is most likely A. Use media
The answer would be (DOCSIS). :)
Have a blessed day and hope this helps!
Answer:
The code will produce:-
2.4
Explanation:
In this code the result of the arithmetic operation is stored in the variable c.On evaluating the expression it divides 12.0 by 5 which results in 2.4 and it is stored in float variable c.Then it is printed on the screen using print statement.Since the c is double variable so the result will be a decimal number.
Hence the answer is 4.
