Multiple Choice
Graph can be represented by
A) identity matrix
B) adjacency matrix
C) sprse list
D) sparse matrix
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q15: The kernel code is dentified by the _qualifier
Q16: The space required to store the adjacency
Q17: In Dijkstra's all pair shortest path each
Q18: identify Load-Balancing Scheme/s<br>A)asynchronous round robin<br>B)global round robin<br>C)random
Q19: Odd-even transposition sort is a variation of<br>A)quick
Q21: What is the average running time of
Q22: Given an array of n elements and
Q23: In parallel Quick Sort Pivot is sent
Q24: A* algorithm is a<br>A)bfs algorithm<br>B)dfs algorithm<br>C)prim\s algorithm<br>D)kruskal\s
Q25: A person wants to visit some places.