The space required to store the adjacency matrix of a graph with n vertices is
A) in order of n
B) in order of n log n
C) in order of n squared
D) in order of n/2
Correct Answer:
Verified
Q11: In execution of the hypercube formulation of
Q12: Which Parallel formulation of Quick sort is
Q13: Which formulation of Dijkstra's algorithm exploits more
Q14: In Dijkstra's all pair shortest path each
Q15: A complete graph is a graph in
Q17: Graph can be represented by
A)identity matrix
B)adjacency matrix
C)sprse
Q18: to solve the all-pairs shortest paths problem
Q19: Simple backtracking is a depth-first search method
Q20: Best-first search (BFS) algorithms can search both
Q21: A* algorithm is a
A)bfs algorithm
B)dfs algorithm
C)prim\s algorithm
D)kruskal\s
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents