Q. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________

View solution

Q. For some sparse graph an adjacency list is more space efficient against an adjacency matrix.

View solution

Q. Time complexity to find if there is an edge between 2 particular vertices is _________

View solution

Q. For the given conditions, which of the following is in the correct order of increasing space requirement?
i) Undirected, no weight

ii) Directed, no weight

iii) Directed, weighted

iv) Undirected, weighted

View solution

Q. Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________

View solution

Q. In which case adjacency list is preferred in front of an adjacency matrix?

View solution

Q. To create an adjacency list C++’s map container can be used.

View solution

Q. Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?

View solution

Q. Number of vertices with odd degrees in a graph having a eulerian walk is ________

View solution

Q. How many of the following statements are correct?
i) All cyclic graphs are complete graphs.

ii) All complete graphs are cyclic graphs.

iii) All paths are bipartite.

iv) All cyclic graphs are bipartite.

v) There are cyclic graphs which are complete.

View solution

Q. All paths and cyclic graphs are bipartite graphs.

View solution

Q. What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.

View solution

Q. All trees with n vertices consists of n-1 edges.

View solution

Q. What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?

View solution

Q. Dijkstra’s Algorithm will work for both negative and positive weights?

View solution

Q. A graph having an edge from each vertex to every other vertex is called a ___________

View solution

Q. What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?

View solution

Q. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________

View solution

Q. All Graphs have unique representation on paper.

View solution

Q. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?

View solution