On which of the following statements does the time complexity of check – McqOptions

MCQOPTIONS

1.	On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?
A.	Depends on the number of edges
B.	Depends on the number of vertices
C.	Is independent of both the number of edges and vertices
D.	It depends on both the number of edges and vertices
Answer» D. It depends on both the number of edges and vertices

Discussion

No Comment Found

Related MCQs

Given the following adjacency matrix of a graph(G) determine the number of components in the G.
For which type of graph, the given program won’t run infinitely? The Input would be in the form of an adjacency Matrix and n is its dimension (1
Given the following program, what will be the 3rd number that’d get printed in the output sequence for the given input?
If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.
Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], The total no. of ways in which every vertex can walk to itself using 2 edges is ________
Which of these adjacency matrices represents a simple graph?
If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.$
Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], how many ways are there in which a vertex can walk to itself using 2 edges.$
Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.
In the given connected graph G, what is the value of rad(G) and diam(G)?