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).
Explanation:
the answer is call out safe or picture
Answer:
The time in which the alarm clock will sound
Explanation: Hope this helped please give me brainliest
Answer: close the program and reopen it.
Explanation: This is one of the 5 common problems in a computer. When a program wont load, Try closing and reopening the program.
Reboot the computer.
Check for known issues on the web or updates to the software.
Use Task Manager (Ctrl+Alt+DEL) if program is non-responsive to "end task."
Answer: Even though the hardware is inexpensive the writing of program is not efficient through this method as proper development of program is necessary for the clear execution due to factors like:-
- The facility of writing program even the cost of hardware is less but it is not a free facility.
- It also has a slower processing for the execution of the program
- The construction of the efficient program is necessary for the compilation and execution of it rather than poorly constructed program is worthless and inefficient in working.
