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).
Modular programming is the process of subdividing a computer program into separate sub-programs. Modularity provides flexibility in a structured programming design the following way: Modularity enables multiple programmers to work on a program at the same time. Correct answer: A
It provides developers flexibility in module maintenance.This makes the program easier to read and understand.
Explanation:
On October 31, around twelve o'clock at night, the lights were dull. It was Siberian cold and I was walking painfully under the whitish lighting of a lamppost and the retro neon lights of a convenience store in a neighborhood that was buzzing when I went to buy meat. buildings, grayish in this half-light, crumbled under the weight of sleep, while the neighborhood was still open. Its decoration was particularly macabre in tone: synthetic but very sticky spider webs adorned the porches of the terraces, pumpkin ornaments are exhibited like works of art, ... Some pushed the macabre by hanging mannequins made up in corpses. At the entrance to the neighborhood, I found the body of its owner stabbed. Frozen in place, I wondered what else awaits me. My heart was pounding, feeling a shiver of anguish. When I was removing the phone from my pocket to call my police friends, my hands were clenched in fear. An investigation was carried out to find out the causes of death. Also, I went with them so they take my words. Hopefully the murderer will be arrested to put an end to this sybilinous crime.
I think the answer is WAN (wide area network)
