)in a graph represented by adjacency matrix u can find all the neighbours of a given vertices in
a. o(1)
b. o(n)
c. o(logn)
d. o(n2)

B.O(n).

Explanation:

If the graph is represented by adjacency matrix then we can find all the neighbors of a given vertex in O(n) time because each row in adjacency matrix consists the track of the neighbors.If the other vertex is a neighbor then it contains 1 in adjacency matrix if not it contains 0.So we have to iterate over that row of the vertex to find the neighbors.

answer; i believe the name is (small business association); and ; //chamber of commerce local small business association; /// plz check first.good luck

the answer to your question would be something called hertz. the unit of measurement called a hertz, which is one cycle per second, is used to measure clock speed. within one cycle, your computer processes, refreshes, or updates itself to the changes that it is going through. in the case of computer clock speed, one hertz equals one tick per second. the clock speed of computers is usually measured in megahertz (mhz) or gigahertz (ghz)